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

DOI10.1016/J.COMGEO.2013.08.012MaRDI QIDQ390367zbMATH OpenOpenAlexFDO

Authors Alexander Gilbers, Rolf Klein

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

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)

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

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• scientific article; zbMATH DE number 1424307 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• A new upper bound for the VC-dimension of visibility regions
• Almost tight bounds for -nets
• Guarding galleries where every point sees a large area
• Guarding galleries where no point sees a small area.
• Improved approximation for guarding simple galleries from the perimeter
• New Results on Visibility in Simple Polygons
• Small-size -nets for axis-parallel rectangles and boxes
• Visibility Algorithms in the Plane

Cited in

(15)

• A new upper bound for the VC-dimension of visibility regions
• A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
• scientific article; zbMATH DE number 7559228 (Why is no real title available?)
• Guarding polyominoes under k-hop visibility
• The VC dimension of metric balls under Fréchet and Hausdorff distances
• The VC-dimension of visibility on the boundary of monotone polygons
• Minimum polygons for fixed visibility VC-dimension
• 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)