By Topic

“Skeleton climbing”: fast isosurfaces with fewer triangles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
T. Poston ; Nat. Univ. of Singapore, Singapore ; H. T. Nguyen ; Pheng-Ann Heng ; Tien-Tsin Wong

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

Published in:

Computer Graphics and Applications, 1997. Proceedings., The Fifth Pacific Conference on

Date of Conference:

13-16 Oct 1997