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

    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.