Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies
Authors:
- Yi‐Jen ChiangYCYi‐Jen Chiang
- Xiang LuXLXiang Lu
- 1 September 2003
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 22 (3) , 493-504
Abstract
In this paper, we propose a novel technique for constructing multiple levels of a tetrahedral volume dataset whilepreserving the topologies of all isosurfaces embedded in the data. Our simplification technique has two majorphases. In the segmentation phase, we segment the volume data into topological‐equivalence regions, that is, thesub‐volumes within each of which all isosurfaces have the same topology. In the simplification phase, we simplifyeach topological‐equivalence region independently, one by one, by collapsing edges from the smallest to the largesterrors (within the user‐specified error tolerance, for a given error metrics), and ensure that we do not collapseedges that may cause an isosurface‐topology change. We also avoid creating a tetrahedral cell of negative volume(i.e., avoid the fold‐over problem). In this way, we guarantee to preserve all isosurface topologies in the entiresimplification process, with a controlled geometric error bound. Our method also involves several additionalnovel ideas, including using the Morse theory and the implicit fully augmented contour tree, identifying typesof edges that are not allowed to be collapsed, and developing efficient techniques to avoid many unnecessary orexpensive checkings, all in an integrated manner. The experiments show that all the resulting isosurfaces preservethe topologies, and have good accuracies in their geometric shapes. Moreover, we obtain nice data‐reductionrates, with competitively fast running times.Keywords
This publication has 12 references indexed in Scilit:
- TetFusion: an algorithm for rapid tetrahedral mesh simplification2003
- The contour spectrum2002
- Simplification of tetrahedral meshes with accurate error evaluation2002
- Topology preserving and controlled topology simplifying multiresolution isosurface extraction2002
- Simplification of tetrahedral meshes with error boundsIEEE Transactions on Visualization and Computer Graphics, 1999
- Simplification of tetrahedral meshes1998
- Trekking in the Alps Without Freezing or Getting TiredAlgorithmica, 1997
- Surface coding based on Morse theoryIEEE Computer Graphics and Applications, 1991
- Critical points and curvature for embedded polyhedraJournal of Differential Geometry, 1967
- Morse Theory. (AM-51)1963