Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding

Ivrissimtzis, I., Rössl, C., & Seidel, H.-P. (2002). A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding. In S. Coquillart, H.-Y. Shum, & S.-M. Hu (Eds.), Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (pp. 294-303). Los Alamitos, USA: IEEE.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2EE3-F Versions-Permalink: https://hdl.handle.net/21.11116/0000-000E-6E6E-D
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Ivrissimtzis, Ioannis1, Autor           
Rössl, Christian1, Autor           
Seidel, Hans-Peter1, Autor                 
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We propose a divide and conquer algorithm for the single resolution encoding of
triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag
strip which divides the mesh into two submeshes which are encoded separately in
a recursive process. We introduce a novel data structure for triangle mesh
encoding, a binary tree with positive integer weights assigned to its nodes.
The length of the initial strip is stored in the root of the binary tree, while
the encoding of the left and right submesh are stored in the left and right
subtree, respectively. We find a simple criterion determining which objects of
this data
structure correspond to triangle meshes. As the algorithm implicitly traverses
the triangles of the mesh, it can be classified into the family of Edgebreaker
like encoding schemes. Hence, the compression ratios, both in the form of
theoretical upper bounds and practical results are similar to the
Edgebreaker's, while the simplicity and flexibility of the algorithm makes it
particularly suitable for applications where the connectivity encoding is only
a small part of the problem at hand.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2003-08-132002
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 202206
Anderer: Local-ID: C125675300671F7B-76E86DD1D082CB7FC1256C550050294D-irs02a
DOI: 10.1109/PCCGA.2002.1167873
BibTex Citekey: Ivrissimtzis-et-al_PG02
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 10th Pacific Conference on Computer Graphics and Applications
Veranstaltungsort: Beijing, China
Start-/Enddatum: 2002-10-09 - 2002-10-11

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
  Kurztitel : PG 2002
Genre der Quelle: Konferenzband
 Urheber:
Coquillart, Sabine1, Herausgeber
Shum, Heung-Yeung1, Herausgeber
Hu, Shi-Min1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: Los Alamitos, USA : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 294 - 303 Identifikator: ISBN: 0-7695-1784-6