Surface skeletons in grids with non-cubic voxels

An algorithm for computing surface skeletons on the face-centered cubic (fcc) grid and the body-centered cubic (bcc) grid is presented. The fcc grid and the bcc grid are three-dimensional grids where the voxels are rhombic do-decahedra and truncated octahedra, respectively. The DT is used to generate the set of centres of maximal balls (CMBs) which are "anchor points" when constructing the skeleton. Simple points are used in order to make the skeleton topologically correct and CMBs to produce a fully reversible skeleton. Using only simple points and the CMBs generates a skeleton with a lot of branches. By using a set of additional conditions for removal and preservation of grid-points, most of these branches are merged into surfaces. For comparison, the algorithm is also implemented for the cubic grid.

[1]  Stina Svensson.  Reversible Surface Skeletons of 3D Objects by Iterative Thinning of Distance Transforms , 2000, Digital and Image Geometry.

[2]  Gabor T. Herman,et al.  Geometry of digital spaces , 1998, Optics & Photonics.

[3]  T. Yung Kong,et al.  Minimal Nonsimple Sets of Voxels in Binary Images on A Face-Centered Cubic Grid , 1999, Int. J. Pattern Recognit. Artif. Intell..

[4]  Kendall Preston,et al.  Three-dimensional skeletonization of elongated solids , 1983, Comput. Vis. Graph. Image Process..

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

[6]  Gilles Bertrand,et al.  A Boolean characterization of three-dimensional simple points , 1996, Pattern Recognition Letters.