VC-dimension of perimeter visibility domains
From MaRDI portal
Publication:402367
DOI10.1016/j.ipl.2014.06.011zbMath1358.68303OpenAlexW2036490847MaRDI QIDQ402367
Publication date: 28 August 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.011
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (3)
The VC-dimension of visibility on the boundary of monotone polygons ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ Parameterized complexity of secluded connectivity problems
Cites Work
- Unnamed Item
- A new upper bound for the VC-dimension of visibility regions
- Improved approximation for guarding simple galleries from the perimeter
- \(\epsilon\)-nets and simplex range queries
- Guarding galleries where no point sees a small area.
- Guarding galleries where every point sees a large area
- New Results on Visibility in Simple Polygons
- A new upper bound for the VC-dimension of visibility regions
This page was built for publication: VC-dimension of perimeter visibility domains