Computing the Optimal Bridge between Two Polygons

@article{Kim2001ComputingTO,
  title={Computing the Optimal Bridge between Two Polygons},
  author={Sung Kwon Kim and Chan-Su Shin},
  journal={Theory of Computing Systems},
  year={2001},
  volume={34},
  pages={337-352}
}
Let P and Q be disjoint polygons in the plane. We consider the problem of finding an optimal bridge (p,q) , p∈ \partial P and q∈ \partial Q , such that the length of the longest path from a point in P , passing through the bridge (p,q) , to a point Q is minimized. We propose efficient algorithms for three cases according to whether P and Q are convex or not. These problems are motivated from the bridge construction between two islands (or the canal construction between two lakes). 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS