Geometry of Neighborhood Sequences in Hexagonal Grid
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.
KeywordsConvex Hull Analyse Section Initial Part Neighborhood Relation Symmetric Pair
Unable to display preview. Download preview PDF.
- 2.Klette, R., Rosenfeld, A.: Digital geometry. In: Geometric methods for digital picture analysis. Morgan Kaufmann Publishers/Elsevier Science B.V, San Francisco/Amsterdam (2004)Google Scholar
- 5.Nagy, B.: A symmetric coordinate system for the hexagonal networks. In: Proceedings of Information Society 2004 – Theoretical Computer Science, ACM conference, Ljubljana, Slovenia, pp. 193–196 (2004)Google Scholar
- 6.Nagy, B.: Shortest path in triangular grids with neighbourhood sequences. Journal of Comp. and Inf. Techn. 11, 111–122 (2003)Google Scholar
- 7.Voss, K.: Discrete images, objects, and functions in ℤn. Algorithms and Combinatorics, vol. 11. Springer, Heidelberg (1993)Google Scholar
- 8.Chen, C.H., Pau, L.F., Wang, P.S.P. (eds.): Handbook of pattern recognition & computer vision. Handbooks in Science and Technology. Academic Press, Orlando (1986)Google Scholar
- 9.Gonzalez, R.C., Woods, R.E.: Digital image processing. Addison-Wesley, Reading (1992)Google Scholar