Coverage with

Brad Ballinger,Nadia Benbernou,Prosenjit Bose,Mirela Damian,Erik D. Demaine,Vida Dujmovic,Robin Y. Flatland,Ferran Hurtado,John Iacono,Anna Lubiw,Et Al.,Vera Sacristán,Diane Souvaine,Ryuhei Uehara

Conference on Combinatorial Optimization and Applications（2010）

引用 5|浏览63

暂无评分

摘要

For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要