We present linear-time algorithms for both maximum hidden set and minimum convex cover in funnel polygons. These algorithms show that funnel polygons are "homestead" polygons, i.e. polygons for which the hidden set number and the convex cover number coincide. We extend the algorithm to apply to maximum hidden vertex set and use the result to give a 2-approximation for all three problems in pseudotriangles.

翻译：我们提出了漏斗多边形中最大隐藏集与最小凸覆盖问题的线性时间算法。这些算法证明漏斗多边形属于"同构"多边形，即其隐藏集数与凸覆盖数相等的多边形。我们将该算法扩展应用于最大隐藏顶点集问题，并利用该结果给出伪三角形中所有三个问题的2-近似算法。