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

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Tree-based Triangle Mesh Connectivity Encoding

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

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

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

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

http://pubman.mpdl.mpg.de/cone/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;

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

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2E74-B
Abstract
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.