Witness rectangle graphs

Boris Aronov, Muriel Dulieu, Ferran Hurtado

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x,y in P are adjacent whenever the open rectangle with x and y as opposite corners contains at least one point in W. WRGs are representative of a larger family of witness proximity graphs introduced in two previous papers. We study graph-theoretic properties of WRGs. We prove that any WRG has at most two non-trivial connected components. We bound the diameter of the non-trivial connected components of a WRG in both the one-component and two-component cases. In the latter case, we prove that a graph is representable as a WRG if and only if each component is a co-interval graph, thereby providing a complete characterization of WRGs of this type. We also completely characterize trees drawable as WRGs. Finally, we conclude with some related results on the number of points required to stab all the rectangles defined by a set of n points.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings
    Pages73-85
    Number of pages13
    Volume6844 LNCS
    DOIs
    StatePublished - 2011
    Event12th International Symposium on Algorithms and Data Structures, WADS 2011 - New York, NY, United States
    Duration: Aug 15 2011Aug 17 2011

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume6844 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other12th International Symposium on Algorithms and Data Structures, WADS 2011
    CountryUnited States
    CityNew York, NY
    Period8/15/118/17/11

    Fingerprint

    Rectangle
    Graph in graph theory
    Connected Components
    Point Sets
    Proximity Graphs
    Interval Graphs
    Adjacent
    If and only if
    Vertex of a graph

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Aronov, B., Dulieu, M., & Hurtado, F. (2011). Witness rectangle graphs. In Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings (Vol. 6844 LNCS, pp. 73-85). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6844 LNCS). https://doi.org/10.1007/978-3-642-22300-6_7

    Witness rectangle graphs. / Aronov, Boris; Dulieu, Muriel; Hurtado, Ferran.

    Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings. Vol. 6844 LNCS 2011. p. 73-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6844 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B, Dulieu, M & Hurtado, F 2011, Witness rectangle graphs. in Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings. vol. 6844 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6844 LNCS, pp. 73-85, 12th International Symposium on Algorithms and Data Structures, WADS 2011, New York, NY, United States, 8/15/11. https://doi.org/10.1007/978-3-642-22300-6_7
    Aronov B, Dulieu M, Hurtado F. Witness rectangle graphs. In Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings. Vol. 6844 LNCS. 2011. p. 73-85. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-22300-6_7
    Aronov, Boris ; Dulieu, Muriel ; Hurtado, Ferran. / Witness rectangle graphs. Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings. Vol. 6844 LNCS 2011. pp. 73-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{16dd7c6d4bfa49c08c8b64350c1d645c,
    title = "Witness rectangle graphs",
    abstract = "In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x,y in P are adjacent whenever the open rectangle with x and y as opposite corners contains at least one point in W. WRGs are representative of a larger family of witness proximity graphs introduced in two previous papers. We study graph-theoretic properties of WRGs. We prove that any WRG has at most two non-trivial connected components. We bound the diameter of the non-trivial connected components of a WRG in both the one-component and two-component cases. In the latter case, we prove that a graph is representable as a WRG if and only if each component is a co-interval graph, thereby providing a complete characterization of WRGs of this type. We also completely characterize trees drawable as WRGs. Finally, we conclude with some related results on the number of points required to stab all the rectangles defined by a set of n points.",
    author = "Boris Aronov and Muriel Dulieu and Ferran Hurtado",
    year = "2011",
    doi = "10.1007/978-3-642-22300-6_7",
    language = "English (US)",
    isbn = "9783642222993",
    volume = "6844 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "73--85",
    booktitle = "Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings",

    }

    TY - GEN

    T1 - Witness rectangle graphs

    AU - Aronov, Boris

    AU - Dulieu, Muriel

    AU - Hurtado, Ferran

    PY - 2011

    Y1 - 2011

    N2 - In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x,y in P are adjacent whenever the open rectangle with x and y as opposite corners contains at least one point in W. WRGs are representative of a larger family of witness proximity graphs introduced in two previous papers. We study graph-theoretic properties of WRGs. We prove that any WRG has at most two non-trivial connected components. We bound the diameter of the non-trivial connected components of a WRG in both the one-component and two-component cases. In the latter case, we prove that a graph is representable as a WRG if and only if each component is a co-interval graph, thereby providing a complete characterization of WRGs of this type. We also completely characterize trees drawable as WRGs. Finally, we conclude with some related results on the number of points required to stab all the rectangles defined by a set of n points.

    AB - In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x,y in P are adjacent whenever the open rectangle with x and y as opposite corners contains at least one point in W. WRGs are representative of a larger family of witness proximity graphs introduced in two previous papers. We study graph-theoretic properties of WRGs. We prove that any WRG has at most two non-trivial connected components. We bound the diameter of the non-trivial connected components of a WRG in both the one-component and two-component cases. In the latter case, we prove that a graph is representable as a WRG if and only if each component is a co-interval graph, thereby providing a complete characterization of WRGs of this type. We also completely characterize trees drawable as WRGs. Finally, we conclude with some related results on the number of points required to stab all the rectangles defined by a set of n points.

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

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

    U2 - 10.1007/978-3-642-22300-6_7

    DO - 10.1007/978-3-642-22300-6_7

    M3 - Conference contribution

    SN - 9783642222993

    VL - 6844 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 73

    EP - 85

    BT - Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings

    ER -