Issue No.03 - May (1996 vol.16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.491187
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.
mesh simplification, polyhedral approximation, data reduction
Alan D. Kalvin, "Superfaces: Polygonal Mesh Simplification with Bounded Error", IEEE Computer Graphics and Applications, vol.16, no. 3, pp. 64-77, May 1996, doi:10.1109/38.491187