(Enter summary)
Abstract: Many applications in computer graphics require complex, highly
detailed models. However, the level of detail actually necessary
may vary considerably. To control processing time, it is often desirable
to use approximations in place of excessively detailed models.
We have developed a surface simplification algorithm which can
rapidly produce high quality approximations of polygonal models.
The algorithm uses iterative contractions of vertex pairs to simplify
models and maintains surface error... (Update)
Cited by: More
Discrete Dierential-Geometry Operators - For Triangulated Manifolds
(Correct)
Globally Smooth Parameterizations with Low Distortion - Andrei Khodakovsky Caltech
(Correct)
Data Hiding on 3D Polygonal Meshes - Maret Swiss Federal (2004)
(Correct)
Active bibliography (related documents): More All
0.4: Survey of Polygonal Surface Simplification Algorithms - Heckbert, Garland (1997)
(Correct)
0.3: Geometric Compression Through Topological Surgery - Taubin, Rossignac (1996)
(Correct)
0.1: Multiresolution Modeling: Survey & Future Opportunities - Garland (1999)
(Correct)
Similar documents based on text: More All
0.4: Optimal Triangulation And Quadric-Based Surface Simplification - Heckbert, Garland (1999)
(Correct)
0.3: Progressive Meshes with Controlled Topology Modifications - Borodin, Klein (2002)
(Correct)
0.3: Permission Grids: Practical, Error-Bounded Simplification - Zelinka, Garland
(Correct)
Related documents from co-citation: More All
44: Progressive meshes
- Hoppe - 1996
37: Decimation of Triangle Meshes
- Schroeder, Zarge et al. - 1992
32: Full-range approximation of triangulated polyhedra (context) - Ronfard, Rossignac - 1996
BibTeX entry: (Update)
Garland, M., and Heckbert, P. Surface simplification using quadric error metrics. Computer Graphics (SIGGRAPH '97 Proceedings) (1997). http://citeseer.ist.psu.edu/garland97surface.html More
@article{ garland97surface,
author = "Michael Garland and Paul S. Heckbert",
title = "Surface Simplification Using Quadric Error Metrics",
journal = "Computer Graphics",
volume = "31",
number = "{Annual Conference Series}",
pages = "209--216",
year = "1997",
url = "citeseer.ist.psu.edu/garland97surface.html" }
Citations (may not include all citations):
351
Decimation of triangle meshes
- Schroeder, Zarge et al. - 1992 ACM DBLP
127
View-dependent simplification of arbitrary polygonal environ..
- Luebke, Erikson - 1997 ACM DBLP
99
Full-range approximation of triangulated polyhedra (context) - Ronfard, Rossignac - 1996 DBLP
72
Progressive meshes
- Hoppe - 1996 ACM DBLP
51
and Werner Stuetzle (context) - Hoppe, DeRose et al. - 1993
48
Superfacepolygonal mesh simplification with bounded error (context) - Kalvin, Superfaces et al. - 1996
25
and William Wright (context) - Cohen, Varshney et al. - 1996
22
Multiresolution surface modeling based on hierarchical trian.. (context) - Soucy, Laurendeau - 1996 ACM
20
approximations for rendering complex scenes (context) - Rossignac, Borrel - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ri.cmu.edu/people/heckbert_paul_text.html): More
Using Particles to Sample and Control Implicit Surfaces - Witkin, Heckbert (1994)
(Correct)
Multiresolution Modeling for Fast Rendering - Heckbert (1994)
(Correct)
An Empirical Comparison of Radiosity Algorithms - Willmott, al. (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC