By Topic

Mesh Simplification Algorithm Based on Quadrangle Collapse

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

3 Author(s)
Hua-hong Chen ; Zhongshan Univ., Guangzhou ; Xiao-Nan Luo ; Ruotian Ling

Many applications of Virtual Reality require 3D models. In this paper, quadrangles in the triangle mesh are defined. We put forward a quadrangle collapse based mesh simplification algorithm which can rapidly produce high approximations of 3D models. The algorithm uses iterative collapse of quadrangle to simple models and maintains surface error approximations using quadric matrices. Three vertices and six faces are collapsed in one iteration, thereby the algorithm can rapidly generate high-quality approximations of polygonal models with minimal times of collapses than Garland's and Pan's algorithms. The experiment results demonstrate the efficiency of the new algorithm.

Published in:

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

Date of Conference:

22-24 Aug. 2007