Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons

@article{Bhosle2005ExactAA,
  title={Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons},
  author={Amit M. Bhosle and Teofilo F. Gonzalez},
  journal={Int. J. Comput. Geometry Appl.},
  year={2005},
  volume={15},
  pages={609-630}
}
Given two simple polygons P and Q we define the weight of a bridge (p, q), with p ∈ ρ(P ) and q ∈ ρ(Q), where ρ() denotes the compact region enclosed by the boundary of the polygon, between the two polygons as gd(p, P ) + d(p, q) + gd(q, Q), where d(p, q) is the Euclidean distance between the points p and q, and gd(x, X) is the geodesic distance between x and its geodesic furthest neighbor on X. Our problem differs from another version of the problem where the additional restriction of… CONTINUE READING