By Topic

High Quality Visual Hull Reconstruction by Delaunay Refinement

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

2 Author(s)
Liu Xin ; Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB, Canada ; Marina Gavrilova

In this paper, we employ Delaunay triangulation techniques to reconstruct high quality visual hulls. From a set of calibrated images, the algorithm first computes a sparse set of initial points with a dandelion model and builds a Delaunay triangulation restricted to the visual hull surface. It then iteratively refines the triangulation by inserting new sampling points, which are the intersections between the visual hull surface and the Voronoi edges dual to the triangulation's facets, until certain criteria are satisfied. The intersections are computed by cutting line segments with the visual hull, which is then converted to the problem of intersecting a line segment with polygonal contours in 2D. A barrel-grid structure is developed to quickly pick out possibly intersecting contour segments and thus accelerate the process of intersecting in 2D. Our algorithm is robust, fast, fully adaptive, and it produces precise and smooth mesh models composed of well-shaped tri-angles.

Published in:

Voronoi Diagrams, 2009. ISVD '09. Sixth International Symposium on

Date of Conference:

23-26 June 2009