Fully Dynamic Point Location

Fully Dynamic Point Location is a computational geometry method that enables efficient point location queries in a planar subdivision subject to continuous and arbitrary insertions, deletions, and modifications of geometric elements, distinguishing it from static or incremental approaches by supporting full dynamism in both the structure and the query environment.

4

Publications

133

Citations

6

Authors

3

Institutions

Publications per year

2017–2026

1

Authors

6

  1. RT
    Roberto Tamassia

    Brown University, United States

    3 publications · 123 citations

    3

    h-index

  2. FP
    Franco P. Preparata

    University of Illinois Urbana-Champaign, United States

    1 publications · 62 citations

    1

    h-index

  3. YN
    Yakov Nekrich

    University of Kansas, United States

    1 publications · 10 citations

    1

    h-index

  4. YC
    Yi‐Jen Chiang

    New York University, United States

    1 publications · 21 citations

    1

    h-index

  5. FP
    F. P. Preparata

    University of Illinois Urbana-Champaign, United States

    1 publications · 40 citations

    1

    h-index

1–5 of 6

Institutions

3

  1. Brown University

    Providence, United States

    3 h-index

    4 publications

    144 citations

  2. University of Illinois Urbana-Champaign

    Urbana, United States

    2 h-index

    3 publications

    142 citations

  3. University of Waterloo

    Waterloo, Canada

    1 h-index

    1 publications

    10 citations

1–3 of 3

Venues

  1. SIAM Journal on Computing

    2 publications · 72 citations

    2

    h-index

  2. 1

    h-index

1–2