Selecting distances in the plane

Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri

    Research output: Contribution to journalArticle

    Abstract

    We present a randomized algorithm for computing the kth smallest distance in a set of n points in the plane, based on the parametric search technique of Megiddo [Mel]. The expected running time of our algorithm is O(n4/3 log8/3n). The algorithm can also be made deterministic, using a more complicated technique, with only a slight increase in its running time. A much simpler deterministic version of our procedure runs in time O(n3/2 log5/2n). All versions improve the previously best-known upper bound of O(@#@ n9/5 log4/5n) by Chazelle [Ch]. A simple O(n log n)-time algorithm for computing an approximation of the median distance is also presented.

    Original languageEnglish (US)
    Pages (from-to)495-514
    Number of pages20
    JournalAlgorithmica (New York)
    Volume9
    Issue number5
    DOIs
    StatePublished - May 1993

    Fingerprint

    Parametric Search
    Computing
    Randomized Algorithms
    Upper bound
    Approximation

    Keywords

    • Arrangements
    • Parametric search
    • Random-sampling

    ASJC Scopus subject areas

    • Applied Mathematics
    • Safety, Risk, Reliability and Quality
    • Software
    • Computer Graphics and Computer-Aided Design

    Cite this

    Agarwal, P. K., Aronov, B., Sharir, M., & Suri, S. (1993). Selecting distances in the plane. Algorithmica (New York), 9(5), 495-514. https://doi.org/10.1007/BF01187037

    Selecting distances in the plane. / Agarwal, Pankaj K.; Aronov, Boris; Sharir, Micha; Suri, Subhash.

    In: Algorithmica (New York), Vol. 9, No. 5, 05.1993, p. 495-514.

    Research output: Contribution to journalArticle

    Agarwal, PK, Aronov, B, Sharir, M & Suri, S 1993, 'Selecting distances in the plane', Algorithmica (New York), vol. 9, no. 5, pp. 495-514. https://doi.org/10.1007/BF01187037
    Agarwal PK, Aronov B, Sharir M, Suri S. Selecting distances in the plane. Algorithmica (New York). 1993 May;9(5):495-514. https://doi.org/10.1007/BF01187037
    Agarwal, Pankaj K. ; Aronov, Boris ; Sharir, Micha ; Suri, Subhash. / Selecting distances in the plane. In: Algorithmica (New York). 1993 ; Vol. 9, No. 5. pp. 495-514.
    @article{99777df86da546439a10be2fb2f15a18,
    title = "Selecting distances in the plane",
    abstract = "We present a randomized algorithm for computing the kth smallest distance in a set of n points in the plane, based on the parametric search technique of Megiddo [Mel]. The expected running time of our algorithm is O(n4/3 log8/3n). The algorithm can also be made deterministic, using a more complicated technique, with only a slight increase in its running time. A much simpler deterministic version of our procedure runs in time O(n3/2 log5/2n). All versions improve the previously best-known upper bound of O(@#@ n9/5 log4/5n) by Chazelle [Ch]. A simple O(n log n)-time algorithm for computing an approximation of the median distance is also presented.",
    keywords = "Arrangements, Parametric search, Random-sampling",
    author = "Agarwal, {Pankaj K.} and Boris Aronov and Micha Sharir and Subhash Suri",
    year = "1993",
    month = "5",
    doi = "10.1007/BF01187037",
    language = "English (US)",
    volume = "9",
    pages = "495--514",
    journal = "Algorithmica",
    issn = "0178-4617",
    publisher = "Springer New York",
    number = "5",

    }

    TY - JOUR

    T1 - Selecting distances in the plane

    AU - Agarwal, Pankaj K.

    AU - Aronov, Boris

    AU - Sharir, Micha

    AU - Suri, Subhash

    PY - 1993/5

    Y1 - 1993/5

    N2 - We present a randomized algorithm for computing the kth smallest distance in a set of n points in the plane, based on the parametric search technique of Megiddo [Mel]. The expected running time of our algorithm is O(n4/3 log8/3n). The algorithm can also be made deterministic, using a more complicated technique, with only a slight increase in its running time. A much simpler deterministic version of our procedure runs in time O(n3/2 log5/2n). All versions improve the previously best-known upper bound of O(@#@ n9/5 log4/5n) by Chazelle [Ch]. A simple O(n log n)-time algorithm for computing an approximation of the median distance is also presented.

    AB - We present a randomized algorithm for computing the kth smallest distance in a set of n points in the plane, based on the parametric search technique of Megiddo [Mel]. The expected running time of our algorithm is O(n4/3 log8/3n). The algorithm can also be made deterministic, using a more complicated technique, with only a slight increase in its running time. A much simpler deterministic version of our procedure runs in time O(n3/2 log5/2n). All versions improve the previously best-known upper bound of O(@#@ n9/5 log4/5n) by Chazelle [Ch]. A simple O(n log n)-time algorithm for computing an approximation of the median distance is also presented.

    KW - Arrangements

    KW - Parametric search

    KW - Random-sampling

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

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

    U2 - 10.1007/BF01187037

    DO - 10.1007/BF01187037

    M3 - Article

    VL - 9

    SP - 495

    EP - 514

    JO - Algorithmica

    JF - Algorithmica

    SN - 0178-4617

    IS - 5

    ER -