Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 1 (1994), Issue 3, Pages 193-215

Fast Algorithms to Partition Simple Rectilinear Polygons

1Cadence Design Systems, Inc., 555 Riveroaks Parkway, Bldg. 2, San Jose 95134, CA, USA
2Department of CIS, CSE 301, University of Florida, Gainesville 32611, FL, USA

Received 20 September 1989; Revised 2 March 1990

Copyright © 1994 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Two algorithms to partition hole-free rectilinear polygons are developed. One has complexity ∼ O(kn) and the other O(n log k) where n is the number of vertices in the polygon and k is the smaller of the number of vertical and horizontal inversions of the polygon, k is a measure of the simplicity of a polygon. Since k is small for most practical polygons, our algorithms are fast in practice. Experimental results comparing our algorithms with that of Imai and Asano [1] are also presented.