Reflective guarding a gallery

DOI10.1007/978-3-031-27051-2_8MaRDI QIDQ6091148zbMATH OpenOpenAlexFDO

Authors Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 47098 (Why is no real title available?)
• scientific article; zbMATH DE number 3002291 (Why is no real title available?)
• scientific article; zbMATH DE number 1391661 (Why is no real title available?)
• A constant-factor approximation algorithm for vertex guarding a WV-polygon
• Approximation algorithms for art gallery problems in polygons
• Billiards in polygons
• Billiards in polygons
• Computational complexity of art gallery problems
• Diffuse reflection diameter in simple polygons
• Ergodicity of billiard flows and quadratic differentials
• How to extend visibility polygons by mirrors to cover invisible segments
• Improved approximation for guarding simple galleries from the perimeter
• Irrational guards are sometimes needed
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Modern Optics
• Polygonal Rooms Not Illuminable from Every Point
• Principles of Optics
• Some NP-hard polygon decomposition problems
• The art gallery problem is \(\exists \mathbb{R}\)-complete
• Visibility extension via mirror-edges to cover invisible segments
• Visibility of a simple polygon
• Visibility with multiple reflections
• Visibility with one reflection

Cited in

(2)

• Visibility extension via reflection
• Guarding galleries and terrains

This page was built for publication: Reflective guarding a gallery

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