The purpose of the current study is to investigate a special case of art gallery problem, namely Sculpture Garden Problem. In the said problem, for a given polygon $P$, the ultimate goal is to place the minimum number of guards to define the interior polygon $P$ by applying a monotone Boolean formula composed of the guards. As the findings indicate, the conjecture about the issue that in the worst case, $n-2$ guards are required to describe any $n$-gon (Eppstein et al. 2007) can be conclusively proved.

中文翻译：

---

雕塑花园问题的下界

当前研究的目的是调查艺术画廊问题的一个特例，即雕塑花园问题。在上述问题中，对于给定的多边形$P$，最终目标是通过应用由守卫组成的单调布尔公式，放置最少数量的守卫来定义内部多边形$P$。正如研究结果所表明的，关于在最坏的情况下需要 $n-2$ 个守卫来描述任何 $n$-gon（Eppstein et al. 2007）这个问题的猜想可以得到最终证明。