Mobile versus point guards
From MaRDI portal
Publication:1716007
DOI10.1007/s00454-018-9996-xzbMath1414.52012arXiv1706.02619OpenAlexW3101595124WikidataQ129968991 ScholiaQ129968991MaRDI QIDQ1716007
Tamás Róbert Mezei, Ervin Gyoeri
Publication date: 29 January 2019
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.02619
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem
- Cooperative mobile guards in grids
- Domination in convex and chordal bipartite graphs
- A linear-time algorithm for a special case of disjoint set union
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Generalized guarding and partitioning for rectilinear polygons
- Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
- On Guarding Orthogonal Polygons with Sliding Cameras
- GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
- Traditional Galleries Require Fewer Watchmen
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- A Short Proof of the Rectilinear Art Gallery Theorem
- Perfect Elimination and Chordal Bipartite Graphs
- LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
This page was built for publication: Mobile versus point guards
