
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
André Guéziec, "Locally Toleranced Surface Simplification," IEEE Transactions on Visualization and Computer Graphics, vol. 5, no. 2, pp. 168189, AprilJune, 1999.  
BibTex  x  
@article{ 10.1109/2945.773810, author = {André Guéziec}, title = {Locally Toleranced Surface Simplification}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {5}, number = {2}, issn = {10772626}, year = {1999}, pages = {168189}, doi = {http://doi.ieeecomputersociety.org/10.1109/2945.773810}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  Locally Toleranced Surface Simplification IS  2 SN  10772626 SP168 EP189 EPD  168189 A1  André Guéziec, PY  1999 KW  Surface simplification KW  error volume KW  tolerance volume. VL  5 JA  IEEE Transactions on Visualization and Computer Graphics ER   
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 nearequilateral 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
[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. 6570, 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. 132139, 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. 6477, May 1996.
[6] C. Bajaj and D. Schikore, “ErrorBounded 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. 3445, 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. 119128, 1996.
[8] M. Garland and P. Heckbert, “Simplifying Surfaces with Color and Texture Using Quadric Error Metrics,” Proc. Visualization 98, pp. 263269, Oct. 1998.
[9] J. Cohen, M. Olano, and D. Manocha, “AppearancePreserving Simplification,” Proc. Siggraph, pp. 115122, July 1998.
[10] R. Ronfard and J. Rossignac, “FullRange Approximation of Triangulated Polyhedra,” Computer Graphics Forum, vol. 15, no. 3, pp. C67C76, 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, “MultiResolution 3D Approximations for Rendering,” Modeling in Computer Graphics, B. Falcidieno and T. Kunii, eds., pp. 455465. SpringerVerlag, 1993.
[13] M. Garland and P.S. Heckbert, "Surface Simplification Using Quadric Error Metrics," Proc. Siggraph 97, ACM Press, New York, 1997, pp. 209216.
[14] J. Clark, "Hierarchical Geometric Models for Visible Surface Algorithms," Comm. ACM, vol. 19, no. 10, pp. 547554, 1976.
[15] F.J. Schmitt, B.A. Barsky, and W. Du, "An Adaptive Subdivision Method for SurfaceFitting From Sample Data," Computer Graphics (SIGGRAPH '86 Proc.), vol. 20, no. 4, pp. 179188, 1986.
[16] M. DeHaemer and M. Zida, “Simplification of Objects Rendered by Polygonal Approximations,” Computer&Graphics, vol. 15, no. 2, pp. 175184, 1991.
[17] G. Turk, "Retiling Polygonal Surfaces," Computer Graphics(Proc. Siggraph 92), vol. 26, no. 2, 1992, pp. 5564.
[18] A. Gourdon, “Simplification of Irregular Surface Meshes in 3D Medical Images,” Computer Vision, Virtual Reality, and Robotics in Medicine, pp. 413419, Apr. 1995.
[19] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Mesh Optimization,” Proc. SIGGRAPH '93, pp. 1926, 1993.
[20] P. Hinker and C. Hansen, Geometric Optimization Proc. Visualization '93, pp. 189195, 1993.
[21] B. Hamann, "A Data Reduction Scheme for Triangulated Surfaces," Computer Aided Geometric Design, vol. 11, no. 2, pp. 197214 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. 145161, Apr.June 1998.
[23] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[24] A. Varshney, "Hierarchical Geometric Approximations," PhD thesis TR0501994, 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. 2433, 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. 173182, 1995.
[29] P. Schröder and W. Sweldens, "Spherical Wavelets: Efficiently Representing Functions on the Sphere," Proc. SIGGRAPH '95 Conf., pp. 161172, 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. 130143, 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. 9198, 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. 171184, June 1996.
[34] H. Hoppe, “Progressive Meshes,” Proc. SIGGRAPH '96, pp. 99108, 1996.
[35] M. Soucy, G. Godin, and M. Rioux, “A TextureMapping Approach for the Compression of Colored 3D Triangulations,” The Visual Computer, vol. 12, pp. 503514, 1996.
[36] P. Veron and J. Leon, “Static Polyhedron Simplification Using Error Measurements,” Computer Aided Design, vol. 29, pp. 287298, Apr. 1997.
[37] J. Cohen, M. Olano, and D. Manocha, Simplifying Polygonal Models Using Successive Mappings Proc. Visualization '97, pp. 395402, Oct. 1997.
[38] P. Lindstrom et al., "RealTime, Continuous Level of Detail Rendering of Height Fields," Proc. Siggraph 96, ACM Press, New York, 1996, pp. 109118.
[39] D. Luebke, “Hierarchical Structures for Dynamic Polygonal Simplification,” Technical Report TR96006, Univ. of North Carolina at Chapel Hill, Jan. 1996.
[40] J. Xia and A. Varshney, "Dynamic ViewDependent Simplification for Polygonal Models," Proc. IEEE Visualization 96, ACM Press, New York, 1996, pp. 327334.
[41] L. De Floriani, B. Falcidieno, and C. Pienovi, “DelaunayBased Representation of Surfaces Defined over Arbitrarily Shaped Domains,” Computer Vision, Graphics, and Image Processing, vol. 32, pp. 127140, 1985.
[42] R. Fowler and J. Little, "Automatic Extraction of Irregular Network Digital Terrain Models," Computer Graphics, vol. 13, no. 2, pp. 199207, Aug. 1979.
[43] C. Silva, J. Mitchell, and A. Kaufman, “Automatic Generation of Triangular Irregular Networks Using Greedy Cuts,” Proc. Visualization 95, pp. 201208, Oct.Nov. 1995.
[44] M. de Berg and K. Dobringt, “On Levels of Detail in Terrains,” Technical Report UUCS199512, Utrecht Univ., Apr. 1995.
[45] M. Garland and P. Heckbert, “Fast Polygonal Approximation of Terrains and Height Fields,” Technical Report CMUCS95181, 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. 4754, 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. 205212, 1997.
[53] J. ElSana and A. Varshney, “Topology Simplification for Polygonal Virtual Environments,” IEEE Trans. Visualization and Computer Graphics, vol. 4, no. 2, pp. 133144, Apr.June 1997.