Abstract
We present an O(nrG) time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction, while varies in, obtaining the directions for the tour to be the shortest one over all tours, where n is the number of vertices, r is the number of reflex vertices, and is the maximum number of gates of the polygon used at any time in the algorithm.
Author supplied keywords
Cite
CITATION STYLE
Nilsson, B. J., Orden, D., Palios, L., Seara, C., & Żyliński, P. (2020). Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12273 LNCS, pp. 311–323). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-58150-3_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
