Improved Dynamic Planar Point Location

Authors:
Lars Arge;Gerth Stolting Brodal;Loukas Georgiadis
Affiliations:
University of Aarhus, Denmark;University of Aarhus, Denmark;University of Aarhus, Denmark
Venue:
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Year:
2006

Citing 0
Cited 6

Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
External memory planar point location with logarithmic updates

Proceedings of the twenty-fourth annual symposium on Computational geometry
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

ACM Transactions on Algorithms (TALG)
A faster algorithm for computing motorcycle graphs

Proceedings of the twenty-ninth annual symposium on Computational geometry
Dynamic planar point location with sub-logarithmic local updates

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop the first linear-space data structures for dynamic planar point location in general subdivisions that achieve logarithmic query time and polylogarithmic update time.