Optimal shortest path queries in a simple polygon

Aggarwal, 1987, Geometric applications of a matrix searching algorithm, Algorithmica, 2, 195, 10.1007/BF01840359 Bhattacharya, 1986, A Linear Algorithm for Determining Translation Separability of Two Simple Polygons Edelsbrunner, 1986, Optimal point location in a monotone subdivision, SIAM J. Comput., 15, 317, 10.1137/0215023 Chazelle, 1981, A theorem on polygon cutting with applications, 70 Chazelle, 1985, Visibility and intersection problems in plane geometry, 135 Guibas, 1986, Linear time algorithms for visibility and shortest path problems inside simple polygons, 1 Lee, 1984, Euclidean shortest paths in the presence of rectilinear barriers, Networks, 14, 393, 10.1002/net.3230140304 Overmars, 1981, Maintenance of configurations in the plane, J.Comput. System Sci., 23, 166, 10.1016/0022-0000(81)90012-X Preparata, 1986 Reif, 1985, Shortest Paths in Euclidean Space with Polyhedral Obstacles Suri, 1987, The all-geodesic-furthest neighbor problem for simple polygons, 64 Tarjan, 1988, An O(n log log n)-time algorithm for triangulating a simple polygon, SIAM J. Comput., 17, 143, 10.1137/0217010