Superfaces: polygonal mesh simplification with bounded error
- 1 May 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 16 (3) , 64-77
- https://doi.org/10.1109/38.491187
Abstract
We describe Superfaces, a domain-independent method for simplifying polyhedral meshes. The Superfaces algorithm performs the simplification based on a bounded approximation criterion that produces a simplified mesh that approximates the original one to within a pre-specified tolerance. The vertices in the simplified mesh are a proper subset of the original vertices, so the algorithm is well-suited for creating hierarchical representations of polyhedra.We have used the algorithm to simplify isosurfaces derived form medical CT scans, molecular electron density volume data, and topographic data of the earth.Keywords
This publication has 13 references indexed in Scilit:
- Geometric optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Superfaces: polygonal mesh simplification with bounded errorIEEE Computer Graphics and Applications, 1996
- A data reduction scheme for triangulated surfacesComputer Aided Geometric Design, 1994
- Mesh optimizationPublished by Association for Computing Machinery (ACM) ,1993
- Multi-resolution 3D approximations for rendering complex scenesPublished by Springer Nature ,1993
- Re-tiling polygonal surfacesPublished by Association for Computing Machinery (ACM) ,1992
- Decimation of triangle meshesPublished by Association for Computing Machinery (ACM) ,1992
- Constructing topologically connected surfaces for the comprehensive analysis of 3-D medical structuresPublished by SPIE-Intl Soc Optical Eng ,1991
- Simplification of objects rendered by polygonal approximationsComputers & Graphics, 1991
- An adaptive subdivision method for surface-fitting from sampled dataPublished by Association for Computing Machinery (ACM) ,1986