7 search results - page 1 / 2 » Maximizing the overlap of two planar convex sets under rigid... |
COMPGEOM
2005
ACM
13 years 6 months ago
2005
ACM
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
ECCV
2002
Springer
14 years 6 months ago
2002
Springer
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
JAIR
2010
13 years 3 months ago
2010
In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coali...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...