Please use this identifier to cite or link to this item:
DC FieldValue
dc.title`Skeleton Climbing': Fast isosurfaces with fewer triangles
dc.contributor.authorPoston, Tim
dc.contributor.authorNguyen, H.T.
dc.contributor.authorHeng, Pheng-Ann
dc.contributor.authorWong, Tien-Tsin
dc.identifier.citationPoston, Tim,Nguyen, H.T.,Heng, Pheng-Ann,Wong, Tien-Tsin (1997). `Skeleton Climbing': Fast isosurfaces with fewer triangles. Proceedings of the Pacific Conference on Computer Graphics and Applications : 117-126. ScholarBank@NUS Repository.
dc.description.abstractSkeleton 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.
dc.typeConference Paper
dc.contributor.departmentINSTITUTE OF SYSTEMS SCIENCE
dc.description.sourcetitleProceedings of the Pacific Conference on Computer Graphics and Applications
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Aug 16, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.