| Publication | Date of Publication | Type |
|---|
Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
Discrete & Computational Geometry | 2024-10-25 | Paper |
| Abstract Voronoi-like graphs: extending Delaunay's theorem and applications | 2024-10-16 | Paper |
| Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition) | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788603 (Why is no real title available?) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7740860 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Deletion in abstract Voronoi diagrams in expected linear time and related problems
Discrete & Computational Geometry | 2023-05-12 | Paper |
Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| scientific article; zbMATH DE number 7650295 (Why is no real title available?) | 2023-02-03 | Paper |
| k-pairs non-crossing shortest paths in a simple polygon | 2023-01-25 | 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
Discrete Applied Mathematics | 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
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
Stabbing circles for sets of segments in the plane
Algorithmica | 2018-04-11 | Paper |
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
Lecture Notes in Computer Science | 2017-10-23 | Paper |
A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters
Algorithmica | 2016-12-21 | Paper |
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
Computational Geometry | 2016-11-14 | Paper |
Stabbing circles for sets of segments in the plane
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
The higher-order Voronoi diagram of line segments
Algorithmica | 2016-03-23 | Paper |
Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
Algorithms and Computation | 2016-01-11 | Paper |
The L∞ Hausdorff Voronoi Diagram Revisited
International Journal of Computational Geometry & Applications | 2015-11-03 | Paper |
| The higher order Hausdorff Voronoi diagram and VLSI critical area extraction for via-blocks | 2015-09-30 | Paper |
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
Algorithms and Computation | 2015-09-11 | Paper |
On the complexity of higher order abstract Voronoi diagrams
Computational Geometry | 2015-07-27 | Paper |
The \(k\)-nearest-neighbor Voronoi diagram revisited
Algorithmica | 2015-05-26 | Paper |
Computing the map of geometric minimal cuts
Algorithmica | 2014-12-02 | Paper |
On the farthest line-segment Voronoi diagram
International Journal of Computational Geometry & Applications | 2014-12-01 | Paper |
Implementing the \(L _{ \infty }\) segment Voronoi diagram in CGAL and applying in VLSI pattern analysis
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Map of geometric minimal cuts for general planar embedding
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
On the complexity of higher order abstract Voronoi diagrams
Automata, Languages, and Programming | 2013-08-06 | Paper |
On higher order Voronoi diagrams of line segments
Algorithms and Computation | 2013-03-21 | Paper |
On the Farthest Line-Segment Voronoi Diagram
Algorithms and Computation | 2013-03-21 | Paper |
An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On the Hausdorff Voronoi diagram of point clusters in the plane.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Robustness of \(k\)-gon Voronoi diagram construction
Information Processing Letters | 2009-12-18 | Paper |
Computing the Map of Geometric Minimal Cuts
Algorithms and Computation | 2009-12-17 | Paper |
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
Algorithms and Computation | 2008-05-27 | Paper |
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
International Journal of Computational Geometry & Applications | 2005-12-09 | Paper |
THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
The Hausdorff Voronoi diagram of point clusters in the plane
Algorithmica | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 1979526 (Why is no real title available?) | 2003-09-14 | Paper |
SKEW VORONOI DIAGRAMS
International Journal of Computational Geometry & Applications | 2000-05-07 | Paper |
