557 search results - page 36 / 112 » On the set multi-cover problem in geometric settings |
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
We address the problem of estimating the three-dimensional shape and radiance of a surface in space from images obtained with different focal settings. We pose the problem as an in...
SSIAI
2002
IEEE
14 years 1 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
CCCG
2008
13 years 10 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
JCT
2006
13 years 9 months ago
2006
In [8] we posed a series of extremal (set system) problems under dimension constraints. In the present paper we study one of them: the intersection problem. The geometrical formul...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...