Sciweavers

244 search results - page 6 / 49
» Generalized penetration depth computation
Sort
View
ICCV
1998
IEEE
15 years 1 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox
CCCG
2009
14 years 10 months ago
The Centervertex Theorem for Wedge Depth
There are many depth measures on point sets that yield centerpoint theorems. These theorems guarantee the existence of points of a specified depth, a kind of geometric median. How...
Gary L. Miller, Todd Phillips, Donald Sheehy
COMPGEOM
2000
ACM
15 years 1 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
PCM
2009
Springer
145views Multimedia» more  PCM 2009»
15 years 4 months ago
Non-linear Bi-directional Prediction for Depth Coding
A depth image represents a relative distance from a camera to an object in the three-dimensional (3-D) space and it is widely used as 3-D information in computer vision and compute...
Kwan-Jung Oh, Yo-Sung Ho
68
Voted
COMGEO
2010
ACM
14 years 7 months ago
Computing the visibility map of fat objects
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
Mark de Berg, Chris Gray