Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons

Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons | Litlas