Watchman route in a simple polygon with a rubberband algorithm

So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3 log n), published in 2003 by M. Dror, A. Efrat, A. Lubiw, and J. Mitchell.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Fajie Li, Reinhard Klette
• Keywords: CCCG 2010, Computational Geometry, Shortest Path, Simple Polygon, Watchman Route Problem