Covering Polygons with Rectangles

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10185)

Abstract

A well-known and well-investigated family of hard optimization problems deals with nesting, i.e., the non-overlapping placing of polygons to be cut from a rectangle or the plane whilst minimizing the waste. Here we consider the in some sense inverse problem of a subsequent step in production technology: given a set of polygons in the plane and an axis-aligned rectangle (modeling a gripping device), we seek the minimum number of copies of the rectangle such that every polygon is completely covered by at least one copy of the rectangle. As motions of the given rectangle for obtaining the copies we investigate the cases of translation in x-direction, of arbitrary translation and of arbitrary translation combined with rotation. We give a generic algorithm for all three cases which leads to a polynomial-time algorithm for the first case. The other two cases are NP-hard so we introduce a rather straightforward algorithm for the second case and two different approaches to the third one. Finally, we give experimental results and compare them to the theoretical analysis done before.

References

  1. 1.
    Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite vc-dimension. Discrete Comput. Geom. 14(4), 463–479 (1995)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Chazelle, B.: The polygon containment problem. Adv. Comput. Res. 1, 1–33 (1983)Google Scholar
  3. 3.
    Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37(1), 43–58 (2007)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. In: 29th Annual Symposium on Foundations of Computer Science, pp. 601–611. IEEE Computer Society (1988)Google Scholar
  5. 5.
    de Berg, M., Cabello, S., Har-Peled, S.: Covering many or few points with unit disks. Theory Comput. Syst. 45(3), 446–469 (2009)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry, 3rd edn. Springer, Heidelberg (2008)CrossRefMATHGoogle Scholar
  7. 7.
    Dickerson, M., Scharstein, D.: Optimal placement of convex polygons to maximize point containment. Comput. Geom. 11(1), 1–16 (1998)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Dowsland, K.A., Dowsland, W.B.: Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84(3), 506–521 (1995)CrossRefMATHGoogle Scholar
  9. 9.
    Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal packing and covering in the plane are np-complete. Inf. Process. Lett. 12(3), 133–137 (1981)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Gibbons, A., Rytter, W.: Efficient Parallel Algorithms. Cambridge University Press, Cambridge (1988)MATHGoogle Scholar
  11. 11.
    Glück, R.: Covering polygons with rectangles. In: Proceedings of the EuroCG 2016 (2016)Google Scholar
  12. 12.
    Hegedüs, A.: Algorithms for covering polygons by rectangles. Comput.-Aided Des. 14(5), 257–260 (1982)CrossRefGoogle Scholar
  13. 13.
    Heinrich-Litan, L., Lübbecke, M.E.: Rectangle covers revisited computationally. ACM J. Exp. Algorithmics 11 (2006)Google Scholar
  14. 14.
    Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130–136 (1985)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Kumar, V.S.A., Ramesh, H.: Covering rectilinear polygons with axis-parallel rectangles. In: Vitter, J.S., Larmore, L.L., Leighton, F.T. (eds.) Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 445–454. ACM (1999)Google Scholar
  16. 16.
    Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Texts and Monographs in Computer Science. Springer, New York (1985)CrossRefMATHGoogle Scholar
  17. 17.
    Reif, J.H.: Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers Inc., San Mateo (1993)Google Scholar
  18. 18.
    Shamos, M.I.: Computational Geometry. PhD thesis, Yale University (1978)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Deutsches Zentrum für Luft- und RaumfahrtAugsburgGermany

Personalised recommendations