203 search results - page 9 / 41 » Incremental computation of planar maps |
128
click to vote
CVPR
2011
IEEE
14 years 3 months ago
2011
IEEE
Recovering 3D geometry from a single view of an object is an important and challenging problem in computer vision. Previous methods mainly focus on one specific class of objects ...
RT
2001
Springer
15 years 4 months ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
110
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
CVPR
1999
IEEE
16 years 1 months ago
1999
IEEE
We consider the problem of wrapping around an object, of which two views are available, a reference surface and recovering the resulting parametric flow using direct computations ...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...