Mesh Simplification

dc.contributor.authorAlgorri, Maria-Elenaen_US
dc.contributor.authorSchmitt, Francisen_US
dc.date.accessioned2014-10-21T07:43:45Z
dc.date.available2014-10-21T07:43:45Z
dc.date.issued1996en_US
dc.description.abstractMesh simplification is an important stage after surface reconstruction since the models produced can contain a large number of polygons making them difficult to manipulate. In this paper we present a mesh simplification algorithm to reduce the number of vertices in a dense mesh of triangles. The algorithm is based on edge operations that are performed in the inside of independent clusters distributed over the entire mesh. The clusters are well-characterized regions that can successfully accept simplification operations. The simplification operations produce only local transformations on the mesh. This region-based, distributed approach permits to easily track and control the changes in the triangulation and avoids the appearance of particular cases that would require a special handling. The algorithm uses two user-specified parameters to guide the operations. These parameters allow various simplification strategies that are illustrated on several dense triangulations.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume15en_US
dc.identifier.doi10.1111/1467-8659.1530077en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages77-86en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1530077en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleMesh Simplificationen_US
Files