Evanthia Papadopoulou

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 24

Top Topics

Voronoi Diagram

Tree Structures

Top Venues

Publications

Kolja Junginger, Evanthia Papadopoulou
Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems. Discret. Comput. Geom. 69 (4) (2023)
Evanthia Papadopoulou
Abstract Voronoi-like Graphs: Extending Delaunay's Theorem and Applications. CoRR (2023)
Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. CoRR (2023)
Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Carlos Seara, Martin Suderland
The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination. CoRR (2023)
Evanthia Papadopoulou
Abstract Voronoi-Like Graphs: Extending Delaunay's Theorem and Applications. SoCG (2023)
Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. Discret. Appl. Math. 319 (2022)
Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap
Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition). SoCG (2022)
Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap
Certified Approximation Algorithms for the Fermat Point and n-Ellipses. ESA (2021)
Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland
Piecewise-Linear Farthest-Site Voronoi Diagrams. ISAAC (2021)
Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Hendrik Schrezenmaier, Carlos Seara, Martin Suderland
The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. ESA (2021)
Ioannis Mantas, Evanthia Papadopoulou, Vera Sacristán, Rodrigo I. Silveira
Farthest Color Voronoi Diagrams: Complexity and Algorithms. LATIN (2020)
Elena Arseneva, Evanthia Papadopoulou
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. J. Comb. Optim. 37 (2) (2019)
Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees. CALDAM (2019)
Gill Barequet, Evanthia Papadopoulou, Martin Suderland
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. ISAAC (2019)
Kolja Junginger, Evanthia Papadopoulou
Deletion in abstract Voronoi diagrams in expected linear time. CoRR (2018)
Kolja Junginger, Evanthia Papadopoulou
Deletion in Abstract Voronoi Diagrams in Expected Linear Time. SoCG (2018)
Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara
Stabbing Circles for Sets of Segments in the Plane. Algorithmica 80 (3) (2018)
Elena Khramtcova, Evanthia Papadopoulou
Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended. COCOON (2017)
Huck Bennett, Evanthia Papadopoulou, Chee Yap
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. Comput. Graph. Forum 35 (5) (2016)
Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams. Comput. Geom. 59 (2016)
Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. Algorithmica 76 (4) (2016)
Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara
Stabbing Circles for Sets of Segments in the Plane. LATIN (2016)
Elena Khramtcova, Evanthia Papadopoulou
Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters. CoRR (2016)
Evanthia Papadopoulou, Maksym Zavershynskyi
The Higher-Order Voronoi Diagram of Line Segments. Algorithmica 74 (1) (2016)
Chih-Hung Liu, Evanthia Papadopoulou, Der-Tsai Lee
The k-Nearest-Neighbor Voronoi Diagram Revisited. Algorithmica 71 (2) (2015)
Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
On the complexity of higher order abstract Voronoi diagrams. Comput. Geom. 48 (8) (2015)
Elena Khramtcova, Evanthia Papadopoulou
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. ISAAC (2015)
Evanthia Papadopoulou, Jinhui Xu
The L∞ Hausdorff Voronoi Diagram Revisited. Int. J. Comput. Geom. Appl. 25 (2) (2015)
Evanthia Papadopoulou, Maksym Zavershynskyi
The Higher-Order Voronoi Diagram of Line Segments. CoRR (2014)
Elena Khramtcova, Sandeep K. Dey, Evanthia Papadopoulou
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. CoRR (2014)
Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. ISAAC (2014)
Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. LATIN (2014)
Jinhui Xu, Lei Xu, Evanthia Papadopoulou
Computing the Map of Geometric Minimal Cuts. Algorithmica 68 (4) (2014)
Panagiotis Cheilaris, Sandeep Kumar Dey, Maria Gabrani, Evanthia Papadopoulou
Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis. ICMS (2014)
Evanthia Papadopoulou, Sandeep Kumar Dey
On the Farthest Line-Segment Voronoi Diagram. Int. J. Comput. Geom. Appl. 23 (6) (2013)
Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
On the Complexity of Higher Order Abstract Voronoi Diagrams. ICALP (1) (2013)
Gill Barequet, Evanthia Papadopoulou
On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions. ISVD (2013)
Maksym Zavershynskyi, Evanthia Papadopoulou
A Sweepline Algorithm for Higher Order Voronoi Diagrams. ISVD (2013)
Lei Xu, Evanthia Papadopoulou, Jinhui Xu
Map of Geometric Minimal Cuts for General Planar Embedding. COCOA (2013)
Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. CoRR (2013)
Evanthia Papadopoulou, Sandeep K. Dey
On the Farthest Line-Segment Voronoi Diagram. ISAAC (2012)
Evanthia Papadopoulou, Maksym Zavershynskyi
On Higher Order Voronoi Diagrams of Line Segments. ISAAC (2012)
Sandeep K. Dey, Evanthia Papadopoulou
) Farthest Line-Segment Voronoi Diagram. ISVD (2012)
Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. ESA (2011)
Evanthia Papadopoulou, Jinhui Xu
Hausdorff Voronoi Diagram Revisited. ISVD (2011)
Evanthia Papadopoulou
Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30 (5) (2011)
Jinhui Xu, Lei Xu, Evanthia Papadopoulou
Computing the Map of Geometric Minimal Cuts. ISAAC (2009)
Evanthia Papadopoulou
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction. ISAAC (2007)
Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
-gon Voronoi diagram construction. Inf. Process. Lett. 97 (4) (2006)
Evanthia Papadopoulou, D. T. Lee
The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach. Int. J. Comput. Geom. Appl. 14 (6) (2004)
Evanthia Papadopoulou
The Hausdorff Voronoi Diagram of Point Clusters in the Plane. Algorithmica 40 (2) (2004)
Evanthia Papadopoulou
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane. WADS (2003)
Evanthia Papadopoulou, D. T. Lee
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. ISAAC (2002)
Evanthia Papadopoulou, D. T. Lee
-Voronoi Diagram of Segments and VLSI Applications. Int. J. Comput. Geom. Appl. 11 (5) (2001)
Evanthia Papadopoulou
Critical area computation for missing material defects in VLSIcircuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20 (5) (2001)
Evanthia Papadopoulou
Critical area computation for missing material defects in VLSI circuits. ISPD (2000)
Evanthia Papadopoulou
k-Pairs Non-Crossing Shortest Paths in a Simple Polygon. Int. J. Comput. Geom. Appl. 9 (6) (1999)
Evanthia Papadopoulou, D. T. Lee
Critical area computation via Voronoi diagrams. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18 (4) (1999)
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou
Skew Voronoi Diagrams. Int. J. Comput. Geom. Appl. 9 (3) (1999)
Evanthia Papadopoulou
Voronoi Diagrams and Applications to VLSI Layout and Manufacturing. ISAAC (1998)
Evanthia Papadopoulou, D. T. Lee
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains. Algorithmica 20 (4) (1998)
Evanthia Papadopoulou, D. T. Lee
Critical area computation - a new approach. ISPD (1998)
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou
Voronoi Diagrams for Direction-Sensitive Distances. SCG (1997)
Evanthia Papadopoulou
-Pairs Non-Crossing Shortest Paths in a Simple Polygon. ISAAC (1996)
Evanthia Papadopoulou, D. T. Lee
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). ESA (1995)
Evanthia Papadopoulou, D. T. Lee
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. CCCG (1994)
D. T. Lee, Evanthia Papadopoulou
The All-Pairs Quickest Path Problem. Inf. Process. Lett. 45 (5) (1993)
Evanthia Papadopoulou, Theodore S. Papatheodorou
Least-Squares Iterative Solution on a Fixed-Size VLSI Architecture. ICS (1987)