In this paper the nodes of the hexagonal grid are used as points. Three types of neighbors are used on this grid, therefore neighborhood sequences contain values 1, 2 and 3. The grid is coordinatized by three coordinates in a symmetric way. Digital circles are classified based on digital distances using neighborhood sequences. They can be triangle, hexagon, enneagon and dodecagon. The corners of the convex hulls of these polygons are computed. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Nagy, B. (2006). Geometry of neighborhood sequences in hexagonal grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4245 LNCS, pp. 53–64). Springer Verlag. https://doi.org/10.1007/11907350_5
Mendeley helps you to discover research relevant for your work.