Shortest paths in triangular grids with neighbourhood sequences

BN Nagy - Journal of Computing and Information Technology, 2003 - hrcak.srce.hr
Sažetak In this paper we analyse some properties of the triangular and hexagonal grids in
the 2D digital space. We define distances based on neighbourhood relations that can be …

Characterization of digital circles in triangular grid

B Nagy - Pattern Recognition Letters, 2004 - Elsevier
In this paper we present some former results about properties of digital circles defined by
neighbourhood sequences in the triangular grid. Das and Chatterji [Inform. Sci. 50 (1990) …

[PDF][PDF] Distance functions based on neighbourhood sequences

B Nagy - Publicationes Mathematicae Debrecen, 2003 - scholar.archive.org
PP Das et al.[2] characterized the periodic neighbourhood sequences which provide a
metric and they gave an algorithm which provides a shortest path between two arbitrary …

Finding shortest path with neighbourhood sequences in triangular grids

B Nagy - ISPA 2001. Proceedings of the 2nd International …, 2001 - ieeexplore.ieee.org
In this paper, we analyze some properties of triangular and hexagonal grids in 2D digital
space. We define distances based on the neighbouring relations that can be introduced in …

Distances with neighbourhood sequences in cubic and triangular grids

B Nagy - Pattern Recognition Letters, 2007 - Elsevier
In this paper we compute distances with neighbourhood sequences in the cubic and in the
triangular grids. First we give a formula which computes the distance with arbitrary …

[HTML][HTML] Distances based on neighbourhood sequences in non-standard three-dimensional grids

R Strand, B Nagy - Discrete Applied Mathematics, 2007 - Elsevier
Properties for distances based on neighbourhood sequences on the face-centred cubic (fcc)
and the body-centred cubic (bcc) grids are presented. Formulas to both compute the …

[HTML][HTML] Distance with generalized neighbourhood sequences in nD and∞ D

B Nagy - Discrete Applied Mathematics, 2008 - Elsevier
In this paper we generalize some former results of Das et al. about distances with n-
dimensional periodic neighbourhood sequences. We use a more general definition of …

Approximations of the Euclidean distance by chamfer distances

A Hajdu, L Hajdu, R Tijdeman - arXiv preprint arXiv:1201.0876, 2012 - arxiv.org
Chamfer distances play an important role in the theory of distance transforms. Though the
determination of the exact Euclidean distance transform is also a well investigated area, the …

Weighted distances based on neighbourhood sequences

R Strand - Pattern Recognition Letters, 2007 - Elsevier
By combining weighted distances and distances based on neighbourhood sequences, a
new family of distance functions with potentially low rotational dependency is obtained. The …

Calculating distance with neighborhood sequences in the hexagonal grid

B Nagy - … Image Analysis: 10th International Workshop, IWCIA …, 2005 - Springer
The theory of neighborhood sequences is applicable in many image-processing algorithms.
The theory is well examined for the square and the cubic grids. In this paper we consider …