Algorithms for covering polygons by rectangles

Abstract The polygons on the pattern generator used to produce masks for integrated circuits must be covered by the smallest possible number of rectangles. Two algorithms were elaborated to enable this task to be computerized. One of these algorithms is for general polygons, the other for orthogonal ones - the latter is quicker and more effective. Examples are given to demonstrate the effectiveness and the processing time of the program, which is part of the designer system for microelectronics (MICAD) elaborated at the Central Research Institute for Physics of the Hungarian Academy of Sciences.