Decimation of triangle meshes
- 1 July 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 26 (2) , 65-70
- https://doi.org/10.1145/133994.134010
Abstract
This paper describes an application independent algorithmthat uses local operations on geometry and topologyto reduce the number of triangles in a triangle mesh.Although our implementation is for the triangle mesh, itcan be directly applied to the more general polygon mesh.After describing other work related to model creationfrom sampled data, we describe the triangle decimationprocess and its implementation. Results from two differentgeometric modeling applications illustrate the...Keywords
This publication has 11 references indexed in Scilit:
- Re-tiling polygonal surfacesACM SIGGRAPH Computer Graphics, 1992
- Geometrically deformed modelsACM SIGGRAPH Computer Graphics, 1991
- Simplification of objects rendered by polygonal approximationsComputers & Graphics, 1991
- Polygonization of implicit surfacesComputer Aided Geometric Design, 1988
- Two algorithms for the three‐dimensional reconstruction of tomogramsMedical Physics, 1988
- Marching cubes: A high resolution 3D surface construction algorithmACM SIGGRAPH Computer Graphics, 1987
- An adaptive subdivision method for surface-fitting from sampled dataACM SIGGRAPH Computer Graphics, 1986
- Optimum Uniform Piecewise Linear Approximation of Planar CurvesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Computational GeometryPublished by Springer Nature ,1985
- Automatic extraction of Irregular Network digital terrain modelsACM SIGGRAPH Computer Graphics, 1979