In this paper, we describe an efficient image-based approach to computing and shading
visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry …

… any viewpoint lying outside the convex hull. After a general discussion of the visual hull and
its properties, algorithms for computing the internal and external visual hulls of 2-D objects …

… the visual hull of a solid … visual cone intersection algorithms produce generic volumetric or
polygonal representations of their output, whereas we argue in this article that the visual hull is …

Background The concept of visual hull is based on two intuitions: Firstly, the shape of a three-dimensional
object is bounded by the silhouette of its projection in an image. Secondly, if …

… in the form of a visual hull, photoconsistency constraints are enforced in three … the visual
hull are first identified through dynamic programming; (2) with the rims now fixed, the visual hull …

… visual hulls in real-time. Unlike voxel or sampled approaches, we compute an exact
polyhedral representation for the visual hull … We render these visual hulls with a view-dependent …

… in the form of a visual hull, photoconsistency constraints are enforced in three … the visual
hull are first identified through dynamic programming; (2) with the rims now fixed, the visual hull …

… The method that we propose follows recent work [2] which separates the visual hull
computation into two steps. A first step computes viewing edges of the visual hull and a second …

… visual hull construction (as intersection of visual cones) In the following section we review
related previous work on visual hulls … for probabilistic image-based visual hulls. Next, we show …

… -depth analysis of the visual hull). Although visual hulls have been successfully employed in
… In this paper we present a novel algorithm for reconstruction and rendering of the visual hull …