de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Linear Time Mesh Simplification with Reliable Error-Bounds

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45679

Vorsatz,  Jens
Computer Graphics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44715

Kähler,  Kolja
Computer Graphics, MPI for Informatics, Max Planck Society;

Kobbelt,  Leif
Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45449

Seidel,  Hans-Peter
Computer Graphics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Vorsatz, J., Kähler, K., Kobbelt, L., & Seidel, H.-P. (2000). Linear Time Mesh Simplification with Reliable Error-Bounds. In B. Girod, G. Greiner, H. Niemann, & H.-P. Seidel (Eds.), Proceedings of Vision, Modeling, and Visualization (VMV-00) (pp. 145-152). Berlin, Germany: Akademische Verlagsgesellschaft Aka.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-34D2-B
Abstract
This paper proposes an incremental mesh reduction scheme that provides fine grained control over the approximation error while being linear in time in the number of vertices. We use the well--known half--edge collapse as our atomic decimation operation but we differ from previously reported methods in that we use a sequence of oriented bounding-boxes to track the decimation error instead of retaining the complete vertex information of the original model. This reduces storage costs and computation time while still providing a reliable upper bound for the deviation from the original data. We also propose different error accumulation strategies which makes the algorithm adaptable to different application scenarios.