Please use this identifier to cite or link to this item:
|Title:||`Skeleton Climbing': Fast isosurfaces with fewer triangles||Authors:||Poston, Tim
|Issue Date:||1997||Citation:||Poston, 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.||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.||Source Title:||Proceedings of the Pacific Conference on Computer Graphics and Applications||URI:||http://scholarbank.nus.edu.sg/handle/10635/111224|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 16, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.