| Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition) | 0 | 0.34 | 2022 |
| Piecewise-Linear Farthest-Site Voronoi Diagrams. | 0 | 0.34 | 2021 |
| The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. | 0 | 0.34 | 2021 |
| Certified Approximation Algorithms for the Fermat Point and n-Ellipses. | 0 | 0.34 | 2021 |
| Farthest Color Voronoi Diagrams - Complexity and Algorithms. | 0 | 0.34 | 2020 |
| Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. | 0 | 0.34 | 2019 |
| Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended. | 0 | 0.34 | 2019 |
| On Selecting Leaves With Disjoint Neighborhoods In Embedded Trees | 0 | 0.34 | 2019 |
| Stabbing Circles for Sets of Segments in the Plane. | 0 | 0.34 | 2018 |
| Deletion in abstract Voronoi diagrams in expected linear time. | 0 | 0.34 | 2018 |
| Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended | 0 | 0.34 | 2016 |
| Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. | 1 | 0.38 | 2016 |
| The k-Nearest-Neighbor Voronoi Diagram Revisited | 4 | 0.44 | 2015 |
| Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. | 3 | 0.40 | 2015 |
| A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. | 2 | 0.38 | 2014 |
| Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. | 0 | 0.34 | 2014 |
| Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis. | 0 | 0.34 | 2014 |
| Computing the Map of Geometric Minimal Cuts | 3 | 0.44 | 2014 |
| The Higher-Order Voronoi Diagram of Line Segments. | 2 | 0.38 | 2014 |
| A Sweepline Algorithm for Higher Order Voronoi Diagrams | 4 | 0.44 | 2013 |
| On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions | 0 | 0.34 | 2013 |
| Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters. | 0 | 0.34 | 2013 |
| On the complexity of higher order abstract voronoi diagrams | 6 | 0.52 | 2013 |
| Map of Geometric Minimal Cuts for General Planar Embedding. | 0 | 0.34 | 2013 |
| A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. | 3 | 0.42 | 2013 |
| The L∞ (L1) Farthest Line-Segment Voronoi Diagram. | 0 | 0.34 | 2012 |
| On the Farthest Line-Segment Voronoi Diagram. | 2 | 0.39 | 2012 |
| On Higher Order Voronoi Diagrams of Line Segments. | 7 | 0.60 | 2012 |
| The Linfty Hausdorff Voronoi Diagram Revisited. | 0 | 0.34 | 2011 |
| An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. | 8 | 0.56 | 2011 |
| Higher order Voronoi diagrams of segments for VLSI critical area extraction | 2 | 0.40 | 2007 |
| Robustness of k-gon Voronoi diagram construction | 2 | 0.38 | 2006 |
| The Hausdorff Voronoi Diagram Of Polygonal Objects: A Divide And Conquer Approach | 9 | 0.59 | 2004 |
| The Hausdorff Voronoi Diagram of Point Clusters in the Plane | 9 | 0.64 | 2003 |
| The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing | 3 | 0.44 | 2002 |
| Critical Area Computation For Missing Material Defects In Vlsi Circuits | 6 | 0.53 | 2001 |
| The Linfty-Voronoi Diagram of Segments and VLSI Applications | 5 | 0.60 | 2001 |
| k-Pairs Non-Crossing Shortest Paths in a Simple Polygon | 4 | 0.43 | 1999 |
| Skew Voronoi Diagrams | 0 | 0.34 | 1999 |
| A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains | 18 | 0.97 | 1998 |
| Critical area computation—a new approach | 2 | 0.40 | 1998 |
| Voronoi diagrams for direction-sensitive distances | 1 | 0.40 | 1997 |
| Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract) | 4 | 0.48 | 1995 |
| Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices | 0 | 0.34 | 1994 |
