Reflective guarding a gallery
From MaRDI portal
Publication:6091148
DOI10.1007/978-3-031-27051-2_8OpenAlexW4324010424MaRDI QIDQ6091148
Arash Vaezi, Mohammad Ghodsi, Bodhayan Roy
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-27051-2_8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diffuse reflection diameter in simple polygons
- Improved approximation for guarding simple galleries from the perimeter
- Diffuse reflection radius in a simple polygon
- Approximation algorithms for art gallery problems in polygons
- Ergodicity of billiard flows and quadratic differentials
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Visibility with multiple reflections
- Visibility with one reflection
- Visibility extension via mirror-edges to cover invisible segments
- How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments
- Visibility of a simple polygon
- Computational complexity of art gallery problems
- Some NP-hard polygon decomposition problems
- Irrational Guards are Sometimes Needed
- Modern Optics
- Polygonal Rooms Not Illuminable from Every Point
- Principles of Optics
- The art gallery problem is ∃ ℝ-complete
- Billiards in polygons
- Billiards in polygons
This page was built for publication: Reflective guarding a gallery
