Superfaces: Polygonal mesh simplification with bounded error

IEEE Computer Graphics and Applications

Volumn 16, Issue 3, 1996, Pages 64-77

  Kalvin, Alan D ^a,c,d,e,f   Taylor, Russell H ^a,b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c UNIVERSITY OF THE WITWATERSRAND   (South Africa)

^d UNIVERSITY OF CAPE TOWN   (South Africa)

^e NEW YORK UNIVERSITY   (United States)

^f Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER HARDWARE; ERROR ANALYSIS; OPTIMIZATION; RAPID PROTOTYPING; REAL TIME SYSTEMS; TOPOLOGY; VISUALIZATION;

BOUNDED ERROR; MESH SIMPLIFICATION; POLYGONAL MESH; POLYHEDRAL MESHES; SUPERFACES; TRIANGULAR MESHES; TWO DIMENSIONAL RENDERING;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0030150058     PISSN: 02721716     EISSN: None     Source Type: Journal    
DOI: 10.1109/38.491187     Document Type: Article

References (14)

1. F.J.M. Schmitt, B. Barsky, and W.-H. Du, "An Adaptive Subdivision Method for Surface-Fitting from Sampled Data," Computer Graphics (Proc. Siggraph), Vol. 20, No. 4, 1986, pp. 179-188.
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," Computer Graphics (Proc. Siggraph), Vol. 26, No. 2, July 1992, pp. 65-70.
5. B. Hamann, "A Data Reduction Scheme for Triangulated Surfaces," Computer Aided Geometric Design, Vol. 11, No. 2, Apr. 1994, pp. 197-214.
6. G. Turk, "Re-tiling of Polygonal Surfaces," Computer Graphics (Proc. Siggraph), Vol. 26, No. 2, July 1992, pp. 55-64.
7. H. Hoppe et al., "Mesh Optimization," Computer Graphics (Proc. Siggraph), Vol. 17, No. 3, Aug. 1983, pp. 19-25.
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, IEEE Computer Society Press, Los Alamitos, Calif., 1993, pp. 189-195.
11. A. D. Kalvin and R. H. Taylor, "Superfaces: Polyhedron Approximation with Bounded Error," Research Report RC 19135, 1.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 (Proc. Sigggraph), Vol. 21, No. 3, July 1987, pp. 311-317.
13. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 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.