By Topic

A New Mesh Growing Surface Reconstruction Algorithm

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)
Luo Sheng ; Sch. of Mech. & Electr. Eng., Wenzhou Univ., Wenzhou ; Lin Li-qu ; Chen Xiao-main

This paper describes a multi-seeds mesh growing and flat portions first growing algorithm that takes as input an unorganized set of points on an unknown manifold, and produces as output an approximate surface. A priority driven strategy for mesh growing is then used to sweep the advance front ahead in an effective way. The method makes no assumption regarding the points, and the main contributions of the approach are multi-seeds mesh growing and a priority driven based method which forces the mesh growing process to propagate in an efficient way, and a new triangulation method. To demonstrate its efficiency, several 3-D surface reconstruction experiments are presented at the last part.

Published in:

Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on  (Volume:3 )

Date of Conference:

7-8 March 2009