Coverage with k-transmitters in the presence of obstacles

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, Ryuhei Uehara

    Research output: Contribution to journalArticle

    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.

    Original languageEnglish (US)
    Pages (from-to)208-233
    Number of pages26
    JournalJournal of Combinatorial Optimization
    Volume25
    Issue number2
    DOIs
    StatePublished - 2013

    Fingerprint

    Transmitter
    Transmitters
    Coverage
    Line segment
    Broadcast
    Polygon
    Upper and Lower Bounds
    Cover
    Sufficient
    Integer
    Necessary
    Range of data

    Keywords

    • Art gallery
    • Coverage
    • Guarding
    • Transmitters
    • Visibility

    ASJC Scopus subject areas

    • Discrete Mathematics and Combinatorics
    • Applied Mathematics
    • Computational Theory and Mathematics
    • Computer Science Applications
    • Control and Optimization

    Cite this

    Ballinger, B., Benbernou, N., Bose, P., Damian, M., Demaine, E. D., Dujmović, V., ... Uehara, R. (2013). Coverage with k-transmitters in the presence of obstacles. Journal of Combinatorial Optimization, 25(2), 208-233. https://doi.org/10.1007/s10878-012-9475-x

    Coverage with k-transmitters in the presence of obstacles. / 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, Ryuhei.

    In: Journal of Combinatorial Optimization, Vol. 25, No. 2, 2013, p. 208-233.

    Research output: Contribution to journalArticle

    Ballinger, B, Benbernou, N, Bose, P, Damian, M, Demaine, ED, Dujmović, V, Flatland, R, Hurtado, F, Iacono, J, Lubiw, A, Morin, P, Sacristán, V, Souvaine, D & Uehara, R 2013, 'Coverage with k-transmitters in the presence of obstacles', Journal of Combinatorial Optimization, vol. 25, no. 2, pp. 208-233. https://doi.org/10.1007/s10878-012-9475-x
    Ballinger B, Benbernou N, Bose P, Damian M, Demaine ED, Dujmović V et al. Coverage with k-transmitters in the presence of obstacles. Journal of Combinatorial Optimization. 2013;25(2):208-233. https://doi.org/10.1007/s10878-012-9475-x
    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, Ryuhei. / Coverage with k-transmitters in the presence of obstacles. In: Journal of Combinatorial Optimization. 2013 ; Vol. 25, No. 2. pp. 208-233.
    @article{88aada3372f84a50b49bb727d23525f7,
    title = "Coverage with k-transmitters in the presence of obstacles",
    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.",
    keywords = "Art gallery, Coverage, Guarding, Transmitters, Visibility",
    author = "Brad Ballinger and Nadia Benbernou and Prosenjit Bose and Mirela Damian and Demaine, {Erik D.} and Vida Dujmović and Robin Flatland and Ferran Hurtado and John Iacono and Anna Lubiw and Pat Morin and Vera Sacrist{\'a}n and Diane Souvaine and Ryuhei Uehara",
    year = "2013",
    doi = "10.1007/s10878-012-9475-x",
    language = "English (US)",
    volume = "25",
    pages = "208--233",
    journal = "Journal of Combinatorial Optimization",
    issn = "1382-6905",
    publisher = "Springer Netherlands",
    number = "2",

    }

    TY - JOUR

    T1 - Coverage with k-transmitters in the presence of obstacles

    AU - Ballinger, Brad

    AU - Benbernou, Nadia

    AU - Bose, Prosenjit

    AU - Damian, Mirela

    AU - Demaine, Erik D.

    AU - Dujmović, Vida

    AU - Flatland, Robin

    AU - Hurtado, Ferran

    AU - Iacono, John

    AU - Lubiw, Anna

    AU - Morin, Pat

    AU - Sacristán, Vera

    AU - Souvaine, Diane

    AU - Uehara, Ryuhei

    PY - 2013

    Y1 - 2013

    N2 - 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.

    AB - 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.

    KW - Art gallery

    KW - Coverage

    KW - Guarding

    KW - Transmitters

    KW - Visibility

    UR - http://www.scopus.com/inward/record.url?scp=84879552767&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84879552767&partnerID=8YFLogxK

    U2 - 10.1007/s10878-012-9475-x

    DO - 10.1007/s10878-012-9475-x

    M3 - Article

    AN - SCOPUS:84879552767

    VL - 25

    SP - 208

    EP - 233

    JO - Journal of Combinatorial Optimization

    JF - Journal of Combinatorial Optimization

    SN - 1382-6905

    IS - 2

    ER -