Abstract
In this paper we present an O( n) time algorithm for covering a horizontally convex orthogonal polygon with the minimum number of orthogonal star-shaped polygons. Finding minimum covers by star-shaped polygons is equivalent to finding the minimum number of guards needed so that every point in the polygon is visible to at least one guard. This problem has important applications in robotics and pattern recognition.
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.
