An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons

Aronov, 1993, Furthest-site geodesic Voronoi diagram, Discrete Comput. Geometry, 9, 217, 10.1007/BF02189321 de Berg, 1991, On rectilinear link distance, Comput. Geometry: Theory Appl., 1, 13, 10.1016/0925-7721(91)90010-C de Berg, 1990, Finding shortest paths in the presence of orthogonal obstacles using a combined L1 and link metric, 213 Chazelle, 1991, Triangulating a simple polygon in linear time, Discrete Comput. Geometry, 6, 485, 10.1007/BF02574703 Kim, 1999, Computing the optimal bridge between two polygons Schuierer, 1996, An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon, Internat. J. Comput. Geometry Appl., 6, 205, 10.1142/S0218195996000149