Improved bounds for covering general polygons with rectangles

  • Christos Levcopoulos
Session 2 Graph Algorithms & Geometric Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)


Horizontal Side General Polygon Voronoi Edge Approximation Behavior Generalize Voronoi Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ch80]
    Chazelle, B.M., “Computational Geometry and Convexity”, PhD Dissertation, 1980, pp 140–145.Google Scholar
  2. [CKSS]
    Chaiken, S., D.J. Kleitman, M. Saks and J. Shearer, “Covering Regions by Rectangles”, SIAM J. Alg. Disc. Meth., vol. 2, no. 4, 1981.Google Scholar
  3. [FK84]
    Franzblau, D., D. Kleitman, “An Algorithm for Constructing Regions with Rectangles”, Proc. 16th Annual ACM Symp. on Theory of Comp., 1984.Google Scholar
  4. [He82]
    Hegedüs, A., “Algorithms for covering polygons by rectangles, Computer Aided Design”, vol. 14, no. 5, 1982.Google Scholar
  5. [Ki79]
    Kirkpatrick, D.G., “Efficient computation of continuous skeletons”, 20th Annual IEEE Symp. on Found. of Comp. Sc., 1979.Google Scholar
  6. [Le84]
    Levcopoulos, C., “On Covering Regions with Minimum Number of Rectangles”, Proc. International Workshop on Parallel Computing and VLSI, Amalfi, Italy, 1984 (North Holland).Google Scholar
  7. [Le85]
    Levcopoulos, C., “A Fast Heuristic for Covering Polygons by Rectangles”, Proc. Fundamentals of Comp. Theory, Cottbus, GDR, 1985 (LNCS Springer-Verlag).Google Scholar
  8. [Le87]
    Levcopoulos, C., “Covering hole-free polygons with rectangles” (preliminary title), in preparation.Google Scholar
  9. [LL84a]
    Levcopoulos, C., A. Lingas, “Covering Polygons with Minimum Number of Rectangles”, STACS'84, Paris (LNCS Springer Verlag).Google Scholar
  10. [Ma79]
    Masek, W.J., “Some NP-complete set covering problems”, manuscript, MIT, August 1979.Google Scholar
  11. [OR82]
    O'Rourke, J., “The decidability of covering by convex polygons”, manuscript, The John Hopkins University, May 1982.Google Scholar
  12. [OS83]
    O'Rourke, J., and K.J. Supowit, “Some NP-hard Polygon Decomposition Problems”, IEEE Trans. on Information Theory, Vol. IT-29, 2, (1983), 181–190.CrossRefGoogle Scholar
  13. [PS85]
    Preparata, F.P., and M.I. Shamos, “Computational Geometry”, New York, Springer-Verlag, 1985.Google Scholar
  14. [YIH]
    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
  15. [W86]
    Wiernik, A., “Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments”, in Proc. of the 27th IEEE Symp. on Foundations of Computer Science, October 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Christos Levcopoulos
    • 1
  1. 1.Department of Computer and Information ScienceLinköping UniversityLinköpingSweden

Personalised recommendations