2000 character limit reached
An Overview of Minimum Convex Cover and Maximum Hidden Set (2403.01354v1)
Published 3 Mar 2024 in cs.CG
Abstract: We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden set number. We then give some important examples in which these quantities don't always coincide. Finally, We present some consequences of insights from Browne, Kasthurirangan, Mitchell and Polishchuk [FOCS, 2023] on other classes of simple polygons.
- Mikkel Abrahamsen. Covering polygons is even harder. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 375–386, 2022.
- Constructing Concise Convex Covers via Clique Covers. In Erin W. Chambers and Joachim Gudmundsson, editors, 39th International Symposium on Computational Geometry (SoCG 2023), volume 258 of Leibniz International Proceedings in Informatics (LIPIcs), pages 66:1–66:9, Dagstuhl, Germany, 2023. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
- A 1/4-approximation algorithm for the maximum hidden vertex set problem in simple polygons. In European Workshop on Computational Geometry, 2019.
- A deterministic almost-linear time algorithm for minimum-cost flow. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 503–514, 2023.
- Constant-factor approximation algorithms for convex cover and hidden set in a simple polygon. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 1357–1365, Los Alamitos, CA, USA, nov 2023. IEEE Computer Society.
- Reilly Browne. Convex cover and hidden set in funnel polygons, 2023.
- Collapsing the hidden-set convex-cover inequality. In Proceedings of the 38th Computational Geometry Young Researchers Forum (CG:YRF 2022), pages 27–32. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2022.
- Covering polygons is hard. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pages 601–611, 1988.
- R. P. Dilworth. A decomposition theorem for partially ordered sets. Ann. of Math., 51(1):161–166, 1950.
- Stephan Eidenbenz. Inapproximability of finding maximum hidden sets on polygons and terrains. Computational Geometry, 21(3):139–153, 2002.
- An approximation algorithm for minimum convex cover with logarithmic performance guarantee. SIAM Journal on Computing, 32(3):654–670, 2003.
- D. S. Franzblau. Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles. SIAM Journal on Discrete Mathematics, 2(3):307–321, 1989.
- Clique cover of graphs. Applied mathematical sciences, 8:4301–4307, 2014.
- Characterizing and recognizing weak visibility polygons. Computational Geometry, 3(4):213–233, 1993.
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209–233, 1987.
- D. Lee and F. Preparata. An optimal algorithm for finding the kernel of a polygon. Journal of the ACM (JACM), 26:415–421, 07 1979.
- Minimum-link paths revisited. Computational Geometry, 47(6):651–667, 2014. Special issue on EuroCG’11.
- T. Shermer. Hiding people in polygons. Computing, 42(2-3):109–131, 1989.
- Subhash Suri. A linear time algorithm for minimum link paths inside a simple polygon. Computer Vision, Graphics, and Image Processing, 35(1):99–110, 1986.