Skip to main content
SpringerLink
Log in

A fast heuristic for covering polygons by rectangles

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

Included in the following conference series:

Abstract

During the fabrication of masks for integrated circuits, the polygons on the pattern generator must be covered by a preferably as small as possible number of rectangles. In this paper we present a fast and simple heuristic, based on Voronoi diagrams, which covers arbitrary polygons without acute interior angles by rectangles in time O(nlogn + r), where n is the number of edges of the polygon and r is the number, in practice close to n, of rectangles produced. Several results are proved concerning upper bounds on the number of rectangles produced, and they suggest that the algorithm is near-optimal.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chazelle, B.M., “Computational Geometry and Convexity”, PhD Dissertation, 1980, pp 140–145.

    Google Scholar 

  2. Franzblau, D., D. Kleitman, An Algorithm for Constructing Regions with Rectangles, 16th annual ACM STOC, 1984.

    Google Scholar 

  3. Hegedüs, A., Algorithms for covering polygons by rectangles, Computer Aided Design, vol. 14, no. 5, 1982.

    Google Scholar 

  4. Kirkpatrick, D.G., “Efficient computation of continuous skeletons”, Annual IEEE Symp. on Found. of Comp. Sc., 1979.

    Google Scholar 

  5. Levcopoulos, C., On Covering Regions with Minimum Number of Rectangles, Int. Workshop on VLSI, Italy, May 1984 (North Holland).

    Google Scholar 

  6. Levcopoulos, C., A. Lingas, Covering Polygons with Minimum Number of Rectangles, STACS'84, Paris (Springer Verlag).

    Google Scholar 

  7. Masek, W.J., “Some NP-complete set covering problems,” manuscr., MIT (1978).

    Google Scholar 

  8. O'Rourke, J., The decidability of covering by convex polygons, manuscript, The John Hopkins University, May 1982.

    Google Scholar 

  9. Yamashita M., T. Ibaraki and N. Honda, The minimum number cover problem of a rectilinear region by rectangles, Toyohashi Univ. of Technology, 1984. (abstract appeared in the Bulletin of EATCS, October 1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Linköping University, S-581 83, Linköping, Sweden

    Christos Levcopoulos

Authors
  1. Christos Levcopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levcopoulos, C. (1985). A fast heuristic for covering polygons by rectangles. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028811

Download citation

  • DOI: https://doi.org/10.1007/BFb0028811

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation