A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions

  title={A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions},
  author={Milutin Brankovic and Nikola Grujic and Andr{\'e} van Renssen and Martin P. Seybold},
We study how to dynamize the Trapezoidal Search Tree - a well known randomized point location structure for planar subdivisions of kinetic line segments. Our approach naturally extends incremental leaf-level insertions to recursive methods and allows adaptation for the online setting. Moreover, the dynamization carries over to the Trapezoidal Search DAG, offering a linear sized data structure with logarithmic point location costs as a by-product. On a set $S$ of non-crossing segments, each… 

Figures from this paper

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
A main result is an improved tail bound, with exponential decay, for the size of the TSD: there is a constant such that the probability for a TSD to exceed its expected size by more than this factor is at most 1/e.


Dynamization of the trapezoid method for planar point location in monotone subdivisions
This is the first fully dynamic point location data structure for monotone subdivisions that achieves optimal query time, based on the trapezoid method.
Point Location in Dynamic Planar Subdivisions
A data structure of linear size is presented for such a dynamic planar subdivision that supports sublinear-time update and polylogarithmic-time query and answers a question posed by Snoeyink in the Handbook of Computational Geometry.
Towards an Optimal Method for Dynamic Planar Point Location
This is the first data structure that achieves close to logarithmic query and update time simultaneously, ignoring log logn factors, and shows how to reduce the query time to O(logn log log n) in the RAM model with randomization.
Dynamic Trees and Dynamic Point Location
This appears to be the first on-line method to achieve a polylogarithmic query time and constant update time and an improved method for spatial point location in a 3-dimensional convex subdivision.
Lower Bounds for Kinetic Planar Subdivisions
Under reasonable computational models, lower bounds on the minimum amount of work required to maintain any binary space partition of moving segments in the plane or any Steiner triangulation of moving points in the planes are obtained.
A Fast Planar Partition Algorithm, I
Dynamic Planar Point Location in External Memory
A fully-dynamic data structure for the planar point location problem in the external memory model with almost-optimal query cost, which almost matches the best known upper bound in the internal-memory model.
New results on dynamic planar point location
A point location scheme is presented for an n-vertex dynamic planar subdivision whose underlying graph is only required to be connected and extended to speed up the insertion/deletion of a k-edge monotone chain to O(log/sup 2/n log log n+k) time.