Fast algorithm for polygon decomposition

Authors:
S. Nahar;S. Sahni
Affiliations:
Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 5

Minimum K-partitioning of rectilinear polygons

Journal of Symbolic Computation
Optimal uniformly monotone partitioning of polygons with holes

Computer-Aided Design
Approximate partitioning of 2D objects into orthogonally convex components

Computer Vision and Image Understanding
A parallel dual-scanline algorithm for partitioning parameterized 45-degree polygons

ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
Planar CMOS to multi-gate layout conversion for maximal fin utilization

Integration, the VLSI Journal

Quantified Score

Hi-index	0.03

Visualization

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)