Evanthia Papadopoulou

Available identifiers

zbMath Open papadopoulou.evanthiaWikidataQ103126309 ScholiaQ103126309MaRDI QIDQ261373

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147531	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6052039	2023-09-20	Paper
Deletion in abstract Voronoi diagrams in expected linear time and related problems	2023-05-12	Paper
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon	2023-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q5875630	2023-02-03	Paper
Farthest color Voronoi diagrams: complexity and algorithms	2022-10-13	Paper
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree	2022-08-04	Paper
Deletion in Abstract Voronoi Diagrams in Expected Linear Time.	2020-08-18	Paper
On selecting leaves with disjoint neighborhoods in embedded trees	2019-10-10	Paper
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended	2019-06-06	Paper
Stabbing circles for sets of segments in the plane	2018-04-11	Paper
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended	2017-10-23	Paper
A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters	2016-12-21	Paper
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams	2016-11-14	Paper
Stabbing Circles for Sets of Segments in the Plane	2016-05-03	Paper
The higher-order Voronoi diagram of line segments	2016-03-23	Paper
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures	2016-01-11	Paper
The L∞ Hausdorff Voronoi Diagram Revisited	2015-11-03	Paper
https://portal.mardi4nfdi.de/entity/Q2948438	2015-09-30	Paper
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams	2015-09-11	Paper
On the complexity of higher order abstract Voronoi diagrams	2015-07-27	Paper
The \(k\)-nearest-neighbor Voronoi diagram revisited	2015-05-26	Paper
Computing the map of geometric minimal cuts	2014-12-02	Paper
ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM	2014-12-01	Paper
Implementing the L  ∞  Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis	2014-09-08	Paper
A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters	2014-03-31	Paper
Map of Geometric Minimal Cuts for General Planar Embedding	2013-12-10	Paper
On the Complexity of Higher Order Abstract Voronoi Diagrams	2013-08-06	Paper
On Higher Order Voronoi Diagrams of Line Segments	2013-03-21	Paper
On the Farthest Line-Segment Voronoi Diagram	2013-03-21	Paper
An Output-Sensitive Approach for the L 1/L  ∞  k-Nearest-Neighbor Voronoi Diagram	2011-09-16	Paper
Algorithms and Data Structures	2010-04-20	Paper
Robustness of \(k\)-gon Voronoi diagram construction	2009-12-18	Paper
Computing the Map of Geometric Minimal Cuts	2009-12-17	Paper
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction	2008-05-27	Paper
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH	2005-12-09	Paper
THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS	2005-06-10	Paper
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON	2005-06-10	Paper
The Hausdorff Voronoi diagram of point clusters in the plane	2004-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q4427872	2003-09-14	Paper
SKEW VORONOI DIAGRAMS	2000-05-07	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Evanthia Papadopoulou