Lower Bound for Sculpture Garden Problem

17 Jul 2021 · Marzieh Eskandari, Bahram Sadeghi Bigham ·

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.

PDF Abstract

Code

Add Remove Mark official

No code implementations yet. Submit your code now

Datasets

Add Datasets introduced or used in this paper

Edit Social Preview

Lower Bound for Sculpture Garden Problem

Code Edit Add Remove Mark official

Categories

Datasets Edit

Code

Add Remove Mark official

Datasets