Abstract
We show the following for polygons without holes: 1. covering the interior or boundary of an arbitrary polygon with convex polygons is NP-hard; 2. covering the vertices of an arbitrary polygon with convex polygons is NP-complete; 3. covering the interior or boundary of an orthogonal polygon with rectangles is NP-complete. We note that these results hold even if the polygons are required to be in general position
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.