Cart (Loading....) | Create Account
Close category search window
 

Optimized triangle mesh compression using prediction trees

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

2 Author(s)
Kronrod, B. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; Gotsman, C.

Recently, a wealth of algorithms for the efficient coding of 3D triangle meshes have been published. All these focus on achieving the most compact code for the connectivity data. The geometric data, i.e. the vertex coordinates, are then coded in an order induced by the connectivity code, which is probably not optimal. This is a pity, as the geometric portion of the data set dominates the code. We propose a way to optimize the geometry code without sacrificing too much in the connectivity code. In our approach, we achieve approximately two bits/triangle for the connectivity before entropy coding, which is not as good as other published algorithms but certainly not significantly worse. Our approach is based on the parallelogram prediction method for mesh geometry. This method is based on the observation that two adjacent triangles in a typical mesh tend to form a shape similar to a parallelogram. If an algorithm uses a parallelogram prediction method then it should build a traversal structure of triangles covering all vertices. The vertex coordinates are then predicted as the structure is traversed. The cost of this code is then the entropy of the distribution of the vertex prediction errors. Since this entropy is hard to manipulate, the accepted practice is to measure the code's effectiveness in the approximation sense, i.e. as the sum of the lengths of the vertex prediction error vectors. The full version of this paper is available at <http://www.cs.technion.ac.il/~gotsman/pubs/kronrod1.zip>

Published in:

Computer Graphics and Applications, 2000. Proceedings. The Eighth Pacific Conference on

Date of Conference:

2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.