Quickly placing a point to maximize angles

Boris Aronov, Mark Yagnatinsky

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

    Abstract

    Given a set P of n points in the plane in general position, and a set of non-crossing segments with endpoints in P, we seek to place a new point q such that the constrained Delaunay triangulation of P ∪ {q} has the largest possible minimum angle. The expected running time of our (randomized) algorithm is O(n2 log n) on any input, improving the near-cubic time of the best previously known algorithm. Our algorithm is somewhat complex, and along the way we develop a simpler cubic-time algorithm quite different from the ones already known.

    Original languageEnglish (US)
    Title of host publication26th Canadian Conference on Computational Geometry, CCCG 2014
    PublisherCanadian Conference on Computational Geometry
    Pages395-400
    Number of pages6
    StatePublished - 2014
    Event26th Canadian Conference on Computational Geometry, CCCG 2014 - Halifax, Canada
    Duration: Aug 11 2014Aug 13 2014

    Other

    Other26th Canadian Conference on Computational Geometry, CCCG 2014
    CountryCanada
    CityHalifax
    Period8/11/148/13/14

    Fingerprint

    Maximise
    Angle
    Constrained Delaunay Triangulation
    Randomized Algorithms
    Triangulation

    ASJC Scopus subject areas

    • Geometry and Topology
    • Computational Mathematics

    Cite this

    Aronov, B., & Yagnatinsky, M. (2014). Quickly placing a point to maximize angles. In 26th Canadian Conference on Computational Geometry, CCCG 2014 (pp. 395-400). Canadian Conference on Computational Geometry.

    Quickly placing a point to maximize angles. / Aronov, Boris; Yagnatinsky, Mark.

    26th Canadian Conference on Computational Geometry, CCCG 2014. Canadian Conference on Computational Geometry, 2014. p. 395-400.

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

    Aronov, B & Yagnatinsky, M 2014, Quickly placing a point to maximize angles. in 26th Canadian Conference on Computational Geometry, CCCG 2014. Canadian Conference on Computational Geometry, pp. 395-400, 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Canada, 8/11/14.
    Aronov B, Yagnatinsky M. Quickly placing a point to maximize angles. In 26th Canadian Conference on Computational Geometry, CCCG 2014. Canadian Conference on Computational Geometry. 2014. p. 395-400
    Aronov, Boris ; Yagnatinsky, Mark. / Quickly placing a point to maximize angles. 26th Canadian Conference on Computational Geometry, CCCG 2014. Canadian Conference on Computational Geometry, 2014. pp. 395-400
    @inproceedings{243a3db90acf44998274dfc565794cc6,
    title = "Quickly placing a point to maximize angles",
    abstract = "Given a set P of n points in the plane in general position, and a set of non-crossing segments with endpoints in P, we seek to place a new point q such that the constrained Delaunay triangulation of P ∪ {q} has the largest possible minimum angle. The expected running time of our (randomized) algorithm is O(n2 log n) on any input, improving the near-cubic time of the best previously known algorithm. Our algorithm is somewhat complex, and along the way we develop a simpler cubic-time algorithm quite different from the ones already known.",
    author = "Boris Aronov and Mark Yagnatinsky",
    year = "2014",
    language = "English (US)",
    pages = "395--400",
    booktitle = "26th Canadian Conference on Computational Geometry, CCCG 2014",
    publisher = "Canadian Conference on Computational Geometry",

    }

    TY - GEN

    T1 - Quickly placing a point to maximize angles

    AU - Aronov, Boris

    AU - Yagnatinsky, Mark

    PY - 2014

    Y1 - 2014

    N2 - Given a set P of n points in the plane in general position, and a set of non-crossing segments with endpoints in P, we seek to place a new point q such that the constrained Delaunay triangulation of P ∪ {q} has the largest possible minimum angle. The expected running time of our (randomized) algorithm is O(n2 log n) on any input, improving the near-cubic time of the best previously known algorithm. Our algorithm is somewhat complex, and along the way we develop a simpler cubic-time algorithm quite different from the ones already known.

    AB - Given a set P of n points in the plane in general position, and a set of non-crossing segments with endpoints in P, we seek to place a new point q such that the constrained Delaunay triangulation of P ∪ {q} has the largest possible minimum angle. The expected running time of our (randomized) algorithm is O(n2 log n) on any input, improving the near-cubic time of the best previously known algorithm. Our algorithm is somewhat complex, and along the way we develop a simpler cubic-time algorithm quite different from the ones already known.

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

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

    M3 - Conference contribution

    SP - 395

    EP - 400

    BT - 26th Canadian Conference on Computational Geometry, CCCG 2014

    PB - Canadian Conference on Computational Geometry

    ER -