GENERALISED TRIANGULAR GRIDS IN DIGITAL GEOMETRY

The hexagonal and the triangular grids are duals of each other. These two grids are the first and second ones in the family of triangular grids (we can call them as one- and two-planes triangular grids). This family comes from the mapping their points to Z 3 . Their symmetric properties are trian- gular. The next grid is the three-planes triangular grid, which looks like the mix of them. In this paper we analyze this grid and its dual from view of neighbouring conditions. After this we consider the n-planes grid. We prove that for n > 3 the n-planes triangular grids are non-planar. We also examine the 'circular' three-planes grid and the higher dimensional triangular grids.

[1]  Edward S. Deutsch,et al.  Thinning algorithms on rectangular, hexagonal, and triangular arrays , 1972, Commun. ACM.

[2]  F. Thorne,et al.  Geometry of Numbers , 2017, Algebraic Number Theory.

[3]  Partha Pratim Das,et al.  Distance functions in digital geometry , 1987, Inf. Sci..

[4]  Partha Pratim Das,et al.  Generalized distances in digital geometry , 1987, Inf. Sci..

[5]  András G. Radványi.  On the rectangular grid representation of general CNN networks , 2002, Int. J. Circuit Theory Appl..

[6]  Azriel Rosenfeld,et al.  Digital geometry , 2002, JCIS.

[7]  Marcel J. E. Golay,et al.  Hexagonal Parallel Pattern Transformations , 1969, IEEE Transactions on Computers.

[8]  Benedek Nagy.  Metrics based on neighbourhood sequences in triangular grids , 2002 .

[9]  Bruce H. McCormick,et al.  The Illinois Pattern Recognition Computer-ILLIAC III , 1963, IEEE Trans. Electron. Comput..

[10]  R. A. Melter.  A survey of digital metrics , 1991 .

[11]  P. P. Das,et al.  Octagonal distances for digital pictures , 1990, Inf. Sci..

[12]  Benedek Nagy,et al.  Shortest Paths in Triangular Grids with Neighbourhood Sequences , 2003 .

[13]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[14]  Azriel Rosenfeld,et al.  Distance on a Hexagonal Grid , 1976, IEEE Transactions on Computers.

[15]  Benedek Nagy.  Finding shortest path with neighbourhood sequences in triangular grids , 2001, ISPA 2001. Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis. In conjunction with 23rd International Conference on Information Technology Interfaces (IEEE Cat..

[16]  Innchyn Her.  A symmetrical coordinate frame on the hexagonal grid for computer graphics and vision , 1993 .