3 citations · 4 across the 5 of their papers we have counts for
3 papers · 1 filter
Dynamic smooth compressed quadtrees (Fullversion)
Ivor Hoog v. d., Elena Khramtcova, Maarten Löffler
We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with worst-case constant time updates in constant dimensions. We distinguish two versions of the problem. First,…
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
Elena Arseneva, Man-Kwun Chiu, Matias Korman +5
We study the computation of the diameter and radius under the rectilinear link distance within a rectilinear polygonal domain of vertices and holes. We introduce a \emph{gr…
Searching edges in the overlap of two plane graphs
John Iacono, Elena Khramtcova, Stefan Langerman
Consider a pair of plane straight-line graphs, whose edges are colored red and blue, respectively, and let n be the total complexity of both graphs. We present a O(n log n)-time O(…