Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids

Authors:
Benedek Nagy;Robin Strand
Affiliations:
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary;Centre for Image Analysis, Uppsala University, Sweden
Venue:
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Year:
2009

Citing 15
Cited 2

Distances defined by neighborhood sequences

Pattern Recognition
Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
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
Hexagonal Image Processing: A Practical Approach (Advances in Pattern Recognition)

Hexagonal Image Processing: A Practical Approach (Advances in Pattern Recognition)
Distances based on neighbourhood sequences in non-standard three-dimensional grids

Discrete Applied Mathematics
Weighted distance transforms generalized to modules and their computation on point lattices

Pattern Recognition
Weighted distances based on neighbourhood sequences

Pattern Recognition Letters
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
Distance on a Hexagonal Grid

IEEE Transactions on Computers
Distance with generalized neighbourhood sequences in nD and ∞D

Discrete Applied Mathematics
A Connection between Z n and Generalized Triangular Grids

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Approximating euclidean distance using distances based on neighbourhood sequences in non-standard three-dimensional grids

IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Geometric transformations on the hexagonal grid

IEEE Transactions on Image Processing

Digital distance functions on three-dimensional grids

Theoretical Computer Science
Approximation of the euclidean distance by Chamfer distances

Acta Cybernetica

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two-dimensional hexagonal grid and the three-dimensional face-centered cubic grid can be described by intersecting ***3 and ***4 with a (hyper)plane. Corresponding grids in higher dimensions (n D) are examined. In this paper, we define distance functions based on neighborhood sequences on these, higher dimensional generalizations of the hexagonal grid. An algorithm to produce a shortest path based on neighborhood sequences between any two gridpoints is presented. A formula to compute distance and condition of metricity are presented for neighborhood sequences using two types of neighbors. Distance transform as an application of these distances is also shown.