This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Locally Toleranced Surface Simplification
April-June 1999 (vol. 5 no. 2)
pp. 168-189

Abstract—We present a technique for simplifying a triangulated surface. Simplifying consists of approximating the surface with another surface of lower triangle count. Our algorithm can preserve the volume of a solid to within machine accuracy; it favors the creation of near-equilateral triangles. We develop novel methods for reporting and representing a bound to the approximation error between a simplified surface and the original, and respecting a variable tolerance across the surface. A different positive error value is reported at each vertex. By linearly blending the error values in between vertices, we define a volume of space, called the error volume, as the union of balls of linearly varying radii. The error volume is built dynamically as the simplification progresses, on top of preexisting error volumes that it contains. We also build a tolerance volume to forbid simplification errors exceeding a local tolerance. The information necessary to compute error values is local to the star of a vertex; accordingly, the complexity of the algorithm is either linear or in $O(n \log n)$ in the original number of surface edges, depending on the variant. We extend the mechanisms of error and tolerance volumes to preserve during simplification scalar and vector attributes associated with surface vertices. Assuming a linear variation across triangles, error and tolerance volumes are defined in the same fashion as for positional error. For normals, a corrective term is applied to the error measured at the vertices to compensate for nonlinearities.

[1] J. O'Rourke, Computational Geometry in C. Cambridge Univ. Press, 1993.
[2] W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, “Decimation of Triangle Meshes,” Proc. SIGGRAPH '92, pp. 65-70, 1992.
[3] W. Schroeder, K. Martin, and W. Lorensen, The Visualization Toolkit. Prentice Hall, 1996.
[4] A. Guéziec, “Surface Simplification with Variable Tolerance,” Proc. Second Ann. Int'l Symp. Medical Robotics and Computer Assisted Surgery, pp. 132-139, Baltimore, Md., Nov. 1995.
[5] A. Kalvin and R. Taylor, Superfaces: Polygonal Mesh Simplification with Bounded Error IEEE Computer Graphics and Applications, vol. 16, pp. 64-77, May 1996.
[6] C. Bajaj and D. Schikore, “Error-Bounded Reduction of Triangle Meshes with Multivariate Data,” Visual Data Exploration and Analysis III, G.G. Grinstein and R.F. Erbacher, eds., vol. 2,656 pp. 34-45, Mar. 1996.
[7] J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F.P. Brooks Jr., and W.V. Wright, "Simplification Envelopes," Computer Graphics Proc. Ann. Conf. Series (Proc. Siggraph '96), pp. 119-128, 1996.
[8] M. Garland and P. Heckbert, “Simplifying Surfaces with Color and Texture Using Quadric Error Metrics,” Proc. Visualization 98, pp. 263-269, Oct. 1998.
[9] J. Cohen, M. Olano, and D. Manocha, “Appearance-Preserving Simplification,” Proc. Siggraph, pp. 115-122, July 1998.
[10] R. Ronfard and J. Rossignac, “Full-Range Approximation of Triangulated Polyhedra,” Computer Graphics Forum, vol. 15, no. 3, pp. C67-C76, 1996.
[11] R. Crawfis and W. Schroeder, “Advanced Techniques for Scientific Visualization, Polygon Reduction Techniques,” Course Notes, ACM Siggraph 95, Aug. 1995.
[12] J. Rossignac and P. Borrel, “Multi-Resolution 3D Approximations for Rendering,” Modeling in Computer Graphics, B. Falcidieno and T. Kunii, eds., pp. 455-465. Springer-Verlag, 1993.
[13] M. Garland and P.S. Heckbert, "Surface Simplification Using Quadric Error Metrics," Proc. Siggraph 97, ACM Press, New York, 1997, pp. 209-216.
[14] J. Clark, "Hierarchical Geometric Models for Visible Surface Algorithms," Comm. ACM, vol. 19, no. 10, pp. 547-554, 1976.
[15] 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.
[16] M. DeHaemer and M. Zida, “Simplification of Objects Rendered by Polygonal Approximations,” Computer&Graphics, vol. 15, no. 2, pp. 175-184, 1991.
[17] G. Turk, "Retiling Polygonal Surfaces," Computer Graphics(Proc. Siggraph 92), vol. 26, no. 2, 1992, pp. 55-64.
[18] A. Gourdon, “Simplification of Irregular Surface Meshes in 3D Medical Images,” Computer Vision, Virtual Reality, and Robotics in Medicine, pp. 413-419, Apr. 1995.
[19] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Mesh Optimization,” Proc. SIGGRAPH '93, pp. 19-26, 1993.
[20] P. Hinker and C. Hansen, Geometric Optimization Proc. Visualization '93, pp. 189-195, 1993.
[21] B. Hamann, "A Data Reduction Scheme for Triangulated Surfaces," Computer Aided Geometric Design, vol. 11, no. 2, pp. 197-214 1994.
[22] T.S. Gieng, B. Hamann, K.I. Joy, G.L. Schussman, and I.J. Trotts, Constructing Hierarchies for Triangle Meshes IEEE Trans. Visualization and Computer Graphics, vol. 4, no. 2, pp. 145-161, Apr.-June 1998.
[23] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[24] A. Varshney, "Hierarchical Geometric Approximations," PhD thesis TR-050-1994, Dept. of Computer Science, Univ. of North Carolina, Chapel Hill, 1994.
[25] C.E. Dowling, C. Hockemeyer, and A.H. Ludwig, “Adaptive Assessment and Training Using the Neighbourhood of Knowledge States,” Intelligent Tutoring Systems, C. Frasson, G. Gauthier, and A. Lesgold, eds., pp. 578–586, 1996.
[26] K.L. Clarkson, "Algorithms for Polytope Covering and Approximation," Proc. Third Workshop Algorithms Data Structure, Lecture Notes in Computer Science, 1993.
[27] P. Agarwal and S. Suri, “Surface Approximation and Geometric Partitions,” Proc. Fifth Symp. Discrete Algorithms, pp. 24-33, Jan. 1994.
[28] M. Ech, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, and W. Stuetzle, "Multiresolution Analysis of Arbitrary Meshes," Computer Graphics Proc. Ann. Conf. Series (Proc. Siggraph '95), pp. 173-182, 1995.
[29] P. Schröder and W. Sweldens, "Spherical Wavelets: Efficiently Representing Functions on the Sphere," Proc. SIGGRAPH '95 Conf., pp. 161-172, 1995.
[30] M. Gross, O. Staadt, and R. Gatti, “Efficient Triangular Surface Approximations Using Wavelets and Quadtree Data Structures,” IEEE Trans. Visualization and Computer Graphics, vol. 2, no. 2, pp. 130-143, June 1996.
[31] A. Certain, J. Popovic, T. DeRose, T. Duchamp, D. Salesin, and W. Stuetzle, "Interactive Multiresolution Surface Viewing," Proc. SIGGRAPH '96 Conf., pp. 91-98, 1996.
[32] R. Klein, G. Liebich, and W. Straßer, "Mesh Reduction With Error Control," Proc. Visualization, 1996.
[33] T. He, L. Hong, A. Varshney, and S. Wang, "Controlled Topology Simplification," IEEE Trans. Visualization and Computer Graphics, vol. 2, no. 2, pp. 171-184, June 1996.
[34] H. Hoppe, “Progressive Meshes,” Proc. SIGGRAPH '96, pp. 99-108, 1996.
[35] M. Soucy, G. Godin, and M. Rioux, “A Texture-Mapping Approach for the Compression of Colored 3D Triangulations,” The Visual Computer, vol. 12, pp. 503-514, 1996.
[36] P. Veron and J. Leon, “Static Polyhedron Simplification Using Error Measurements,” Computer Aided Design, vol. 29, pp. 287-298, Apr. 1997.
[37] J. Cohen, M. Olano, and D. Manocha, Simplifying Polygonal Models Using Successive Mappings Proc. Visualization '97, pp. 395-402, Oct. 1997.
[38] P. Lindstrom et al., "Real-Time, Continuous Level of Detail Rendering of Height Fields," Proc. Siggraph 96, ACM Press, New York, 1996, pp. 109-118.
[39] D. Luebke, “Hierarchical Structures for Dynamic Polygonal Simplification,” Technical Report TR96-006, Univ. of North Carolina at Chapel Hill, Jan. 1996.
[40] J. Xia and A. Varshney, "Dynamic View-Dependent Simplification for Polygonal Models," Proc. IEEE Visualization 96, ACM Press, New York, 1996, pp. 327-334.
[41] L. De Floriani, B. Falcidieno, and C. Pienovi, “Delaunay-Based Representation of Surfaces Defined over Arbitrarily Shaped Domains,” Computer Vision, Graphics, and Image Processing, vol. 32, pp. 127-140, 1985.
[42] R. Fowler and J. Little, "Automatic Extraction of Irregular Network Digital Terrain Models," Computer Graphics, vol. 13, no. 2, pp. 199-207, Aug. 1979.
[43] C. Silva, J. Mitchell, and A. Kaufman, “Automatic Generation of Triangular Irregular Networks Using Greedy Cuts,” Proc. Visualization 95, pp. 201-208, Oct.-Nov. 1995.
[44] M. de Berg and K. Dobringt, “On Levels of Detail in Terrains,” Technical Report UU-CS-1995-12, Utrecht Univ., Apr. 1995.
[45] M. Garland and P. Heckbert, “Fast Polygonal Approximation of Terrains and Height Fields,” Technical Report CMU-CS-95-181, Carnegie Mellon Univ., Sept. 1995.
[46] C.M. Hoffmann, Geometric and Solid Modeling, Morgan Kaufmann, San Mateo, Calif., 1989.
[47] F. Aubert and D. Bechmann, “Deformations d'Objets a Volume Constant,” technical report, UniversitéLouis Pasteur, Strasbourg, 1995.
[48] A. Guéziec, “Locally Toleranced Surface Simplification,” technical report, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., Dec. 1997.
[49] G. Golub and C. Van Loan, Matrix Computations. The Johns Hopkins Univ. Press, 1993.
[50] J.R. Kent, W.E. Carlson, and R.E. Parent, “Shape Transformation for Polyhedral Objects,” Computer Graphics (Proc. SIGGRAPH 92), vol. 26, no. 2, pp. 47-54, July 1992.
[51] W. Seibold and G. Wyvill, “Two Many Triangles,” Proc. Siggraph '98 Conf. Abstracts and Applications, p. 242, July 1998.
[52] W. Schroeder, “A Topology Modifying Progressive Decimation Algorithm,” IEEE Visualization, pp. 205-212, 1997.
[53] J. El-Sana and A. Varshney, “Topology Simplification for Polygonal Virtual Environments,” IEEE Trans. Visualization and Computer Graphics, vol. 4, no. 2, pp. 133-144, Apr.-June 1997.

Index Terms:
Surface simplification, error volume, tolerance volume.
Citation:
André Guéziec, "Locally Toleranced Surface Simplification," IEEE Transactions on Visualization and Computer Graphics, vol. 5, no. 2, pp. 168-189, April-June 1999, doi:10.1109/2945.773810
Usage of this product signifies your acceptance of the Terms of Use.