Abstract
In the acrophobic guard watchtower problem for a polyhedral terrain, a square axis-aligned platform is placed on the top of a tower whose bottom end-point lies on the surface of the terrain. As in the standard watchtower problem, the objective is to minimize the height (i.e., the length) of the watchtower such that every point on the surface of the terrain is weakly visible from the platform placed on the top of the tower. In this paper, we show that in R2 the problem can be solved in O(n) time, and in R3 it takes O(nlogn) time, where n is the total number of vertices of the terrain.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
