Abstract
We investigate the watchman problem for rectilinear art galleries with an arbitrary number of holes. An efficient algorithm for the placement of the guards with running time O(n 3/2 log2 n log log n) is presented. Each guard has to watch an r-star of constant size.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.