Exact VC-dimension for -visibility of points in simple polygons
arXiv:1705.01723
Abstract
The VC-dimension plays an important role for the algorithmic problem of guarding art galleries efficiently. We prove that inside a simple polygon at most points can be shattered by -visibility polygons and give an example where 5 points are shattered. The VC-dimension is exactly . The proof idea for the upper bound is different from previous approaches. Keywords: Art gallery, VC-dimension, -visibility, polygons