A LINEAR-TIME ALGORITHM FOR COVERING SIMPLE POLYGONS WITH SIMILAR RECTANGLES
1996 ◽
Vol 06
(01)
◽
pp. 79-102
◽
Keyword(s):
We study the problem of covering a simple orthogonal polygon with a minimum number of (possibly overlapping) squares, all internal to the polygon. The problem has applications in VLSI mask generation, incremental update of raster displays, and image compression. We give a linear time algorithm for covering a simple polygon, specified by its vertices, with squares. Covering with similar rectangles (having a given x/y ratio) is an equivalent problem.
2017 ◽
Vol 27
(03)
◽
pp. 159-176
Keyword(s):
1986 ◽
Vol 34
(1)
◽
pp. 123
◽
2016 ◽
Vol 56
(4)
◽
pp. 836-859
◽
1986 ◽
Vol 4
(6)
◽
pp. 449-451
◽