English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  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

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2EE3-F Version Permalink: https://hdl.handle.net/21.11116/0000-000E-6E6E-D
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Ivrissimtzis, Ioannis1, Author           
Rössl, Christian1, Author           
Seidel, Hans-Peter1, Author                 
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              

Content

show
hide
Free keywords: -
 Abstract: 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

show
hide
Language(s): eng - English
 Dates: 2003-08-132002
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202206
Other: Local-ID: C125675300671F7B-76E86DD1D082CB7FC1256C550050294D-irs02a
DOI: 10.1109/PCCGA.2002.1167873
BibTex Citekey: Ivrissimtzis-et-al_PG02
 Degree: -

Event

show
hide
Title: 10th Pacific Conference on Computer Graphics and Applications
Place of Event: Beijing, China
Start-/End Date: 2002-10-09 - 2002-10-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
  Abbreviation : PG 2002
Source Genre: Proceedings
 Creator(s):
Coquillart, Sabine1, Editor
Shum, Heung-Yeung1, Editor
Hu, Shi-Min1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Los Alamitos, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 294 - 303 Identifier: ISBN: 0-7695-1784-6