Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A Theory of Shape by Space Carving
International Journal of Computer Vision - Special issue on Genomic Signal Processing
The Visual Hull Concept for Silhouette-Based Image Understanding
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polyhedral Visual Hulls for Real-Time Rendering
Proceedings of the 12th Eurographics Workshop on Rendering Techniques
Geometric modeling for computer vision.
Geometric modeling for computer vision.
The GrImage Platform: A Mixed Reality Environment for Interactions
ICVS '06 Proceedings of the Fourth IEEE International Conference on Computer Vision Systems
Provably good sampling and meshing of surfaces
Graphical Models - Solid modeling theory and applications
Shape from silhouette outlines using an adaptive dandelion model
Computer Vision and Image Understanding
A generic software design for Delaunay refinement meshing
Computational Geometry: Theory and Applications
Shape from silhouettes based on a centripetal pentahedron model
Graphical Models
Efficient Polyhedral Modeling from Silhouettes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithm for computer control of a digital plotter
IBM Systems Journal
| Hi-index | 0.00 |
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 triangles.