Time-space trade-offs for triangulating a simple polygon

Boris Aronov, Matias Korman, Simon Pratt, André Van Renssen, Marcel Roeloffzen

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

    Abstract

    An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s ∈ O(n). The algorithm runs in O(n2/s + n(log s) log5 (n/s)) expected time using O(s) variables, for any s ∈ O(n). In particular, when s ∈ O(n/log n log5 log n) algorithm runs in O(n2/s) expected time.

    Original languageEnglish (US)
    Title of host publication15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016
    PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
    Pages30.1-30.12
    Volume53
    ISBN (Electronic)9783959770118
    DOIs
    StatePublished - Jun 1 2016
    Event15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016 - Reykjavik, Iceland
    Duration: Jun 22 2016Jun 24 2016

    Other

    Other15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016
    CountryIceland
    CityReykjavik
    Period6/22/166/24/16

    Keywords

    • Shortest path
    • Simple polygon
    • Time-space trade-off
    • Triangulation

    ASJC Scopus subject areas

    • Software

    Cite this

    Aronov, B., Korman, M., Pratt, S., Van Renssen, A., & Roeloffzen, M. (2016). Time-space trade-offs for triangulating a simple polygon. In 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016 (Vol. 53, pp. 30.1-30.12). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SWAT.2016.30

    Time-space trade-offs for triangulating a simple polygon. / Aronov, Boris; Korman, Matias; Pratt, Simon; Van Renssen, André; Roeloffzen, Marcel.

    15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016. Vol. 53 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. p. 30.1-30.12.

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

    Aronov, B, Korman, M, Pratt, S, Van Renssen, A & Roeloffzen, M 2016, Time-space trade-offs for triangulating a simple polygon. in 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016. vol. 53, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 30.1-30.12, 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, Reykjavik, Iceland, 6/22/16. https://doi.org/10.4230/LIPIcs.SWAT.2016.30
    Aronov B, Korman M, Pratt S, Van Renssen A, Roeloffzen M. Time-space trade-offs for triangulating a simple polygon. In 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016. Vol. 53. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. p. 30.1-30.12 https://doi.org/10.4230/LIPIcs.SWAT.2016.30
    Aronov, Boris ; Korman, Matias ; Pratt, Simon ; Van Renssen, André ; Roeloffzen, Marcel. / Time-space trade-offs for triangulating a simple polygon. 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016. Vol. 53 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. pp. 30.1-30.12
    @inproceedings{53ec56c101bb49e989f4735321cfb733,
    title = "Time-space trade-offs for triangulating a simple polygon",
    abstract = "An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s ∈ O(n). The algorithm runs in O(n2/s + n(log s) log5 (n/s)) expected time using O(s) variables, for any s ∈ O(n). In particular, when s ∈ O(n/log n log5 log n) algorithm runs in O(n2/s) expected time.",
    keywords = "Shortest path, Simple polygon, Time-space trade-off, Triangulation",
    author = "Boris Aronov and Matias Korman and Simon Pratt and {Van Renssen}, Andr{\'e} and Marcel Roeloffzen",
    year = "2016",
    month = "6",
    day = "1",
    doi = "10.4230/LIPIcs.SWAT.2016.30",
    language = "English (US)",
    volume = "53",
    pages = "30.1--30.12",
    booktitle = "15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016",
    publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

    }

    TY - GEN

    T1 - Time-space trade-offs for triangulating a simple polygon

    AU - Aronov, Boris

    AU - Korman, Matias

    AU - Pratt, Simon

    AU - Van Renssen, André

    AU - Roeloffzen, Marcel

    PY - 2016/6/1

    Y1 - 2016/6/1

    N2 - An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s ∈ O(n). The algorithm runs in O(n2/s + n(log s) log5 (n/s)) expected time using O(s) variables, for any s ∈ O(n). In particular, when s ∈ O(n/log n log5 log n) algorithm runs in O(n2/s) expected time.

    AB - An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We give a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices, for any s ∈ O(n). The algorithm runs in O(n2/s + n(log s) log5 (n/s)) expected time using O(s) variables, for any s ∈ O(n). In particular, when s ∈ O(n/log n log5 log n) algorithm runs in O(n2/s) expected time.

    KW - Shortest path

    KW - Simple polygon

    KW - Time-space trade-off

    KW - Triangulation

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

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

    U2 - 10.4230/LIPIcs.SWAT.2016.30

    DO - 10.4230/LIPIcs.SWAT.2016.30

    M3 - Conference contribution

    VL - 53

    SP - 30.1-30.12

    BT - 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016

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

    ER -