# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding

##### MPS-Authors

##### 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

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

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2EE3-F

##### 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.