Given n pairs of points in the Euclidean plane, we address the problem of finding paths of minimum length linking the pairs that can be made disjoint by infinitesimal deformations. We present and compare several fast heuristics and their implementation.
