4 citations · 11 across the 9 of their papers we have counts for
13 papers · 1 filter
A Collapse Process for Farthest Voronoi Diagrams of Lines in Three Dimensions
Evanthia Papadopoulou, Martin Suderland, Zeyu Wang
We study a \emph{collapse process} to construct the farthest Voronoi diagram of lines in three dimensions, given a spherical map of the diagram's unbounded features. The collapse p…
Abstract Color Voronoi Diagrams and Circular Sequences of Color Permutations
Sang Won Bae, Nicolau Oliver, Evanthia Papadopoulou
Abstract Voronoi diagrams are defined in terms of a given system of planar bisecting curves satisfying some simple combinatorial properties. They offer a unifying framework for a w…
The Voronoi Diagram of Four Lines in
Evanthia Papadopoulou, Zeyu Wang
We consider the Voronoi diagram of lines in under the Euclidean metric, and give a full classification of its structure in the base case of four lines in general pos…
Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework
Sang Won Bae, Nicolau Oliver, Evanthia Papadopoulou
Given a set of colored sites, each associated with a distance-to-site function , we consider two distance-to-color function…
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou
We present a generalization of a combinatorial result by Aggarwal, Guibas, Saxe and Shor [Discrete & Computational Geometry, 1989] on a linear-time algorithm that selects a constan…
The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination
Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou +3
We study the Voronoi Diagram of Rotating Rays, a Voronoi structure where the input sites are rays and the distance function between a point and a site/ray, is the counterclockwise…
Abstract Voronoi-like Graphs: Extending Delaunay's Theorem and Applications
Evanthia Papadopoulou
Any system of bisectors (in the sense of abstract Voronoi diagrams) defines an arrangement of simple curves in the plane. We define Voronoi-like graphs on such an arrangement, whic…
Deletion in abstract Voronoi diagrams in expected linear time and related problems
Kolja Junginger, Evanthia Papadopoulou
Updating an abstract Voronoi diagram after deletion of one site in linear time has been a well-known open problem; similarly, for concrete Voronoi diagrams of non-point sites. In t…
Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters
Elena Khramtcova, Evanthia Papadopoulou
This paper applies the randomized incremental construction (RIC) framework to computing the Hausdorff Voronoi diagram of a family of k clusters of points in the plane. The total nu…
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…
The Higher-Order Voronoi Diagram of Line Segments
Evanthia Papadopoulou, Maksym Zavershynskyi
Surprisingly, the order- Voronoi diagram of line segments had received no attention in the computational-geometry literature. It illustrates properties surprisingly different fr…
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…