Finding shortest path with neighbourhood sequences in triangular grids

International Symposium on Image and Signal Processing and Analysis, ISPA

Volumn 2001-January, Issue , 2001, Pages 55-60

  Nagy, Benedek ^a  

^a UNIVERSITY OF DEBRECEN   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84884718287     PISSN: 18455921     EISSN: 18492266     Source Type: Conference Proceeding    
DOI: 10.1109/ISPA.2001.938603     Document Type: Conference Paper

References (4)

1. A. Rosenfeld, J. L. Pfaltz, "Distance functions on digital pictures", Pattem Recognition, vol{1}, 1968, pp. 33-61.
2. P. P. Das, "Lattice of octagonal distances in digital geometry" Pattern Recognition Letters, vol{11}, 1990, pp. 663-667.
3. A. Fazekas, A. Hajdu, L. Hajdu, "Lattice of generalized neighbourhood sequences in nD and ∞D", Information Sciences, submitted
4. I. Her, "Geometric transformations on the hexagonal grid", IEEE Transaction on Image Processing, Vol. 4. No. 9, 1995, pp. 1213-1221.