Sciweavers

56 search results - page 3 / 12
» O-Convexity Computing Hulls Approximations and Orientation S...
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Carved Visual Hulls for Image-Based Modeling
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
Yasutaka Furukawa, Jean Ponce
DAM
2007
177views more  DAM 2007»
13 years 7 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 7 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
ICALP
2004
Springer
14 years 22 days ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
VRST
2010
ACM
13 years 5 months ago
Region-of-interest volumetric visual hull refinement
This paper introduces a region-of-interest visual hull refinement technique, based on flexible voxel grids for volumetric visual hull reconstructions. Region-of-interest refinemen...
Daniel Knoblauch, Falko Kuester