By Topic

Polygonal mesh simplification with face color and boundary edge preservation using quadric error metric

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

3 Author(s)
Chin-Shyurng Fahn ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan ; Hung-Kuang Chen ; Yi-Haur Shiau

In applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and construct a multiresolution representation. We propose a new and simple constraint scheme based on the quadric error metric proposed by Garland and Heckbert (1997, 1998) to preserve face colors and boundary edges during the simplification process. In addition, our method generates progressive meshes that store the polygonal mesh in a continuous multi-resolution representation. According to our experimental results, this new method is successful in preserving face colors and boundary edges. Moreover, we compare the latency of resolution changes for progressive meshes of various models.

Published in:

Multimedia Software Engineering, 2002. Proceedings. Fourth International Symposium on

Date of Conference: