Distribution-sensitive point location in convex subdivisions

Sébastien Collette, Vida Dujmović, John Iacono, Stefan Langerman, Pat Morin

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

    Abstract

    A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that differs from the optimal one by only lower order terms in the linear comparison tree model.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms
    Pages912-921
    Number of pages10
    StatePublished - 2008
    Event19th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, United States
    Duration: Jan 20 2008Jan 22 2008

    Other

    Other19th Annual ACM-SIAM Symposium on Discrete Algorithms
    CountryUnited States
    CitySan Francisco, CA
    Period1/20/081/22/08

    Fingerprint

    Point Location
    Subdivision
    Data structures
    Data Structures
    Query
    Term
    Model

    ASJC Scopus subject areas

    • Software
    • Mathematics(all)

    Cite this

    Collette, S., Dujmović, V., Iacono, J., Langerman, S., & Morin, P. (2008). Distribution-sensitive point location in convex subdivisions. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 912-921)

    Distribution-sensitive point location in convex subdivisions. / Collette, Sébastien; Dujmović, Vida; Iacono, John; Langerman, Stefan; Morin, Pat.

    Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. 2008. p. 912-921.

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

    Collette, S, Dujmović, V, Iacono, J, Langerman, S & Morin, P 2008, Distribution-sensitive point location in convex subdivisions. in Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 912-921, 19th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, United States, 1/20/08.
    Collette S, Dujmović V, Iacono J, Langerman S, Morin P. Distribution-sensitive point location in convex subdivisions. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. 2008. p. 912-921
    Collette, Sébastien ; Dujmović, Vida ; Iacono, John ; Langerman, Stefan ; Morin, Pat. / Distribution-sensitive point location in convex subdivisions. Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. 2008. pp. 912-921
    @inproceedings{ec255b7ac6f04545a7aa8f4e68baefcd,
    title = "Distribution-sensitive point location in convex subdivisions",
    abstract = "A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that differs from the optimal one by only lower order terms in the linear comparison tree model.",
    author = "S{\'e}bastien Collette and Vida Dujmović and John Iacono and Stefan Langerman and Pat Morin",
    year = "2008",
    language = "English (US)",
    isbn = "9780898716474",
    pages = "912--921",
    booktitle = "Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms",

    }

    TY - GEN

    T1 - Distribution-sensitive point location in convex subdivisions

    AU - Collette, Sébastien

    AU - Dujmović, Vida

    AU - Iacono, John

    AU - Langerman, Stefan

    AU - Morin, Pat

    PY - 2008

    Y1 - 2008

    N2 - A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that differs from the optimal one by only lower order terms in the linear comparison tree model.

    AB - A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that differs from the optimal one by only lower order terms in the linear comparison tree model.

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

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

    M3 - Conference contribution

    SN - 9780898716474

    SP - 912

    EP - 921

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

    ER -