Abstract
In this paper, we present an O(n 3 log n) time and O(n) space algorithm to solve the problem of two-guarding a simple rectilinear polygon. The complexity of our algorithm is much faster than the O(n 4) time and O(n 2 log n) space algorithm for general simple polygons [Bel92]. It also sheds light on solving the open problem of computing the two-watchmen routes of a simple rectilinear polygon.
Cite
CITATION STYLE
Tan, X., & Zhu, B. (1996). Two-guarding a rectilinear polygon. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1090, pp. 391–400). Springer Verlag. https://doi.org/10.1007/3-540-61332-3_173
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
