@techreport{R-86-01, TITLE = {Minimum Length and "Thickest-First" Rectangular Partitions of Polygons}, AUTHOR = {Christos Levcopoulos}, YEAR = {1986}, NUMBER = {R-86-01}, INSTITUTION = ida, ADDRESS = idaaddr, ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-86-01+abstr}, ABSTRACT = {Partitioning polygons into rectangles by drawing edges of minimum total length has a variety of applications [10], eg. In VLSI design when dividing routing regions into channels [12]. In this paper a simple and efficient greedy approximation algorithms is presented and analyzed, and in this way previous result are improved significantly. Roughly, the idea is to draw every time a maximal rectangle whose shortest side is as long as possible. Also, several other related results are announced.}, IDANR = {LiTH-IDA-R-86-01}, NOTE = {Also in Proc.of the 23rd Annual Allerton Conference on Communication, Control and Computing, Monticello, Illinois, October, 1985}