Deutsch
 
Benutzerhandbuch Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Tree-based Triangle Mesh Connectivity Encoding

MPG-Autoren
/persons/resource/persons45303

Rössl,  Christian
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44685

Ivrissimtzis,  Ioannis
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45449

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

Cohen,  Albert
Max Planck Society;

Merrien,  Jean-Louis
Max Planck Society;

Schumaker,  Larry L.
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

Rössl, C., Ivrissimtzis, I., & Seidel, H.-P. (2003). Tree-based Triangle Mesh Connectivity Encoding. In Curve and Surface Fitting: Saint-Malo 2002 (pp. 345-354). Brentwood, USA: Nashboro Press.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-2E74-B
Zusammenfassung
We present a divide and conquer algorithm for triangle mesh connectivity encoding. As the algorithm traverses the mesh it constructs a weighted binary tree that holds all information required for reconstruction. This representation can be used for compression.We derive a new iterative single-pass decoding algorithm, and we show how to exploit the tree data structure for generating stripifications for efficient rendering that come with a guaranteed cost saving.