An Upper Bound on the k-Modem Illumination Problem

DOI10.1142/S021819591550017XzbMath1352.68266arXiv1410.4099MaRDI QIDQ2792799

Carlos Hidalgo-Toscano, Frank Duque

Publication date: 14 March 2016

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.4099

zbMATH Keywords

art gallery problems\(k\)-modem\(k\)-transmitter

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (2)

Modem illumination of monotone polygons ⋮ Computing the \(k\)-visibility region of a point in a polygon

Cites Work

• A deterministic view of random sampling and its use in geometry

This page was built for publication: An Upper Bound on the k-Modem Illumination Problem