Topology-preserving simplification of 2D nonmanifold meshes with embedded structures

• Published in: The Visual computer Vol. 21; no. 8-10; pp. 679 - 688
• Main Authors: Vivodtzev, Fabien, Bonneau, Georges-Pierre, Le Texier, Paul
• Format: Journal Article
• Language: English
• Published: Heidelberg Springer Nature B.V 01.09.2005
• Subjects: Algorithms; CAD/CAM; Combinatorial analysis; Embedded structures; Error analysis; Finite element method; Mechanical engineering; Simplification; Topology; Validity
• ISSN: 0178-2789; 1432-8726; 1432-2315
• DOI: 10.1007/s00371-005-0334-y

Mesh simplification has received tremendous attention over the years. Most of the previous work in this area deals with a proper choice of error measures to guide the simplification. Preserving the topological characteristics of the mesh and possibly of data attached to the mesh is a more recent topic and the subject of this paper. We introduce a new topology-preserving simplification algorithm for triangular meshes, possibly nonmanifold, with embedded polylines. In this context, embedded means that the edges of the polylines are also edges of the mesh. The paper introduces a robust test to detect if the collapse of an edge in the mesh modifies either the topology of the mesh or the topology of the embedded polylines. This validity test is derived using combinatorial topology results. More precisely, we define a so-called extended complex from the input mesh and the embedded polylines. We show that if an edge collapse of the mesh preserves the topology of this extended complex, then it also preserves both the topology of the mesh and the embedded polylines. Our validity test can be used for any 2-complex mesh, including nonmanifold triangular meshes, and can be combined with any previously introduced error measure. Implementation of this validity test is described. We demonstrate the power and versatility of our method with scientific data sets from neuroscience, geology, and CAD/CAM models from mechanical engineering.