Progressive tetrahedralizations
Oliver Staadt, Markus H. Groß · 1998
This paper describes some fundamental issues for robust implementations of progressively refined tetrahedralizations generated through sequences of edge collapses. We address the definition of appropriate cost functions and explain on various tests which are necessary to preserve the consistency of the mesh when collapsing edges. Although being considered a special case of progressive simplicial complexes [10], the results of our method are of high practical importance and can be used in many different applications, such as finite element meshing, scattered data interpolation, or rendering of unstructured volume data. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling -- surfaces and object representations. Keywords: mesh simplification, multiresolution, level-ofdetail, unstructured meshes, mesh generation. 1 INTRODUCTION Progressive meshes [7] and its generalizations to higher dimensions [10] proofed to be an extremely powerful notion for the effic...