Reviews min convex cover and max hidden set problems, proves NP-hardness of checking if their numbers coincide for a polygon, supplies examples where the numbers differ, and derives consequences from prior self-cited work.
Convex cover and hidden set in funnel polygons, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Overview of Minimum Convex Cover and Maximum Hidden Set
Reviews min convex cover and max hidden set problems, proves NP-hardness of checking if their numbers coincide for a polygon, supplies examples where the numbers differ, and derives consequences from prior self-cited work.