Technical Report CS0595

Title: Covering Polygons With Squares
Authors: R. Bar-Yehuda and Y. Ben-Chanoch
Abstract: We study the problem of covering a polygon with minimum number of squares, possibly overlapping, all internal to the polygon. This problem has applications in VLSI mask generation, incremental update of raster displays, and image compression. We consider two types of polygons: simple and non-simple (with holes). Both related to two known polygon representions; the segments list and the bit-maps.

Key Words: Computational Geometry, Orthogonal Polygons, Square Cover, Aproximation Algorithms.

CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1989
To the main CS technical reports page

Computer science department, Technion