Multiresolution Isosurface Extraction with Adaptive Skeleton Climbing
No Thumbnail Available
Date
1998
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Publishers Ltd and the Eurographics Association
Abstract
An isosurface extraction algorithm which can directly generate multiresolution isosurfaces from volume data is introduced. It generates low resolution isosurfaces, with 4 to 25 times fewer triangles than that generated by marching cubes algorithm, in comparable running times. By climbing from vertices (0-skeleton) to edges (1-skeleton) to faces (2-skeleton), the algorithm constructs boxes which adapt to the geometry of the true isosurface. Unlike previous adaptive marching cubes algorithms, the algorithm does not suffer from the gap-filling problem. Although the triangles in the meshes may not be optimally reduced, it is much faster than postprocessing triangle reduction algorithms. Hence the coarse meshes it produces can be used as the initial starts for the mesh optimization, if mesh optimality is the main concern.
Description
@article{10.1111:1467-8659.00261,
journal = {Computer Graphics Forum},
title = {{Multiresolution Isosurface Extraction with Adaptive Skeleton Climbing}},
author = {Poston, Tim and Wong, Tien-Tsin and Heng, Pheng-Ann},
year = {1998},
publisher = {Blackwell Publishers Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.00261}
}