Distinct distances in three and higher dimensions

Boris Aronov, János Pach, Micha Sharir, Gábor Tardos

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

    Abstract

    Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is Ω(n77/141-ε) = Ω(n0.546), for any ε > 0. Moreover, there always exists a point p ∈ P from which there are at least these many distinct distances to the remaining elements of P. The same result holds for points on the three-dimensional sphere. As a consequence, we obtain analogous results in higher dimensions.

    Original languageEnglish (US)
    Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
    Pages541-546
    Number of pages6
    StatePublished - 2003
    Event35th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States
    Duration: Jun 9 2003Jun 11 2003

    Other

    Other35th Annual ACM Symposium on Theory of Computing
    CountryUnited States
    CitySan Diego, CA
    Period6/9/036/11/03

    Keywords

    • Distinct distances
    • Incidences
    • Point configurations

    ASJC Scopus subject areas

    • Software

    Cite this

    Aronov, B., Pach, J., Sharir, M., & Tardos, G. (2003). Distinct distances in three and higher dimensions. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 541-546)

    Distinct distances in three and higher dimensions. / Aronov, Boris; Pach, János; Sharir, Micha; Tardos, Gábor.

    Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. p. 541-546.

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

    Aronov, B, Pach, J, Sharir, M & Tardos, G 2003, Distinct distances in three and higher dimensions. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. pp. 541-546, 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, United States, 6/9/03.
    Aronov B, Pach J, Sharir M, Tardos G. Distinct distances in three and higher dimensions. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. p. 541-546
    Aronov, Boris ; Pach, János ; Sharir, Micha ; Tardos, Gábor. / Distinct distances in three and higher dimensions. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. pp. 541-546
    @inproceedings{9422302550fd44378e60990e9187b33f,
    title = "Distinct distances in three and higher dimensions",
    abstract = "Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is Ω(n77/141-ε) = Ω(n0.546), for any ε > 0. Moreover, there always exists a point p ∈ P from which there are at least these many distinct distances to the remaining elements of P. The same result holds for points on the three-dimensional sphere. As a consequence, we obtain analogous results in higher dimensions.",
    keywords = "Distinct distances, Incidences, Point configurations",
    author = "Boris Aronov and J{\'a}nos Pach and Micha Sharir and G{\'a}bor Tardos",
    year = "2003",
    language = "English (US)",
    pages = "541--546",
    booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

    }

    TY - GEN

    T1 - Distinct distances in three and higher dimensions

    AU - Aronov, Boris

    AU - Pach, János

    AU - Sharir, Micha

    AU - Tardos, Gábor

    PY - 2003

    Y1 - 2003

    N2 - Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is Ω(n77/141-ε) = Ω(n0.546), for any ε > 0. Moreover, there always exists a point p ∈ P from which there are at least these many distinct distances to the remaining elements of P. The same result holds for points on the three-dimensional sphere. As a consequence, we obtain analogous results in higher dimensions.

    AB - Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is Ω(n77/141-ε) = Ω(n0.546), for any ε > 0. Moreover, there always exists a point p ∈ P from which there are at least these many distinct distances to the remaining elements of P. The same result holds for points on the three-dimensional sphere. As a consequence, we obtain analogous results in higher dimensions.

    KW - Distinct distances

    KW - Incidences

    KW - Point configurations

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

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

    M3 - Conference contribution

    AN - SCOPUS:0038107574

    SP - 541

    EP - 546

    BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

    ER -