Mesh Simplification
| dc.contributor.author | Algorri, Maria-Elena | en_US |
| dc.contributor.author | Schmitt, Francis | en_US |
| dc.date.accessioned | 2014-10-21T07:43:45Z | |
| dc.date.available | 2014-10-21T07:43:45Z | |
| dc.date.issued | 1996 | en_US |
| dc.description.abstract | Mesh 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.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 15 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.1530077 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 77-86 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/1467-8659.1530077 | en_US |
| dc.publisher | Blackwell Science Ltd and the Eurographics Association | en_US |
| dc.title | Mesh Simplification | en_US |