Guarding galleries where no point sees a small area.

DOI10.1007/BF02897056zbMath1045.52500OpenAlexW2054867723WikidataQ56504473 ScholiaQ56504473MaRDI QIDQ1279960

Pavel Valtr

Publication date: 1998

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02897056

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items

Parameterized Analysis of Art Gallery and Terrain Guarding, On boundaries of highly visible spaces and applications, The VC-dimension of visibility on the boundary of monotone polygons, Guarding galleries and terrains, New Results on Visibility in Simple Polygons, Guarding galleries where every point sees a large area, The VC dimension of metric balls under Fréchet and Hausdorff distances, A new upper bound for the VC-dimension of visibility regions, VC-dimension of perimeter visibility domains, The parameterized complexity of guarding almost convex polygons, Berge's theorem, fractional Helly, and art galleries, Improved approximation for guarding simple galleries from the perimeter, Line-of-Sight Networks, A note on the perimeter of fat objects, Unnamed Item, Randomized query processing in robot path planning, An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries

Cites Work

• \(\epsilon\)-nets and simplex range queries
• Almost tight bounds for \(\epsilon\)-nets
• On galleries with no bad points
• Guarding galleries where every point sees a large area
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Unnamed Item
• Unnamed Item