"Skeleton climbing": fast isosurfaces with fewer triangles
Timothy Poston, H.T. Nguyen, Pheng‐Ann Heng, Tien‐Tsin Wong · 2002
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.