A lower bound on Voronoi diagram complexity

Boris Aronov

    Research output: Contribution to journal › Article

    Abstract

    A lower bound on Voronoi diagram complexity is presented. The Voronoi diagram is a classification of points of the ambient space according to the identity of the closest site or sites. Results provided evidence that the bound derived from envelope analysis is closer to the truth as the conjecture of Sharir does not hold.

    Original languageEnglish (US)
    Pages (from-to)183-185
    Number of pages3
    JournalInformation Processing Letters
    Volume83
    Issue number4
    DOIs
    StatePublished - Aug 31 2002

    Fingerprint

    Voronoi Diagram
    Lower bound
    Envelope
    Evidence
    Truth

    Keywords

    • Computational complexity
    • Computational geometry
    • Voronoi diagram

    ASJC Scopus subject areas

    • Computational Theory and Mathematics

    Cite this

    A lower bound on Voronoi diagram complexity. / Aronov, Boris.

    In: Information Processing Letters, Vol. 83, No. 4, 31.08.2002, p. 183-185.

    Research output: Contribution to journal › Article

    Aronov, B 2002, 'A lower bound on Voronoi diagram complexity', Information Processing Letters, vol. 83, no. 4, pp. 183-185. https://doi.org/10.1016/S0020-0190(01)00336-2
    Aronov B. A lower bound on Voronoi diagram complexity. Information Processing Letters. 2002 Aug 31;83(4):183-185. https://doi.org/10.1016/S0020-0190(01)00336-2
    Aronov, Boris. / A lower bound on Voronoi diagram complexity. In: Information Processing Letters. 2002 ; Vol. 83, No. 4. pp. 183-185.
    @article{6382d58ceab7491593b556de08084f60,
    title = "A lower bound on Voronoi diagram complexity",
    abstract = "A lower bound on Voronoi diagram complexity is presented. The Voronoi diagram is a classification of points of the ambient space according to the identity of the closest site or sites. Results provided evidence that the bound derived from envelope analysis is closer to the truth as the conjecture of Sharir does not hold.",
    keywords = "Computational complexity, Computational geometry, Voronoi diagram",
    author = "Boris Aronov",
    year = "2002",
    month = "8",
    day = "31",
    doi = "10.1016/S0020-0190(01)00336-2",
    language = "English (US)",
    volume = "83",
    pages = "183--185",
    journal = "Information Processing Letters",
    issn = "0020-0190",
    publisher = "Elsevier",
    number = "4",

    }

    TY - JOUR

    T1 - A lower bound on Voronoi diagram complexity

    AU - Aronov, Boris

    PY - 2002/8/31

    Y1 - 2002/8/31

    N2 - A lower bound on Voronoi diagram complexity is presented. The Voronoi diagram is a classification of points of the ambient space according to the identity of the closest site or sites. Results provided evidence that the bound derived from envelope analysis is closer to the truth as the conjecture of Sharir does not hold.

    AB - A lower bound on Voronoi diagram complexity is presented. The Voronoi diagram is a classification of points of the ambient space according to the identity of the closest site or sites. Results provided evidence that the bound derived from envelope analysis is closer to the truth as the conjecture of Sharir does not hold.

    KW - Computational complexity

    KW - Computational geometry

    KW - Voronoi diagram

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

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

    U2 - 10.1016/S0020-0190(01)00336-2

    DO - 10.1016/S0020-0190(01)00336-2

    M3 - Article

    VL - 83

    SP - 183

    EP - 185

    JO - Information Processing Letters

    JF - Information Processing Letters

    SN - 0020-0190

    IS - 4

    ER -

    Access to Document