DocumentCode
3311184
Title
Finding shortest path with neighbourhood sequences in triangular grids
Author
Nagy, Benedek
fYear
2001
fDate
2001
Firstpage
55
Lastpage
60
Abstract
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 these grids. On the triangular grid, this can be done by the help of neighbourhood sequences. We construct a shortest path in the hexagonal grid in a natural way. We present an algorithm, which produces, for a given neighbourhood sequence, a shortest path between two arbitrary points of the triangular grid, and also calculate the distance between these two points
Keywords
computational geometry; image processing; 2D digital space; digital geometry; hexagonal grids; neighbourhood sequences; shortest path; theoretical image processing; triangular grids; Digital images; Geometry; Graph theory; Humans; Image processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Image and Signal Processing and Analysis, 2001. ISPA 2001. Proceedings of the 2nd International Symposium on
Conference_Location
Pula
Print_ISBN
953-96769-4-0
Type
conf
DOI
10.1109/ISPA.2001.938603
Filename
938603
Link To Document