Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid

Authors:
Robin Strand;Peer Stelldinger
Affiliations:
Uppsala University, Sweden;University of Hamburg, Germany
Venue:
ICIAP '07 Proceedings of the 14th International Conference on Image Analysis and Processing
Year:
2007

Citing 0
Cited 6

A Connection between Z n and Generalized Triangular Grids

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids

Discrete Applied Mathematics
Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids

IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Weighted neighbourhood sequences in non-standard three dimensional grids: metricity and algorithms

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Weighted neighborhood sequences in non-standard three-dimensional grids: parameter optimization

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Voronoi splines

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The well-known marching cubes algorithm is modified to apply to the face-centered cubic (fcc) grid. Thus, the local configurations that are considered when extracting the local surface patches are not cubic anymore. This paper presents three different partitionings of the fcc grid to be used for the local configurations. The three candidates are evaluated theoretically and experimentally and compared with the original marching cubes algorithm. It is proved that the reconstructed surface is topologically equivalent to the surface of the original object when the surface of the original object that is digitized is smooth and a sufficiently dense fcc grid is used.