Evaluation of algorithms for finding bridges between two disjoint convex polygons
The bridge problem considers k disjoint regions in the plane or space and tries to place k -1 optimal bridges connecting all the regions. The optimal bridges are de ned as line segments that minimize the length of the longest path between