An algorithmic comparison between square- and hexagonal-based grids
CVGIP: Graphical Models and Image Processing
A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids
IEEE Transactions on Visualization and Computer Graphics
Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid
ICIAP '07 Proceedings of the 14th International Conference on Image Analysis and Processing
IEEE Transactions on Computers
Geometric transformations on the hexagonal grid
IEEE Transactions on Image Processing
Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Neighborhood Sequences in the Diamond Grid --- Algorithms with Four Neighbors
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Parallel Contextual Hexagonal Array Grammars and Languages
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Digital distance functions on three-dimensional grids
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we show how non-standard three-dimensional grids,such as the face-centered cubic (fcc), the body-centered cubic(bcc), and the diamond grids can be embedded in Z4. Thefcc grid is a hyperplane in Z4, the diamond grid is theunion of two parallel hyperplanes. The union of four hyperplanes(in a circular way) gives the bcc grid. Based on these connections,several types of neighborhood structures are introduced on thesegrids. These structures span from the most natural ones (crystalbonds, Voronoi neighbors) to infinite families.