Coverage with \(k\)-transmitters in the presence of obstacles
From MaRDI portal
Publication:1944388
DOI10.1007/s10878-012-9475-xzbMath1288.90069OpenAlexW2085562535MaRDI QIDQ1944388
Ryuhei Uehara, John Iacono, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Anna Lubiw, Nadia Benbernou, Prosenjit Bose, Pat Morin, Diane L. Souvaine, Brad Ballinger, Ferran Hurtado, Vera Sacristán, Vida Dujmović
Publication date: 25 March 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9475-x
Related Items (max. 100)
Guarding monotone art galleries with sliding cameras in linear time ⋮ Modem illumination of monotone polygons ⋮ Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation ⋮ A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon ⋮ Computing the \(k\)-visibility region of a point in a polygon ⋮ Covering orthogonal polygons with sliding \(k\)-transmitters
Cites Work
- Unnamed Item
- Unnamed Item
- On \(k\)-convex polygons
- On cyclic colorings and their generalizations
- Guarding rectangular art galleries
- A combinatorial theorem in plane geometry
- Modem illumination of monotone polygons
- A new bound on the cyclic chromatic number
- Further Results on Bar k-Visibility Graphs
- Improved Bounds for Wireless Localization
- Guard placement for efficient point-in-polygon proofs
- Computational complexity of art gallery problems
- Every Planar Map is Four Colorable
- A new proof of the 6 color theorem
- Parameters of Bar k-Visibility Graphs
- Intersecting convex sets by rays
- Graph Drawing
This page was built for publication: Coverage with \(k\)-transmitters in the presence of obstacles
