By Topic

Optimized Edgebreaker encoding for large and regular triangle meshes

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

1 Author(s)
Szymczak, A. ; Georgia Tech, GVU Center, Atlanta, GA, USA

Summary form only given. The connectivity of a typical triangle mesh representing a 3D object for a graphics or geometric modeling application exhibits a lot of regularity. While a lot of aspects of triangle mesh regularity have not been formally described, the simplest regularity measure is the compactness of the distribution of vertex degrees. In a regular mesh, most of the vertices have degree 6 or close to 6. Algorithms that can effectively take advantage of mesh regularity to decrease the size of the connectivity code will perform better in most practical cases. The Edgebreaker algorithm converts a manifold triangle mesh into a string of symbols in {C,L,E,R,S} (called the CLERS string), each of them corresponding to a triangle of the encoded mesh. The CLERS string can be turned into a binary string using an entropy coding algorithm.

Published in:

Data Compression Conference, 2002. Proceedings. DCC 2002

Date of Conference:

2002