|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/13759
|
Title: | Coverage with k-Transmitters in the Presence of Obstacles |
Authors: | Ballinger, Brad Benbernou, Nadia Bose, Prosenjit Damian, Mirela Demaine, Erik D. Dujmović, Vida Flatland, Robin Hurtado, Ferran Iacono, John Lubiw, Anna Morin, Pat Sacristán, Vera Souvaine, Diane Uehara, Ryuuhei |
Keywords: | coverage guarding transmitters art gallery visibility |
Issue Date: | 2013-02 |
Publisher: | Springer |
Magazine name: | Journal of Combinatorial Optimization |
Volume: | 25 |
Number: | 2 |
Start page: | 208 |
End page: | 233 |
DOI: | 10.1007/s10878-012-9475-x |
Abstract: | 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. |
Rights: | This is the author-created version of Springer, Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán, Diane Souvaine, and Ryuhei Uehara, Journal of Combinatorial Optimization, 25(2), 2013, 208-233. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/s10878-012-9475-x |
URI: | http://hdl.handle.net/10119/13759 |
Material Type: | author |
Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
File |
Description |
Size | Format |
17798.pdf | | 1082Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|