The dispersive art gallery problem
From MaRDI portal
Publication:6092310
DOI10.1016/j.comgeo.2023.102054arXiv2209.10291OpenAlexW4387266525MaRDI QIDQ6092310
Christian Scheffer, Christian Rieck
Publication date: 23 November 2023
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.10291
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dispersion in disks
- The art gallery theorem for polyominoes
- Computational complexity of the chromatic art gallery problem for orthogonal polygons
- An alternative proof of the rectilinear art gallery theorem
- Analytical models for locating undesirable facilities
- A short proof of Chvatal's Watchman Theorem
- Illumination of polygons with vertex lights
- Illumination by floodlights
- A combinatorial theorem in plane geometry
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
- Dispersing points on intervals
- Systems of distant representatives
- Maximum dispersion and geometric maximum weight cliques
- Conflict-free chromatic art gallery coverage
- Approximation Algorithms for Dispersion Problems
- Terrain Guarding is NP-Hard
- Traditional Galleries Require Fewer Watchmen
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Approximation algorithms for spreading points
- Computational complexity of art gallery problems
- The Floodlight Problem
- Illumination of Orthogonal Polygons with Orthogonal Floodlights
- Irrational Guards are Sometimes Needed
- Improved bounds for the conflict-free chromatic art gallery problem
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
- The Art Gallery Problem is ∃ℝ-complete
- Orthogonal Terrain Guarding is NP-complete
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- Guarding polyominoes
- Algorithms and Computation
- Approximation of geometric dispersion problems
This page was built for publication: The dispersive art gallery problem
