Optimal planar point location

John Iacono

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

    Abstract

    Given a fixed distribution of point location queries among the regions of 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.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
    Pages340-341
    Number of pages2
    StatePublished - 2001
    Event2001 Operating Section Proceedings, American Gas Association - Dallas, TX, United States
    Duration: Apr 30 2001May 1 2001

    Other

    Other2001 Operating Section Proceedings, American Gas Association
    CountryUnited States
    CityDallas, TX
    Period4/30/015/1/01

    Fingerprint

    Point Location
    Query
    Triangulation
    Data structures
    Multiplicative
    Data Structures
    Entropy

    Keywords

    • Algorithms
    • Theory

    ASJC Scopus subject areas

    • Software
    • Mathematics(all)

    Cite this

    Iacono, J. (2001). Optimal planar point location. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 340-341)

    Optimal planar point location. / Iacono, John.

    Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. p. 340-341.

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

    Iacono, J 2001, Optimal planar point location. in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 340-341, 2001 Operating Section Proceedings, American Gas Association, Dallas, TX, United States, 4/30/01.
    Iacono J. Optimal planar point location. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. p. 340-341
    Iacono, John. / Optimal planar point location. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 2001. pp. 340-341
    @inproceedings{3ea99c72a0db4407a57c4d0052b91e00,
    title = "Optimal planar point location",
    abstract = "Given a fixed distribution of point location queries among the regions of 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.",
    keywords = "Algorithms, Theory",
    author = "John Iacono",
    year = "2001",
    language = "English (US)",
    isbn = "0898714907",
    pages = "340--341",
    booktitle = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms",

    }

    TY - GEN

    T1 - Optimal planar point location

    AU - Iacono, John

    PY - 2001

    Y1 - 2001

    N2 - Given a fixed distribution of point location queries among the regions of 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.

    AB - Given a fixed distribution of point location queries among the regions of 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.

    KW - Algorithms

    KW - Theory

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

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

    M3 - Conference contribution

    SN - 0898714907

    SP - 340

    EP - 341

    BT - Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms

    ER -