The following pages link to Evanthia Papadopoulou (Q261373):
Displayed 40 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- The Hausdorff Voronoi diagram of point clusters in the plane (Q1882526) (← links)
- Farthest color Voronoi diagrams: complexity and algorithms (Q2081623) (← links)
- On selecting a fraction of leaves with disjoint neighborhoods in a plane tree (Q2161244) (← links)
- On selecting leaves with disjoint neighborhoods in embedded trees (Q2326573) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
- Stabbing Circles for Sets of Segments in the Plane (Q2802948) (← links)
- Map of Geometric Minimal Cuts for General Planar Embedding (Q2867123) (← links)
- Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis (Q2879122) (← links)
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM (Q2932519) (← links)
- A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
- (Q2948438) (← links)
- An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram (Q3092218) (← links)
- The L∞ Hausdorff Voronoi Diagram Revisited (Q3449121) (← links)
- Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures (Q3459879) (← links)
- Computing the Map of Geometric Minimal Cuts (Q3652210) (← links)
- (Q4427872) (← links)
- THE L<sub>∞</sub> VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS (Q4682157) (← links)
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198) (← links)
- On Higher Order Voronoi Diagrams of Line Segments (Q4909534) (← links)
- On the Farthest Line-Segment Voronoi Diagram (Q4909535) (← links)
- SKEW VORONOI DIAGRAMS (Q4949988) (← links)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
- On the Complexity of Higher Order Abstract Voronoi Diagrams (Q5326562) (← links)
- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction (Q5387806) (← links)
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH (Q5711095) (← links)
- (Q5875630) (← links)
- Algorithms and Data Structures (Q5900774) (← links)
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended (Q5920154) (← links)
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended (Q5971177) (← links)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)
- (Q6052039) (← links)
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (Q6102304) (← links)
- (Q6147531) (← links)