Coverage with k-transmitters in the presence of obstacles
Coverage with k-transmitters in the presence of obstacles
复制标题
DOI：
10.1007/s10878-012-9475-x
复制
发表时间：
2010-12
影响因子：
1
通讯作者：
Brad Ballinger;Nadia M. Benbernou;Prosenjit Bose;Mirela Damian;E. Demaine;V. Dujmovic;Robin Y. Flatland;Ferran Hurtado;J. Iacono;A. Lubiw;Pat Morin;Vera Sacristán Adinolfi;D. Souvaine;Ryuhei Uehara
中科院分区：
文献类型：
--
作者：
Brad Ballinger;Nadia M. Benbernou;Prosenjit Bose;Mirela Damian;E. Demaine;V. Dujmovic;Robin Y. Flatland;Ferran Hurtado;J. Iacono;A. Lubiw;Pat Morin;Vera Sacristán Adinolfi;D. Souvaine;Ryuhei Uehara
对于固定整数≥0，AK发送器是具有无限广播范围的全方位无线发送器，能够穿透到平面中的线段表示的K个“墙”。我们给出了覆盖给定的线段、多边形链和多边形集所需且足够的K-传输器数目的上下界。
For a fixed integerk≥0, ak-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up tok“walls”, represented as line segments in the plane. We develop lower and upper bounds for the number ofk-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.