Sciweavers

117
Voted
ISAAC
2004
Springer
79views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Paired Pointset Traversal
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 ...
Peter Hui, Marcus Schaefer