This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Superfaces: Polygonal Mesh Simplification with Bounded Error
May 1996 (vol. 16 no. 3)
pp. 64-77
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.

1. F.J. Schmitt, B.A. Barsky, and W. Du, "An Adaptive Subdivision Method for Surface-Fitting From Sample Data," Computer Graphics (SIGGRAPH '86 Proc.), vol. 20, no. 4, pp. 179-188, 1986.
2. M.J. DeHaemer, Jr. and M.J. Zyda, "Simplification of Objects Rendered by Polygonal Approximations," Computer Graphics, Vol. 15, No. 2, 1991, pp. 175-184.
3. A.D. Kalvin et al., "Constructing Topologically Connected Surfaces for the Comprehensive Analysis of 3D Medical Structures," in Medical Imaging V: Image Processing, SPIE Proc. Conf. 1445, SPIE, Bellingham, Wash., 1991, pp. 247-258.
4. W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, “Decimation of Triangle Meshes,” Proc. SIGGRAPH '92, pp. 65-70, 1992.
5. B. Hamann, "A Data Reduction Scheme for Triangulated Surfaces," Computer Aided Geometric Design, vol. 11, no. 2, pp. 197-214 1994.
6. G. Turk, "Retiling Polygonal Surfaces," Computer Graphics(Proc. Siggraph 92), vol. 26, no. 2, 1992, pp. 55-64.
7. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Mesh Optimization,” Proc. SIGGRAPH '93, pp. 19-26, 1993.
8. A. Guéziec and D. Dean, "The Wrapper Algorithm: A Surface Optimization Algorithm That Preserves Highly Curved Areas," in Visualization in Biomedical Computing 94, SPIE, Bellingham, Wash., 1994, pp. 631-642.
9. J. Rossignac and P. Borrel, "Multi-resolution 3D Approximations for Rendering Complex Scenes," in Modeling in Computer Graphics, B.Falcidieno and T. L. Kunii, eds., Springer-Verlag, Berlin, 1993, pp. 455-465.
10. P. Hinker and C. Hansen, Geometric Optimization Proc. Visualization '93, pp. 189-195, 1993.
11. A. D. Kalvin and R. H. Taylor, "Superfaces: Polyhedron Approximation with Bounded Error," Research Report RC 19135, I.B.M. Thomas J. Watson Research Center, Yorktown Heights, New York, Apr. 1993.
12. W.E. Lorensen and H.E. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics (SIGGRAPH '87 Proc.), vol. 21, pp. 163-169, 1987.
13. J. O'Rourke, Art Gallery Theorems and Algorithms. New York: Oxford Univ. Press, 1987.
14. W.E. Lorensen, "Marching Through the Visible Man," on the World Wide Web at http://www.ge.com/crd/ivl/vm/vm.html.

Index Terms:
mesh simplification, polyhedral approximation, data reduction
Citation:
Alan D. Kalvin, Russell H. Taylor, "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
Usage of this product signifies your acceptance of the Terms of Use.