On Chamfer Distances on the Square and Body-Centered Cubic Grids: An Operational Research Approach

Linear programming is used to solve optimization problems. Thus, finding a shortest path in a grid is a good target to apply linear programming. In this paper, specific bipartite grids, the square and the body-centered cubic grids are studied. The former is represented as a “diagonal square grid” having points with pairs of either even or pairs of odd coordinates (highlighting the bipartite feature). Therefore, a straightforward generalization of the representation describes the body-centered cubic grid in 3D. We use chamfer paths and chamfer distances in these grids; therefore, weights for the steps between the closest neighbors and steps between the closest same type points are fixed, and depending on the weights, various paths could be the shortest one. The vectors of the various neighbors form a basis if they are independent, and their number is the same as the dimension of the space studied. Depending on the relation of the weights, various bases could give the optimal solution and various steps are used in the shortest paths. This operational research approach determines the optimal paths as basic feasible solutions of a linear programming problem. A directed graph is given containing the feasible bases as nodes and arcs with conditions on the used weights such that the simplex method may step from one feasible basis to another one. Thus, the optimal bases can be determined, and they are summarized in two theorems. If the optimal solution is not integer, then the Gomory cut is applied and the integer optimal solution is reached after only one Gomory iteration. Chamfer distances are frequently used in image processing and analysis as well as graphics-related subjects. The body-centered cubic grid, which is well-known in solid state physics, material science, and crystallography, has various applications in imaging and graphics since less samples are needed to represent the signal in the same quality than on the cubic grid. Moreover, the body-centered cubic grid has also a topological advantage over the cubic grid, namely, the neighbor Voronoi cells always share a full face.

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

[2]  Benedek Nagy,et al.  On Weighted Distances on the Khalimsky Grid , 2016, DGCI.

[3]  Petros Maragos,et al.  Optimum design of chamfer distance transforms , 1998, IEEE Trans. Image Process..

[4]  Li Jin,et al.  3D Visualization technology Based on BCC-Grid Shear-Warp Algorithm , 2006, The Proceedings of the Multiconference on "Computational Engineering in Systems Applications".

[5]  Azriel Rosenfeld,et al.  Digital geometry - geometric methods for digital picture analysis , 2004 .

[6]  Christian Roux,et al.  Ray-tracing and 3D Objects Representation in the BCC and FCC Grids , 1997, DGCI.

[7]  Benedek Nagy,et al.  Discrete Optimization: The Case of Generalized BCC Lattice , 2021, Mathematics.

[8]  P. P. Das An algorithm for computing the number of the minimal paths in digital images , 1989, Pattern Recognit. Lett..

[9]  Innchyn Her,et al.  Geometric transformations on the hexagonal grid , 1995, IEEE Trans. Image Process..

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

[11]  Robin Strand,et al.  Distances based on neighbourhood sequences in non-standard three-dimensional grids , 2007, Discret. Appl. Math..

[12]  Yazid M. Sharaiha,et al.  Binary digital image processing - a discrete approach , 1999 .

[13]  Benedek Nagy Weighted Distances on a Triangular Grid , 2014, IWCIA.

[14]  J. Shewchuk,et al.  Tetrahedral mesh generation with good dihedral angles using point lattices , 2007 .

[15]  Robin Strand,et al.  Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms , 2008, DGCI.

[16]  Samuel Matej,et al.  Binary tomography on the hexagonal grid using Gibbs priors , 1998 .

[17]  Benedek Nagy Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids , 2014, Annals of Mathematics and Artificial Intelligence.

[18]  P. R. Meyer,et al.  Computer graphics and connected topologies on finite ordered sets , 1990 .

[19]  Juan Bautista Roldán,et al.  BCC-Grid versus SC-Grid in the modeling of a sheet of graphene as a surface boundary condition in the context of ADE-FDTD , 2020, Math. Comput. Simul..

[20]  Benedek Nagy,et al.  A combinatorial coordinate system for the body-centered cubic grid , 2016, Graph. Model..

[21]  Balázs Csébfalvi An Evaluation of Prefiltered B-Spline Reconstruction for Quasi-Interpolation on the Body-Centered Cubic Lattice , 2010, IEEE Transactions on Visualization and Computer Graphics.

[22]  Benedek Nagy,et al.  Binary tomography on the isometric tessellation involving pixel shape orientation , 2020, IET Image Process..

[23]  Gunilla Borgefors,et al.  Distance transforms for three-dimensional grids with non-cubic voxels , 2005, Comput. Vis. Image Underst..

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

[25]  Peer Stelldinger,et al.  Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid , 2007, 14th International Conference on Image Analysis and Processing (ICIAP 2007).

[26]  Robin Strand,et al.  Approximating Euclidean Distance Using Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids , 2006, IWCIA.

[27]  Efim Khalimsky,et al.  Topological structures in computer science , 1987 .

[28]  G. Dantzig Programming of Interdependent Activities: II Mathematical Model , 1949 .

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

[30]  Gunilla Borgefors,et al.  Digital distance functions on three-dimensional grids , 2011, Theor. Comput. Sci..

[31]  Benedek Nagy,et al.  Weighted Distances and Digital Disks on the Khalimsky Grid , 2016, Journal of Mathematical Imaging and Vision.

[32]  Gabor T. Herman,et al.  Binary Tomography Using Gibbs Priors , 1999 .

[33]  Robert C. Bolles,et al.  Parametric Correspondence and Chamfer Matching: Two New Techniques for Image Matching , 1977, IJCAI.

[34]  Peer Stelldinger,et al.  Topology Preserving Digitization with FCC and BCC Grids , 2006, IWCIA.

[35]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[36]  G. Borgefors Distance transformations in arbitrary dimensions , 1984 .