By Topic

A divide and conquer algorithm for triangle mesh connectivity encoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ivrissimtzis, I. ; Max-Planck-Inst. fur Inf., Saarbrucken, Germany ; Rossl, C. ; Seidel, H.-P.

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

Published in:

Computer Graphics and Applications, 2002. Proceedings. 10th Pacific Conference on

Date of Conference: