2021/07/17 by Marzieh Eskandari, Eskandari, Marzieh, Bahram Sadeghi Bigham +1
Computer Science · Engineering · #68U05 #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Management and Algorithms #FOS: Computer and information sciences #Smart Parking Systems Research
paper · pdf · doi:10.48550/arxiv.2107.08175
openalex publication_date 2021/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.