A new upper bound for the VC-dimension of visibility regions

DOI10.1016/J.COMGEO.2013.08.012zbMATH Open1288.65027OpenAlexW2217505494MaRDI QIDQ390367FDOQ390367

Rolf Klein, Alexander Gilbers

Publication date: 8 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.08.012

Recommendations

• A new upper bound for the VC-dimension of visibility regions
• The VC-dimension of visibility on the boundary of monotone polygons
• The VC-Dimension of Visibility on the Boundary of a Simple Polygon
• VC-dimension of perimeter visibility domains
• A note on visibility-constrained Voronoi diagrams
• The visibility-Voronoi complex and its applications
• The visibility-Voronoi complex and its applications
• A note on bounds for VC dimensions
• New Results on Visibility in Simple Polygons
• Graph Drawing

zbMATH Keywords

computational geometryvisibilityVC-dimensionsimple polygonart gallery problemrealizable numbervisibility regionsvisually discernible

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Almost tight bounds for \(\epsilon\)-nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Visibility Algorithms in the Plane
• Title not available (Why is that?)
• Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
• 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
• Improved approximation for guarding simple galleries from the perimeter

Cited In (11)

• A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
• Title not available (Why is that?)
• The VC dimension of metric balls under Fréchet and Hausdorff distances
• Visible shorelines for unions of islands
• On half guarding polygons
• An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
• The parameterized complexity of guarding almost convex polygons
• The VC-Dimension of Visibility on the Boundary of a Simple Polygon
• Parameterized Analysis of Art Gallery and Terrain Guarding
• Guarding polyominoes under \(k\)-hop visibility
• VC-dimension of perimeter visibility domains

This page was built for publication: A new upper bound for the VC-dimension of visibility regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390367)