Shortest paths in triangular grids with neighbourhood sequences

Journal of Computing and Information Technology

Volumn 11, Issue 2, 2003, Pages 111-122

  Nagy, Benedek ^a  

^a UNIVERSITY OF DEBRECEN   (Hungary)

Author keywords

Algorithm; Digital geometry; Digital plane; Discrete geometry; Hexagonal grid; Neighbourhood relation; Neighbourhood sequence; Shortest path; Triangular grid

Indexed keywords

ALGORITHMS; GEOMETRY;

DIGITAL GEOMETRY; DIGITAL PLANE; DISCRETE GEOMETRY; HEXAGONAL GRID; NEIGHBOURHOOD; NEIGHBOURHOOD SEQUENCES; SHORTEST PATH; TRIANGULAR GRID;

GRAPH THEORY;

EID: 4644249390     PISSN: 13301136     EISSN: 18463908     Source Type: Journal    
DOI: 10.2498/cit.2003.02.04     Document Type: Article

References (18)

1. P.P. DAS,P.P. CHAKRABARTI, B.N. CHATTERJI, Generalized distances in digital geometry, Inform. Sci. 42 (1987, pp. 51-67.
2. P.P. DAS,P.P.CHAKRABARTI, B.N. CHATTERJI, Distance functions in digital geometry, Inform. Sci. 42 (1987, pp. 113-136.
3. P.P. DAS, Lattice of octagonal distances in digital geometry Pattern Recognition Lett. 11 (1990), pp. 663-667.
4. P.P. DAS, B.N. CHATTERJI, Octagonal Distances for Digital Pictures, Inform. Sci. 50 (1990), pp. 123-150.
5. P.P. DAS, Best Simple Octagonal Distances in Digital Geometry, J. Approx. Theory 68 (1992), pp. 155-174.
6. E.S. DEUTSCH, Thinning algorithms on rectangular, hexagonal and triangular arrays, Comm. ACM, 15 (1977, pp. 827-837.
7. A. FAZEKAS,A.HAJDU,L. HAJDU, Lattice of generalized neighbourhood sequences in nD and OOD, Publ. Math. Debrecen 60 2002, pp. 405-427.
8. I. HER, Geometric transformations on the hexago(reversed not sign)nal grid, IEEE Trans. Image Process. 4 1995, pp. 1213-1221.
9. E. LUCZAK,A. ROSENFELD, Distance on a Hexag(reversed not sign)onal Grid, IEEE Trans. Computers 1976, pp. 532-533.
10. B.H. MCCORMICK, The Illinois pattern recognition computer-iLLIAC III, IEEE Trans. Electronic Computers 12 (1967, pp. 791-813.
11. R.A. MELTER, A survey of digital metrics, Contemporary Mathematics 119 (1997, pp. 95-106.
12. B. NAGY, Finding Shortest Path with Neighbourhood Sequences in Triangular Grids,ITI-ISPA 2001, Pula, Croatia, pp. 55-60.
13. B. NAGY, Neighbourhood Sequences in Triangular Grids, Technical Reports No. 2001/16, University of Debrecen.
14. B. NAGY, Metrics Based on Neighbourhood Sequences in Triangular Grids, Pure Math. Appl. 13 (2007, pp. 259-274.
15. B. NAGY, Distance functions based on general(reversed not sign)ized neighbourhood sequences in finite and infinite dimensional space, ICAI'01, 5th International Con(reversed not sign)ference on Applied Informatics, Eger, 2001, pp. 183-190.
16. A. ROSENFELD, R.A. MELTER, Digital Geometry, Math. intelligencer 11 (1989), pp. 69-72.
17. A. ROSENFELD, J.L. PFALTZ, Distance functions on digital pictures, Pattern Recognition 1 1968, pp. 33-61
18. M. YAMASHITA,T. IBARAKI, Distances defined by neighborhood sequences, Pattern Recognition 19 (1987, pp. 237-246.