An Efficient Visual Hull Computation Algorithm
Name
MIT-LCS-TM-623.pdf
Size
222.05 KB
Format
Adobe PDF
Checksum (MD5)
66bdb3a04a7497b1c0e836408c7650f3
Author(s)
Matusik, Wojciech
Buehler, Chris
McMillan, Leonard
Gortler, Steven J.
Date Issued
February 2002
Series/Report no.
MIT-LCS-TM-623
Abstract
In this paper we describe an efficient algorithm for computing the visual hull of an object. This problem is equivalent to computing the intersection of generalized cones. The naïve visual hull computation algorithm requires intersecting 3D polyhedra. We exploit the special structure of generalized cone polyhedra and show how to reduce this computation to a set of intersections in 2D. Moreover, we describe how the 2D intersections can be carried out efficiently.
Persistent DSpace Link
