Guarding galleries where every point sees a large area
From MaRDI portal
Publication:1380500
DOI10.1007/BF02760925zbMath0953.68137MaRDI QIDQ1380500
Publication date: 4 March 1998
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ On boundaries of highly visible spaces and applications ⋮ New Results on Visibility in Simple Polygons ⋮ 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 ⋮ Guarding galleries where no point sees a small area. ⋮ An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
Cites Work
- \(\epsilon\)-nets and simplex range queries
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
- Geometric and analytic number theory. Transl. from the German by Rudolf Taschner
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Guarding galleries where no point sees a small area.
- Density and dimension
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.
- COMPUTATIONAL GEOMETRY COLUMN 18
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Unnamed Item
- Unnamed Item
- Unnamed Item
