By Topic

Covering rectilinear polygons by rectangles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wu, S.-Y. ; Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA ; Sahni, S.

Three approximation algorithms to cover a rectilinear polygon that is neither horizontally nor vertically convex by rectangles are developed. All three guarantee covers that have at most twice as many rectangles as in an optimal cover. One takes O(n log n) time, where n is the number of vertices in the rectilinear polygon. The other two take O(n2) and O(n4) time. Experimental results indicate that the algorithms with complexity O(n2) and O(n4) often obtain optimal or near-optimal covers

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:9 ,  Issue: 4 )