• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Surface Simplification Using Quadric Error Metrics (1997)

Cached

  • Download as a PDF

Download Links

  • [www.ri.cmu.edu]
  • [www.cs.princeton.edu]
  • [www.cs.rutgers.edu]
  • [graphics.cs.uiuc.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu:80]
  • [www.cs.princeton.edu:80]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu:80]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.cmu.edu]
  • [graphics.cs.uiuc.edu]
  • [www.lb.cs.cmu.edu]
  • [www.cs.virginia.edu]
  • [www.cs.jhu.edu]
  • [www.cs.uncc.edu]
  • [inst.eecs.berkeley.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Michael Garland , Paul S. Heckbert
Citations:818 - 12 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Garland97surfacesimplification,
    author = {Michael Garland and Paul S. Heckbert},
    title = {Surface Simplification Using Quadric Error Metrics},
    year = {1997}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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 approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm is able to join unconnected regions of models. This can facilitate much better approximations, both visually and with respect to geometric error. In order to allow topological joining, our system also supports non-manifold surface models. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling---surface and object representations Keywords: surface simplificatio...

Citations

985 Progressive meshes - Hoppe - 1996
518 Decimation of Triangle Meshes - Schroeder, Zarge, et al.
319 Mesh optimization - Hoppe, DeRose, et al.
234 C.: View-dependent simplification of arbitrary polygonal environments - LUEBKE, ERIKSON
154 W.: Simplification envelopes - COHEN, VARSHNEY, et al. - 1996
41 Multiresolution surface modeling based on hierarchical triangulation - Soucy, Laurendeau - 1996
10 Superfaces:polygonal mesh simplification with bounded error - Kalvin, Taylor - 1996
3 simplification with variable tolerance - Surface - 1995
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University