Years and Authors of Summarized Original Work2008; Castelli Aleardi, Devillers, Schaeffer2009; Gurung, Rossignac2012; Castelli Aleardi, Devillers, RossignacProblem DefinitionThe main problem consists in designing space-efficient data structures allowing to represent the connectivity of triangle meshes while supporting fast navigation and local updates.Mesh Structures: DefinitionTriangle meshes are among the most common representations of shapes. A triangle mesh is a collection of triangle faces that define a polyhedral approximation of a surface. A mesh is manifold if every edge is bounding either one or two triangles and if the faces incident to a same vertex define a closed or open fan. Here we focus on manifold meshes. Assuming that the genus and the number of boundary edges are negligible when compared to the number n of vertices, the number m of faces is roughly equal to 2n.Data Structures: ClassificationMesh data structures can be compared with respect to several criteria. A basi ...