By Topic

Connectivity compression for three-dimensional planar 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
$33 $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

2 Author(s)
K. Kubola ; Center for Adv. Comput. Studies, The Univ. of Louisiana at Lafayette, LA, USA ; H. Chu

We describe a new algorithm for coding the connectivity information of three-dimensional planar triangle meshes. Vertices of a mesh are placed on a two-dimensional grid. The connectivity pattern of the grid is implicit and hence the only information that needs to be encoded is the diagonal links. We present experimental results that show that the new method has a low connectivity cost of 2.1 bits per vertex on average.

Published in:

Ninth International Conference on Information Visualisation (IV'05)

Date of Conference:

6-8 July 2005