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.

翻译：本文回顾了最小凸覆盖与最大隐藏集问题的相关结果，并给出若干新结论。首先，我们证明判定多边形是否具有与其隐藏集数相等的凸覆盖数是NP难的。随后给出若干重要实例，表明这两个量并非总是一致。最后，我们阐述了Browne、Kasthurirangan、Mitchell与Polishchuk [FOCS, 2023] 的研究对其它简单多边形类的若干推论。