The VC-Dimension of Visibility on the Boundary of a Simple Polygon

DOI10.1007/978-3-662-48971-0_46MaRDI QIDQ3459892zbMATH OpenOpenAlexFDO

Authors Qing Wang, Matt Gibson, Erik Krohn

Publication date 11 January 2016

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48971-0_46

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The VC-dimension of visibility on the boundary of monotone polygons
• Minimum polygons for fixed visibility VC-dimension
• VC-dimension of perimeter visibility domains
• scientific article; zbMATH DE number 434872
• A new upper bound for the VC-dimension of visibility regions
• A new upper bound for the VC-dimension of visibility regions
• On the number of visibility graphs of simple polygons
• The visibility-Voronoi complex and its applications
• The visibility-Voronoi complex and its applications
• A characterization of simplices in terms of visibility

Cited in

(9)

• The VC-dimension of visibility on the boundary of monotone polygons
• Minimum polygons for fixed visibility VC-dimension
• A new upper bound for the VC-dimension of visibility regions
• VC-dimension of perimeter visibility domains
• Tight lower bounds on the VC-dimension of geometric set systems
• A new upper bound for the VC-dimension of visibility regions
• Guarding polyominoes under \(k\)-hop visibility
• On half guarding polygons
• Guarding polyominoes under k-hop visibility

This page was built for publication: The VC-Dimension of Visibility on the Boundary of a Simple Polygon

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