2024/03/03 by Reilly Browne, Browne, Reilly
Computer Science · Engineering · Mathematics · Social Sciences · #Advanced Computing and Algorithms #Advanced Image and Video Retrieval Techniques #Automated Road and Building Extraction #Computer science #Cover (algebra) #Engineering #Geometry #Mathematics #Regular polygon #Set (abstract data type)
paper · pdf · doi:10.48550/arxiv.2403.01354
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2024/03/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.