[2403.01354] An Overview of Minimum Convex Cover and Maximum Hidden Set Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Computational Geometry arXiv:2403.01354 (cs) [Submitted on 3 Mar 2024 ( v1 ), last revised 28 Apr 2026 (this version, v2)] Title: An Overview of Minimum Convex Cover and Maximum Hidden Set Authors: Reilly Browne View a PDF of the paper titled An Overview of Minimum Convex Cover and Maximum Hidden Set, by Reilly Browne View PDF HTML (experimental) 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. Subjects: Computational Geometry (cs.CG) Cite as: arXiv:2403.01354 [cs.CG] (or arXiv:2403.01354v2 [cs.CG] for this version) https://doi.org/10.48550/arXiv.2403.01354 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Reilly Browne [ view email ] [v1] Sun, 3 Mar 2024 00:56:05 UTC (4,372 KB) [v2] Tue, 28 Apr 2026 22:54:07 UTC (4,373 KB) Full-text links: Access Paper: View a PDF of the paper titled An Overview of Minimum Convex Cover and Maximum Hidden Set, by Reilly Browne View PDF HTML (experimental) TeX Source view license Current browse context: cs.CG < prev | next > new | recent | 2024-03 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from