de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Linear Time Mesh Simplification with Reliable Error-Bounds

MPG-Autoren
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;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-34D2-B
Zusammenfassung
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.