Abstract

We consider the problem of covering polygons, without any acute interior angles, with rectangles. The rectangles must lie entirely within the polygon and it is preferable to cover the polygon with as few rectangles as possible. Let P be an arbitrary hole-free input polygon, with n vertices, coverable by rectangles. Let μ(P) denote the minimum number of rectangles required to cover P. In this paper we show, by using new techniques, that it is possible to construct a covering within an O(α(n)) approximation factor in O(n+μ(P)) time, where α(n) is the extremely slowly growing inverse of Ackermann's function. This improves the Ω(n0.49...) worst-case approximation factor in time O(n log n+μ(P)) known before.

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 call

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.