By Topic

A fast surface reconstruction algorithm based on Delaunay

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)
Song Dahu ; Xi''an Res. Inst. of High-tech, Xi''an, China ; Li Zhongke

This paper presents a surface reconstruction algorithm from scattered point sets based on Delaunay. It begins with computing the Delaunay triangulation of the sampling point sets, extract the primary triangles from Delaunay tetrahedrons, and then select surface triangles by manifold extraction. Compared with the traditional approach based on Delaunay, the proposed algorithm requires only one-pass Delaunay computation and needs no Voronoi information, so it is more efficient. Experimental results show that this method is robust and effective on handling surfaces with complex topology, boundaries, and even non-uniform sample points.

Published in:

Computer Science and Information Processing (CSIP), 2012 International Conference on

Date of Conference:

24-26 Aug. 2012