22 search results - page 5 / 5 » The combinatorial encoding of disjoint convex sets in the pl... |
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
SWAT
2004
Springer
14 years 1 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...