Expected asymptotically optimal planar point location

John Iacono

    Research output: Contribution to journalArticle

    Abstract

    Given a fixed distribution of point location queries among the triangles in a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time. The data structure is a simple variation of Kirkpatrick's classic planar point location structure [D.G. Kirkpatrick, SIAM J. Comput. 12 (1) (1983) 28-35], and has linear construction costs and space requirements.

    Original languageEnglish (US)
    Pages (from-to)19-22
    Number of pages4
    JournalComputational Geometry: Theory and Applications
    Volume29
    Issue number1
    DOIs
    StatePublished - Sep 2004

    Fingerprint

    Point Location
    Asymptotically Optimal
    Data structures
    Data Structures
    Query
    Triangulation
    Triangle
    Multiplicative
    Entropy
    Requirements
    Costs

    Keywords

    • Distribution-sensitive data structures
    • Point location

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Computer Science Applications
    • Computational Mathematics
    • Control and Optimization
    • Geometry and Topology

    Cite this

    Expected asymptotically optimal planar point location. / Iacono, John.

    In: Computational Geometry: Theory and Applications, Vol. 29, No. 1, 09.2004, p. 19-22.

    Research output: Contribution to journalArticle

    @article{8b09e3f591314fd4a188a872647dde00,
    title = "Expected asymptotically optimal planar point location",
    abstract = "Given a fixed distribution of point location queries among the triangles in a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time. The data structure is a simple variation of Kirkpatrick's classic planar point location structure [D.G. Kirkpatrick, SIAM J. Comput. 12 (1) (1983) 28-35], and has linear construction costs and space requirements.",
    keywords = "Distribution-sensitive data structures, Point location",
    author = "John Iacono",
    year = "2004",
    month = "9",
    doi = "10.1016/j.comgeo.2004.03.010",
    language = "English (US)",
    volume = "29",
    pages = "19--22",
    journal = "Computational Geometry: Theory and Applications",
    issn = "0925-7721",
    publisher = "Elsevier",
    number = "1",

    }

    TY - JOUR

    T1 - Expected asymptotically optimal planar point location

    AU - Iacono, John

    PY - 2004/9

    Y1 - 2004/9

    N2 - Given a fixed distribution of point location queries among the triangles in a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time. The data structure is a simple variation of Kirkpatrick's classic planar point location structure [D.G. Kirkpatrick, SIAM J. Comput. 12 (1) (1983) 28-35], and has linear construction costs and space requirements.

    AB - Given a fixed distribution of point location queries among the triangles in a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time. The data structure is a simple variation of Kirkpatrick's classic planar point location structure [D.G. Kirkpatrick, SIAM J. Comput. 12 (1) (1983) 28-35], and has linear construction costs and space requirements.

    KW - Distribution-sensitive data structures

    KW - Point location

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

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

    U2 - 10.1016/j.comgeo.2004.03.010

    DO - 10.1016/j.comgeo.2004.03.010

    M3 - Article

    VL - 29

    SP - 19

    EP - 22

    JO - Computational Geometry: Theory and Applications

    JF - Computational Geometry: Theory and Applications

    SN - 0925-7721

    IS - 1

    ER -