Shortest Inspection-Path Queries in Simple Polygons (2009)
Christian Knauer, Günter Rote, Lena Schlipf
Abstract. We want to preprocess a simple n-vertex polygon P to quickly determine the shortest path p from a fixed source point s ∈ P to view a set Q ⊆ P of query points (i.e., such that each...