The number of holes in the union of translates of a convex set in three dimensions

Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc

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

    Abstract

    We show that the union of n translates of a convex body in ℝ3 can have Θ(n3) holes in the worst case, where a hole in a set X is a connected component of ℝ3 \ X. This refutes a 20-year-old conjecture. As a consequence, we also obtain improved lower bounds on the complexity of motion planning problems and of Voronoi diagrams with convex distance functions.

    Original languageEnglish (US)
    Title of host publication32nd International Symposium on Computational Geometry, SoCG 2016
    PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
    Pages10.1-10.16
    Volume51
    ISBN (Electronic)9783959770095
    DOIs
    StatePublished - Jun 1 2016
    Event32nd International Symposium on Computational Geometry, SoCG 2016 - Boston, United States
    Duration: Jun 14 2016Jun 17 2016

    Other

    Other32nd International Symposium on Computational Geometry, SoCG 2016
    CountryUnited States
    CityBoston
    Period6/14/166/17/16

    Fingerprint

    Motion planning

    Keywords

    • Convex sets
    • Motion planning
    • Union complexity

    ASJC Scopus subject areas

    • Software

    Cite this

    Aronov, B., Cheong, O., Dobbins, M. G., & Goaoc, X. (2016). The number of holes in the union of translates of a convex set in three dimensions. In 32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 10.1-10.16). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.10

    The number of holes in the union of translates of a convex set in three dimensions. / Aronov, Boris; Cheong, Otfried; Dobbins, Michael Gene; Goaoc, Xavier.

    32nd International Symposium on Computational Geometry, SoCG 2016. Vol. 51 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. p. 10.1-10.16.

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

    Aronov, B, Cheong, O, Dobbins, MG & Goaoc, X 2016, The number of holes in the union of translates of a convex set in three dimensions. in 32nd International Symposium on Computational Geometry, SoCG 2016. vol. 51, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 10.1-10.16, 32nd International Symposium on Computational Geometry, SoCG 2016, Boston, United States, 6/14/16. https://doi.org/10.4230/LIPIcs.SoCG.2016.10
    Aronov B, Cheong O, Dobbins MG, Goaoc X. The number of holes in the union of translates of a convex set in three dimensions. In 32nd International Symposium on Computational Geometry, SoCG 2016. Vol. 51. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. p. 10.1-10.16 https://doi.org/10.4230/LIPIcs.SoCG.2016.10
    Aronov, Boris ; Cheong, Otfried ; Dobbins, Michael Gene ; Goaoc, Xavier. / The number of holes in the union of translates of a convex set in three dimensions. 32nd International Symposium on Computational Geometry, SoCG 2016. Vol. 51 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. pp. 10.1-10.16
    @inproceedings{61ef6ffd9ea64d01ad2bde8b91ac10f5,
    title = "The number of holes in the union of translates of a convex set in three dimensions",
    abstract = "We show that the union of n translates of a convex body in ℝ3 can have Θ(n3) holes in the worst case, where a hole in a set X is a connected component of ℝ3 \ X. This refutes a 20-year-old conjecture. As a consequence, we also obtain improved lower bounds on the complexity of motion planning problems and of Voronoi diagrams with convex distance functions.",
    keywords = "Convex sets, Motion planning, Union complexity",
    author = "Boris Aronov and Otfried Cheong and Dobbins, {Michael Gene} and Xavier Goaoc",
    year = "2016",
    month = "6",
    day = "1",
    doi = "10.4230/LIPIcs.SoCG.2016.10",
    language = "English (US)",
    volume = "51",
    pages = "10.1--10.16",
    booktitle = "32nd International Symposium on Computational Geometry, SoCG 2016",
    publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

    }

    TY - GEN

    T1 - The number of holes in the union of translates of a convex set in three dimensions

    AU - Aronov, Boris

    AU - Cheong, Otfried

    AU - Dobbins, Michael Gene

    AU - Goaoc, Xavier

    PY - 2016/6/1

    Y1 - 2016/6/1

    N2 - We show that the union of n translates of a convex body in ℝ3 can have Θ(n3) holes in the worst case, where a hole in a set X is a connected component of ℝ3 \ X. This refutes a 20-year-old conjecture. As a consequence, we also obtain improved lower bounds on the complexity of motion planning problems and of Voronoi diagrams with convex distance functions.

    AB - We show that the union of n translates of a convex body in ℝ3 can have Θ(n3) holes in the worst case, where a hole in a set X is a connected component of ℝ3 \ X. This refutes a 20-year-old conjecture. As a consequence, we also obtain improved lower bounds on the complexity of motion planning problems and of Voronoi diagrams with convex distance functions.

    KW - Convex sets

    KW - Motion planning

    KW - Union complexity

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

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

    U2 - 10.4230/LIPIcs.SoCG.2016.10

    DO - 10.4230/LIPIcs.SoCG.2016.10

    M3 - Conference contribution

    VL - 51

    SP - 10.1-10.16

    BT - 32nd International Symposium on Computational Geometry, SoCG 2016

    PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

    ER -