Title :
Fast algorithm for polygon decomposition
Author :
Nahar, Surendra ; Sahni, Sartaj
Author_Institution :
Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
fDate :
4/1/1988 12:00:00 AM
Abstract :
An O(klog(k)+n) algorithm is developed, where n is the number of versions, to decompose rectilinear polygons into rectangles. This algorithm uses horizontal cuts only and reports nonoverlapping rectangles the union of which is the original rectilinear polygon. This algorithm has been programmed in Pascal on an Apollo DN320 workstation. Experimentation with rectilinear polygons from VLSI artwork indicate that the present algorithm is significantly faster than the plane sweep algorithm and the algorithm proposed by K.D. Gourley and D.M. Green (1983)
Keywords :
Pascal; VLSI; circuit layout CAD; computer graphics; engineering workstations; Apollo DN320 workstation; Pascal; VLSI artwork; computational geometry; decompose rectilinear polygons into rectangles; fast algorithm; horizontal cuts only; polygon decomposition; rectilinear polygons; reports nonoverlapping rectangles; time complexity; Application software; Computer graphics; Computer science; Helium; Image analysis; Image processing; Layout; Partitioning algorithms; Very large scale integration; Workstations;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
