Proximate planar point location

John Iacono, Stefan Langerman

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

    Abstract

    A new data structure is presented for planar point location that executes a point location query quickly if it is spatially near the previous query. Given a triangulation T of size n and a sequence of point location queries A = q1, . . . qm, the structure presented executes qi in time O(log d(qi-1, qi)). The distance function, d, that is used is a two dimensional generalization of rank distance that counts the number of triangles in a region from qi-1 to qi. The data structure uses O(n log log n) space.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Annual Symposium on Computational Geometry
    Pages220-226
    Number of pages7
    StatePublished - 2003
    EventNineteenth Annual Symposium on Computational Geometry - san Diego, CA, United States
    Duration: Jun 8 2003Jun 10 2003

    Other

    OtherNineteenth Annual Symposium on Computational Geometry
    CountryUnited States
    Citysan Diego, CA
    Period6/8/036/10/03

    Fingerprint

    Point Location
    Query
    Data structures
    Data Structures
    Triangulation
    Distance Function
    Triangle
    Count

    Keywords

    • Planar point location

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Geometry and Topology

    Cite this

    Iacono, J., & Langerman, S. (2003). Proximate planar point location. In Proceedings of the Annual Symposium on Computational Geometry (pp. 220-226)

    Proximate planar point location. / Iacono, John; Langerman, Stefan.

    Proceedings of the Annual Symposium on Computational Geometry. 2003. p. 220-226.

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

    Iacono, J & Langerman, S 2003, Proximate planar point location. in Proceedings of the Annual Symposium on Computational Geometry. pp. 220-226, Nineteenth Annual Symposium on Computational Geometry, san Diego, CA, United States, 6/8/03.
    Iacono J, Langerman S. Proximate planar point location. In Proceedings of the Annual Symposium on Computational Geometry. 2003. p. 220-226
    Iacono, John ; Langerman, Stefan. / Proximate planar point location. Proceedings of the Annual Symposium on Computational Geometry. 2003. pp. 220-226
    @inproceedings{22930e94c5a84d43a571e8fb865ba251,
    title = "Proximate planar point location",
    abstract = "A new data structure is presented for planar point location that executes a point location query quickly if it is spatially near the previous query. Given a triangulation T of size n and a sequence of point location queries A = q1, . . . qm, the structure presented executes qi in time O(log d(qi-1, qi)). The distance function, d, that is used is a two dimensional generalization of rank distance that counts the number of triangles in a region from qi-1 to qi. The data structure uses O(n log log n) space.",
    keywords = "Planar point location",
    author = "John Iacono and Stefan Langerman",
    year = "2003",
    language = "English (US)",
    pages = "220--226",
    booktitle = "Proceedings of the Annual Symposium on Computational Geometry",

    }

    TY - GEN

    T1 - Proximate planar point location

    AU - Iacono, John

    AU - Langerman, Stefan

    PY - 2003

    Y1 - 2003

    N2 - A new data structure is presented for planar point location that executes a point location query quickly if it is spatially near the previous query. Given a triangulation T of size n and a sequence of point location queries A = q1, . . . qm, the structure presented executes qi in time O(log d(qi-1, qi)). The distance function, d, that is used is a two dimensional generalization of rank distance that counts the number of triangles in a region from qi-1 to qi. The data structure uses O(n log log n) space.

    AB - A new data structure is presented for planar point location that executes a point location query quickly if it is spatially near the previous query. Given a triangulation T of size n and a sequence of point location queries A = q1, . . . qm, the structure presented executes qi in time O(log d(qi-1, qi)). The distance function, d, that is used is a two dimensional generalization of rank distance that counts the number of triangles in a region from qi-1 to qi. The data structure uses O(n log log n) space.

    KW - Planar point location

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

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

    M3 - Conference contribution

    AN - SCOPUS:0038038272

    SP - 220

    EP - 226

    BT - Proceedings of the Annual Symposium on Computational Geometry

    ER -