Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids
نویسندگان
چکیده
The two-dimensional hexagonal grid and the three-dimensional face-centered cubic grid can be described by intersecting Z and Z with a (hyper)plane. Corresponding grids in higher dimensions (nD) 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.
منابع مشابه
Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids - Parameter Optimization
Recently, a distance function was defined on the face-centered cubic and body-centered cubic grids by combining weights and neighborhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. We introduce four different error functions which are used to find the optimal weights and neig...
متن کاملWeighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms
Recently, a distance function was defined on the face-centered cubic and body-centered cubic grids by combining weights and neighbourhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. We present conditions for metricity and algorithms to compute the distances.
متن کاملWeighted Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids
By combining weighted distances and distances based on neighbourhood sequences, a new family of distance functions with potentially low rotational dependency is obtained. The basic theory for these distance functions, including functional form of the distance between two points, is presented for the face-centered cubic grid and the body-centered cubic grid. By minimizing an error function, the ...
متن کاملGenerating Distance Maps with Neighbourhood Sequences
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and body-centered cubic grids is presented. Conditions for the algorithm to produce correct results are derived using a path-based approach. Previous sequential algorithms for this task have been based on algorithms that...
متن کاملIsotropic Vector Matrix Grid and Face-Centered Cubic Lattice Data Structures
Techniques for generating data structures for isotropic vector matrix grids (or face-centered cubic lattices) are presented. Grid basics and some background mathematical foundations are also provided.
متن کامل