3 citations · 4 across the 5 of their papers we have counts for
6 papers
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(…
An Expected Linear-Time Algorithm for the Farthest-Segment Voronoi Diagram
Elena Khramtcova, Evanthia Papadopoulou
We present an expected linear-time algorithm to construct the farthest-segment Voronoi diagram, given the sequence of its faces at infinity. This sequence forms a Davenport-Schinze…
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman +1
In the Hausdorff Voronoi diagram of a family of \emph{clusters of points} in the plane, the distance between a point and a cluster is measured as the maximum distance betwe…
Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters
Panagiotis Cheilaris, Elena Khramtcova, Evanthia Papadopoulou
In the Hausdorff Voronoi diagram of a set of clusters of points in the plane, the distance between a point t and a cluster P is the maximum Euclidean distance between t and a point…