Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Covering Rectilinear Polygons with Area-Weighted Rectangles (2312.08540v1)

Published 13 Dec 2023 in cs.CG and cs.DS

Abstract: Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned rectangles such that the total weight of the rectangles in the cover is minimized. Already the unit-weight case is known to be NP-hard and the general problem has, to the best of our knowledge, not been studied experimentally before. We show a new basic property of optimal solutions of the weighted problem. This allows us to speed up existing algorithms for the unit-weight case, obtain an improved ILP formulation for both the weighted and unweighted problem, and develop several approximation algorithms and heuristics for the weighted case. All our algorithms are evaluated in a large experimental study on 186 837 polygons combined with six cost functions, which provides evidence that our algorithms are both fast and yield close-to-optimal solutions in practice.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. Geometric Optimization Revisited, pages 66–84. 2019.
  2. Near-Linear Algorithms for Geometric Hitting Sets and Set Covers. In Proc. 13th Symposium on Computational Geometry (SoCG’14), page 271–279, 2014.
  3. Covering Rectilinear Polygons with Axis-Parallel Rectangles. In Proc. 31st Symposium on Theory of Computing (STOC’99), page 445––454, 1999.
  4. Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. Algorithmica, 17(4):331–356, 1997.
  5. Practical and efficient algorithms for the geometric hitting set problem. Discrete Applied Mathematics, 240:25–32, May 2018.
  6. An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM, 39(1):1–54, 1992.
  7. V. Chvatal. A Greedy Heuristic for the Set-Covering Problem. Math. Oper. Res., 4(3):233–235, 1979.
  8. Covering Polygons Is Hard. J. Algorithms, 17(1):2–44, 1994.
  9. David Eppstein. Graph-Theoretic Solutions to Computational Geometry Problems. In Proc. 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’09), page 1–16, 2009.
  10. Hitting sets when the VC-dimension is small. Information Processing Letters, 95(2):358–362, 2005.
  11. Uriel Feige. A Threshold of Ln n for Approximating Set Cover. J. ACM, 45(4):634–652, jul 1998.
  12. Minimal rectangular partitions of digitized blobs. Comput. Vis. Graph. Image Process., 28(1):58–71, 1984.
  13. Deborah S. Franzblau. Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles. SIAM J. Discret. Math., 2(3):307–321, 1989.
  14. An Algorithm for Covering Polygons with Rectangles. Inf. Control., 63(3):164–189, 1984.
  15. The generalized minimum Manhattan network problem (GMMN)–scale-diversity aware approximation and a primal-dual algorithm. In Proc. Canadian Conference on Computational Geometry (CCCG’14), 2014.
  16. Combinatorial Algorithms for Design of DNA Arrays. Advances in biochemical engineering/biotechnology, 77:1–19, 02 2002.
  17. András Hegedüs. Algorithms for covering polygons by rectangles. Computer-Aided Design, 14(5):257–260, 1982.
  18. Rectangle Covers Revisited Computationally. ACM J. Exp. Algorithmics, 11:2.6–es, 2007.
  19. Efficient Algorithms for Geometric Graph Search Problems. SIAM J. Comput., 15(2):478–494, 1986.
  20. David S. Johnson. Approximation Algorithms for Combinatorial Problems. In Proc. 5th Symposium on Theory of Computing (STOC’73), page 38–49, 1973.
  21. On the Union Complexity of Families of Axis-Parallel Rectangles with a Low Packing Number. Electron. J. Comb., 25(4):4, 2018.
  22. A Hybrid Heuristic for the Rectilinear Picture Compression Problem. 4OR, Jun 2022.
  23. Minimum edge length partitioning of rectilinear polygons. In Proc. 20th Allerton Conference on Communication, pages 53–63, 1982.
  24. On two-dimensional data organization II. Fundamenta Informaticae, 2(1):245–260, 1978.
  25. László Miklós Lovász. On the ratio of optimal integral and fractional covers. Discret. Math., 13:383–390, 1975.
  26. WJ Masek. Some np-complete set cover problems. unpublished manuscript, MIT Laboratory for Computer Science, 1978.
  27. Jaromił Najman. Covering Rectilinear Polygons by Rectangles. Master Thesis at the RWTH Aachen (Dep. Operations Research), 2014.
  28. Tatsuo Ohtsuki. Minimum dissection of rectilinear regions. In Proc. 1982 IEEE Symp. on Circuits and Systems, page 1210–1213, 1982.
  29. Minimum cost polygon overlay with rectangular shape stock panels. CoRR, abs/1606.05927, 2016.
  30. The CGAL Project. CGAL User and Reference Manual. CGAL Editorial Board, 5.5.3 edition, 2023.
  31. Kasturi Varadarajan. Weighted Geometric Set Cover via Quasi-Uniform Sampling. In Proc. 42nd Symposium on Theory of Computing (STOC’10), page 641–648, 2010.
  32. Martin Zachariasen. A catalog of Hanan grid problems. Networks, 38(2):76–83, 2001.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now