Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

The Edge Collapse Algorithm Based on the Batched Iteration in 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

5 Author(s)
Guanlong Li ; State Key Lab. of Switching & Networking Technol., Beijing Univ. of Posts & Telecommun., Beijing, China ; Wendong Wang ; Guohong Ding ; Yanming Zou
more authors

The mesh simplification technology plays an important role in computer graphics, reverse engineering, cultural relic protection and other fields which involve 3D modelling and dynamic demonstration. The geometric elements decimation algorithm, as one of triangle mesh simplification algorithms, has many advantages over the other simplified algorithms. The study in this paper puts forward an optimized solution based on QEM (Quadric Error Metric) which is a representative edge collapse algorithm. The optimized algorithm improves efficiency of mesh simplification and provides better pictures quality comparing with QEM algorithm in the project practice.

Published in:

Computer and Information Science (ICIS), 2012 IEEE/ACIS 11th International Conference on

Date of Conference:

May 30 2012-June 1 2012