Abstract
In this paper, we prove that the VC-Dimension of visibility on the boundary of a simple polygon is exactly 6. Our result is the first tight bound for any variant of the VC-Dimension problem regarding simple polygons. Our upper bound proof is based off several structural lemmas which may be of independent interest to researchers studying geometric visibility.
Cite
CITATION STYLE
Gibson, M., Krohn, E., & Wang, Q. (2015). The VC-Dimension of Visibility on the Boundary of a Simple Polygon. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9472 LNCS, pp. 541–551). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-662-48971-0_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
