Hey guys, my professor recently posed the problem of finding a simple Fisk like proof for the Art Gallery Theorem with holes:(adsbygoogle = window.adsbygoogle || []).push({});

it says thats to guard a polygon with n vertices and h holes, we will always need at most floor[(n+h)/3] where floor represents the floor function.

now i saw some proofs, some used induction, others used the fact that we can split one of the hole vertices into 2 vertices and build channels, eliminating the hole and creating h vertices, so we would be left with a polygon with n+h vertices, and then we just apply the regular Art Gallery Theorem.

however, I am trying to prove this theorem without using any perturbations.

i'm just wondering if any of you guys have tried to solve this or have encountered a similar type problem in your studies, whatever studies it may be.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Art Gallery Theorem with Holes

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

**Physics Forums | Science Articles, Homework Help, Discussion**