Abstract | ||
---|---|---|
We show that the VC-dimension of visibility on the boundary of a monotone polygon is exactly 6. Our lower bound construction matches the best known lower bound for simple polygons. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.comgeo.2018.10.006 | Computational Geometry |
Keywords | Field | DocType |
Computational Geometry,Visibility,Monotone Polygons,VC-dimension,Art Gallery Problem | Discrete mathematics,Combinatorics,VC dimension,Polygon,Visibility,Upper and lower bounds,Monotone polygon,Mathematics | Journal |
Volume | ISSN | Citations |
77 | 0925-7721 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Matt Gibson | 1 | 99 | 11.71 |
Erik Krohn | 2 | 106 | 9.16 |
Qing Wang | 3 | 345 | 76.64 |