"Skeleton climbing": fast isosurfaces with fewer triangles

Authors:
T. Poston;H. T. Nguyen;Pheng-Ann Heng;Tien-Tsin Wong
Affiliations:
-;-;-;-
Venue:
PG '97 Proceedings of the 5th Pacific Conference on Computer Graphics and Applications
Year:
1997

Citing 0
Cited 5

View dependent isosurface extraction

Proceedings of the conference on Visualization '98
Isosurface extraction techniques for Web-based volume visualization

VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
A Parallelized Surface Extraction Algorithm for Large Binary Image Data Sets Based on an Adaptive 3-D Delaunay Subdivision Strategy

IEEE Transactions on Visualization and Computer Graphics
A new virtual reality approach for planning of cardiac interventions

Artificial Intelligence in Medicine
Special Section on CAD/Graphics 2013: Efficient boundary surface reconstruction from heterogeneous volumetric data via tri-prism decomposition

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Skeleton climbing is an algorithm that builds triangulated isosurfaces in 3D grid data, more economically than marching cubes, and without the time penalty of current mesh decimation algorithms. Building the surface from its intersections with grid edges (1-skeleton), then faces (2-skeleton), then cubes (3-skeleton), treats the data in a uniform way; this allows a 25% reduction in the number of triangles produced, while still creating a true separating surface at similar speed.