By Topic

A memory effective two-phase approach for large scanned surface mesh simplification

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)
Yi-Ling Chen ; Dept. of Comput. Sci., Nat. Tsinghua Univ., Hsinchu ; Xiang Zhang

We present a novel two-phase multi-attribute algorithm suitable for large surface mesh simplification. By employing a linear combination of error metrics to control the process, the proposed algorithm incorporates geometric error control and preserves other attributes of the original model such as the texture (vertex color) and surface normal. In the first phase, we utilize the volume- surface tree [1] (VS-Tree) for vertex clustering to achieve memory effectiveness and computational efficiency. In the second phase, an iterative edge contraction process is applied to obtain the final simplified model. We experiment the proposed algorithm to large mesh models and the results are compared with those from other state of art algorithms such as the octree clustering simplification[5] (OCS) and the original quadric error metric (QEM) based simplification (Q-Slim) ([2][3]).

Published in:

Shape Modeling and Applications, 2008. SMI 2008. IEEE International Conference on

Date of Conference:

4-6 June 2008