• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Fast and Memory Efficient Polygonal Simplification (1998)

Cached

  • Download as a PDF

Download Links

  • [www.gvu.gatech.edu]
  • [www.cc.gatech.edu]
  • [www-static.cc.gatech.edu]
  • [kowon.dongseo.ac.kr]
  • [kowon.dongseo.ac.kr]
  • [kowon.dongseo.ac.kr]
  • [www.cc.gatech.edu]
  • [kowon.dongseo.ac.kr]
  • [www.cc.gatech.edu]
  • [www.cc.gatech.edu]
  • [www.gvu.gatech.edu]
  • [www.cc.gatech.edu]
  • [ftp.cc.gatech.edu]
  • [www.cc.gatech.edu]
  • [smartech.gatech.edu]
  • [smartech.gatech.edu]
  • [smartech.gatech.edu]
  • [www.cc.gatech.edu]
  • [smartech.gatech.edu]
  • [smartech.gatech.edu]
  • [kucg.korea.ac.kr]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Peter Lindstrom , Greg Turk
Citations:157 - 7 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Lindstrom98fastand,
    author = {Peter Lindstrom and Greg Turk},
    title = {Fast and Memory Efficient Polygonal Simplification},
    year = {1998}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification process. We demonstrate that excellent simplified models can be produced without the need to compare against information from the original geometry while performing local changes to the model. We use edge collapses to perform simplification, as do a number of other methods. We select the position of the new vertex so that the original volume of the model is maintained and we minimize the per-triangle change in volume of the tetrahedra swept out by those triangles that are moved. We also maintain surface area near boundaries and minimize the per-triangle area changes. Calculating the edge collapse priorities and the positions of the new vertices requires only the face connectivity and the the vertex locations in the intermediate model. This approach is memory efficient, allowing the simplification of very large polygonal models, and it is also fast. Moreover, simplified models created using this technique compare favorably to a number of other published simplification methods in terms of mean geometric error.

Keyphrases

memory efficient polygonal simplification    new vertex    face connectivity    original volume    high-quality simplified polygonal model    surface area    edge collapse    original model    per-triangle change    original geometry    simplification method    intermediate model    per-triangle area change    simplification process    conventional wisdom    mean geometric error    large polygonal model    local change    edge collapse priority    vertex location    technique compare   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2019 The Pennsylvania State University