Two-point geodesic distance queries in polygonal domains

This thesis considers the problem of preprocessing polygons with holes for efficient two-point Euclidean shortest path queries. Special attention is given to the 1999 paper 'Two-Point Euclidean Shortest Path Queries in the Plane', which sketched a number of solutions to the problem and whose results remain the best in the field. This thesis reviews four of the algorithms presented in the paper and fleshes them out when possible.