VLSI Design

VLSI Design / 1994 / Article

Open Access

Volume 1 |Article ID 16075 | 23 pages | https://doi.org/10.1155/1994/16075

Fast Algorithms to Partition Simple Rectilinear Polygons

Received20 Sep 1989
Revised02 Mar 1990


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.

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.

More related articles

0 Views | 0 Downloads | 0 Citations
 PDF  Download Citation  Citation
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.