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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

ABSTRACT

Cached

  • Download as a PDF

Download Links

  • [wscg.zcu.cz]
  • [wscg.zcu.cz]
  • [arxiv.org]
  • [arxiv.org]
  • [arxiv.org]
  • [arxiv.org]
  • [arxiv.org]
  • [arxiv.org]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by John Cox , Beaconside Stafford , Claude C. Chibelushi , Beaconside Stafford
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Cox_abstract,
    author = {John Cox and Beaconside Stafford and Claude C. Chibelushi and Beaconside Stafford},
    title = {ABSTRACT},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

This paper presents a new error bound simplification algorithm for complex geometric models. A lower polygon count approximation of the input model is generated by performing edge collapse operations. The collapse vertex is constrained to lie within a localised tolerance volume built around the edge collapse neighbourhood. This constraint ensures that all points on the simplified surface are within a user specified distance from the surface after the previous edge collapse.

Keyphrases

collapse vertex    new error bound simplification algorithm    simplified surface    edge collapse operation    complex geometric model    edge collapse neighbourhood    polygon count approximation    input model    localised tolerance volume    previous edge collapse   

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