20 search results - page 2 / 4 » Detecting approximate symmetries of discrete point subsets |
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...