Surface Skeletons in Grids with Non-Cubic Voxels

Authors:
Robin Strand
Affiliations:
Uppsala University, Sweden
Venue:
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Year:
2004

Citing 0
Cited 3

Minimal non-deletable sets and minimal non-codeletable sets in binary images

Theoretical Computer Science
Automatic Grid Resolution and Efficient Triangulation of Implicit Vector Field

SIAM Journal on Imaging Sciences
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 will be "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 gridpoints, most of these branches are merged into surfaces. For comparison, the algorithm is also implemented for the cubic grid.