Abstract
The fortress problem is one of determining a set of guards to cover the exterior of a simple polygon. O'Rourke and Wood [cited in 7] showed that $ \lceil n/2 \rceil $ vertex guards are sometimes necessary and always sufficient for an $ n $ -vertex polygon. In this paper, we solve the same problem for edge guards. Tight bounds of $ \lceil n/3 \rceil $ and $ \lfloor n/4 \rfloor + 1 $ edge guards are obtained for general and rectilinear polygons, respectively.
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.
