A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions
International Colloquium on Automata, Languages and Programming
We study how to dynamize the Trapezoidal Search Tree (TST) - 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. The dynamization carries over to the Trapezoidal Search DAG (TSD), which has linear size and logarithmic point location costs with high probability. On a set S of non-crossing segments, each TST updatedoi:10.4230/lipics.icalp.2020.18 dblp:conf/icalp/BrankovicGRS20 fatcat:woagkpcu5vfxzmgifanvk5sgqa