By Topic

Connectivity Compression for Stripified Triangle Meshes Using Basic Strips

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)
Hao Huang ; Sun Yat-sen University, China ; Fan Zhou

This paper presents a new triangle meshes compression algorithm, which encodes connectivity information between vertex chains in the meshes that are already stripified. The algorithm builds up basic strips based on the vertex chains of the original strips at first. The information of redundant edges is implicit hence the only information need to encode is about absent edges. The proposed algorithm provides a new representation that is guaranteed to encode connectivity information of any meshes in less than 2 bits/T, and in 1.2 bits/T on average in the experiment results using FTSG. In the experiments, the method was proved to have good performance.

Published in:

Image and Graphics, 2007. ICIG 2007. Fourth International Conference on

Date of Conference:

22-24 Aug. 2007