Evanthia Papadopoulou

From MaRDI portal
Person:261373

Available identifiers

zbMath Open papadopoulou.evanthiaDBLP93/4868WikidataQ103126309 ScholiaQ103126309MaRDI QIDQ261373

List of research outcomes





PublicationDate of PublicationType
Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions2024-10-25Paper
Abstract Voronoi-like graphs: extending Delaunay's theorem and applications2024-10-16Paper
Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition)2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61475312024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60520392023-09-20Paper
Deletion in abstract Voronoi diagrams in expected linear time and related problems2023-05-12Paper
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon2023-05-08Paper
https://portal.mardi4nfdi.de/entity/Q58756302023-02-03Paper
k-pairs non-crossing shortest paths in a simple polygon2023-01-25Paper
Farthest color Voronoi diagrams: complexity and algorithms2022-10-13Paper
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree2022-08-04Paper
Deletion in Abstract Voronoi Diagrams in Expected Linear Time.2020-08-18Paper
On selecting leaves with disjoint neighborhoods in embedded trees2019-10-10Paper
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended2019-06-06Paper
Stabbing circles for sets of segments in the plane2018-04-11Paper
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended2017-10-23Paper
A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters2016-12-21Paper
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams2016-11-14Paper
Stabbing circles for sets of segments in the plane2016-05-03Paper
The higher-order Voronoi diagram of line segments2016-03-23Paper
Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures2016-01-11Paper
The L∞ Hausdorff Voronoi Diagram Revisited2015-11-03Paper
The higher order Hausdorff Voronoi diagram and VLSI critical area extraction for via-blocks2015-09-30Paper
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams2015-09-11Paper
On the complexity of higher order abstract Voronoi diagrams2015-07-27Paper
The \(k\)-nearest-neighbor Voronoi diagram revisited2015-05-26Paper
Computing the map of geometric minimal cuts2014-12-02Paper
On the farthest line-segment Voronoi diagram2014-12-01Paper
Implementing the \(L _{ \infty }\) segment Voronoi diagram in CGAL and applying in VLSI pattern analysis2014-09-08Paper
A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters2014-03-31Paper
Map of geometric minimal cuts for general planar embedding2013-12-10Paper
On the complexity of higher order abstract Voronoi diagrams2013-08-06Paper
On higher order Voronoi diagrams of line segments2013-03-21Paper
On the Farthest Line-Segment Voronoi Diagram2013-03-21Paper
An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram2011-09-16Paper
On the Hausdorff Voronoi diagram of point clusters in the plane.2010-04-20Paper
Robustness of \(k\)-gon Voronoi diagram construction2009-12-18Paper
Computing the Map of Geometric Minimal Cuts2009-12-17Paper
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction2008-05-27Paper
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH2005-12-09Paper
THE L VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS2005-06-10Paper
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON2005-06-10Paper
The Hausdorff Voronoi diagram of point clusters in the plane2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44278722003-09-14Paper
SKEW VORONOI DIAGRAMS2000-05-07Paper

Research outcomes over time

This page was built for person: Evanthia Papadopoulou