Abstract
In this paper, we discuss the problem of covering a convex rectilinear polygon with the minimum number of rectangles. The rectangles can overlap with each other. We show that this problem can be solved in linear time, which improves the previous O(n2) result proposed by Franzblau and Kleitman3. However, Franzblau and Kleitman's algorithm works for a larger class of polygons (vertically convex).
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 callMore From: International Journal of Computational Geometry & Applications
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.
