| Publication | Date of Publication | Type |
|---|
| SCARST: Schnyder compact and regularity sensitive triangulation data structure | 2025-11-24 | Paper |
| Computational geometry and discrete computations | 2024-07-05 | Paper |
Covering families of triangles
Periodica Mathematica Hungarica | 2023-10-04 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 2023-01-25 | Paper |
| Optimal line bipartitions of point sets | 2023-01-25 | Paper |
Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
Lecture Notes in Computer Science | 2022-08-19 | Paper |
| scientific article; zbMATH DE number 7525459 (Why is no real title available?) | 2022-05-11 | Paper |
Randomized incremental construction of Delaunay triangulations of nice point sets
Discrete & Computational Geometry | 2021-07-02 | Paper |
Expected complexity of routing in \(\Theta_6\) and half-\(\Theta_6\) graphs
(available as arXiv preprint) | 2020-09-09 | Paper |
| 3D snap rounding | 2020-08-18 | Paper |
Rounding meshes in 3D
Discrete & Computational Geometry | 2020-06-16 | Paper |
Stretch factor in a planar Poisson-Delaunay triangulation with a large intensity
Advances in Applied Probability | 2020-02-05 | Paper |
Simple and efficient distribution-sensitive point location in triangulations
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Array-based compact data structures for triangulations: practical solutions with theoretical guarantees | 2019-02-27 | Paper |
| Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cyclinder and torus | 2019-02-27 | Paper |
| Monotone simultaneous paths embeddings in \(\mathbb{R}^d\) | 2018-12-10 | Paper |
Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation
Discrete & Computational Geometry | 2018-07-26 | Paper |
| Qualitative Symbolic Perturbation: Two Applications of a New Geometry-based Perturbation Framework | 2018-06-05 | Paper |
| Delaunay Triangulations of Points on Circles | 2018-03-30 | Paper |
| Qualitative symbolic perturbation | 2018-01-30 | Paper |
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| On the smoothed complexity of convex hulls | 2017-10-10 | Paper |
Walking in a triangulation
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Inner and outer rounding of set operations on lattice polygonal regions
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The number of lines tangent to arbitrary convex polyhedra in 3D
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Recognizing shrinkable complexes is NP-complete | 2017-03-30 | Paper |
| The worst visibility walk in a random Delaunay triangulation is O( n) | 2017-03-30 | Paper |
| Smoothed complexity of convex hulls by witnesses and collectors | 2017-03-30 | Paper |
| scientific article; zbMATH DE number 6693709 (Why is no real title available?) | 2017-03-09 | Paper |
| Hyperbolic Delaunay complexes and Voronoi diagrams made practical | 2017-03-09 | Paper |
Monotone simultaneous embeddings of paths in d dimensions
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Efficiently navigating a random Delaunay triangulation
Random Structures & Algorithms | 2016-09-07 | Paper |
| Stretch Factor of Long Paths in a planar Poisson-Delaunay Triangulation | 2016-07-19 | Paper |
Computing a single cell in the overlay of two simple polygons
Information Processing Letters | 2016-05-26 | Paper |
| Efficiently navigating a random Delaunay triangulation | 2016-03-01 | Paper |
Homological reconstruction and simplification in \(\mathbb{R}^3\)
Computational Geometry | 2015-07-27 | Paper |
Complexity analysis of random geometric structures made simpler
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Homological reconstruction and simplification in \(\mathbb{R}^3\)
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Hyperbolic Delaunay complexes and Voronoi diagrams made practical
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
| Complexity of Delaunay triangulation for points on lower-dimensional polyhedra | 2014-12-18 | Paper |
Recognizing shrinkable complexes is NP-complete
Algorithms - ESA 2014 | 2014-10-08 | Paper |
The monotonicity of f-vectors of random polytopes
Electronic Communications in Probability | 2014-09-22 | Paper |
A pedagogic JavaScript program for point location strategies
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Practical distribution-sensitive point location in triangulations
Computer Aided Geometric Design | 2014-02-19 | Paper |
Vertex deletion for 3D Delaunay triangulations
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings
Graph Drawing | 2013-04-03 | Paper |
Oja centers and centers of gravity
Computational Geometry | 2012-12-04 | Paper |
A tight bound for the Delaunay triangulation of points on a polyhedron
Discrete & Computational Geometry | 2012-08-13 | Paper |
Catalog-based representation of 2D triangulations
International Journal of Computational Geometry & Applications | 2012-06-20 | Paper |
Explicit Array-Based Compact Data Structures for Triangulations
Algorithms and Computation | 2011-12-16 | Paper |
On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\)
Operations Research Letters | 2011-03-22 | Paper |
2D centroidal Voronoi tessellations with constraints
Numerical Mathematics: Theory, Methods and Applications | 2011-02-05 | Paper |
Perturbations for Delaunay and weighted Delaunay 3D triangulations
Computational Geometry | 2011-01-21 | Paper |
Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization
Computational Geometry | 2011-01-21 | Paper |
| Empty-ellipse graphs | 2010-08-06 | Paper |
Helly-type theorems for approximate covering
Discrete & Computational Geometry | 2009-08-27 | Paper |
On the complexity of umbra and penumbra
Computational Geometry | 2009-06-30 | Paper |
| Between umbra and penumbra | 2009-02-12 | Paper |
Helly-type theorems for approximate covering
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Predicates for line transversals to lines and line segments in three-dimensional space
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506222 (Why is no real title available?) | 2009-02-10 | Paper |
Drawing Kn in Three Dimensions with One Bend per Edge
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Drawing Kn in Three Dimensions with One Bend per Edge
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Succinct representations of planar maps
Theoretical Computer Science | 2008-12-12 | Paper |
MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT
International Journal of Computational Geometry & Applications | 2008-05-14 | Paper |
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing | 2008-04-22 | Paper |
| Interleaving Delaunay refinement and optimization for 2D triangle mesh generation | 2008-02-22 | Paper |
Lines tangent to four triangles in three-dimensional space
Discrete & Computational Geometry | 2007-04-26 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Inner and outer rounding of Boolean operations on lattice polygonal regions
Computational Geometry | 2005-12-05 | Paper |
Centroidal Voronoi diagrams for isotropic surface remeshing
Graphical Models | 2005-08-03 | Paper |
WALKING IN A TRIANGULATION
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
THE DELAUNAY HIERARCHY
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
THE SHUFFLING BUFFER
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
ON DELETION IN DELAUNAY TRIANGULATIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Culling a Set of Points for Roundness or Cylindricity Evaluations
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2079354 (Why is no real title available?) | 2004-07-28 | Paper |
The number of cylindrical shells
Discrete & Computational Geometry | 2004-07-07 | Paper |
The Expected Number of 3D Visibility Events Is Linear
SIAM Journal on Computing | 2004-01-08 | Paper |
Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
Computational Geometry | 2003-10-14 | Paper |
Circular cylinders through four or five points in space
Discrete & Computational Geometry | 2003-03-17 | Paper |
| scientific article; zbMATH DE number 1875425 (Why is no real title available?) | 2003-03-02 | Paper |
Splitting a Delaunay triangulation in linear time
Algorithmica | 2002-12-01 | Paper |
Rounding Voronoi diagram
Theoretical Computer Science | 2002-07-15 | Paper |
Triangulations in CGAL
Computational Geometry | 2002-06-24 | Paper |
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Computational Geometry | 2002-06-24 | Paper |
Circular separability of polygons
Algorithmica | 2002-05-14 | Paper |
Dog Bites Postman
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
OPTIMAL LINE BIPARTITIONS OF POINT SETS
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Motion Planning of Legged Robots
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1436137 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1445344 (Why is no real title available?) | 2000-05-10 | Paper |
Removing degeneracies by perturbing the problem or perturbing the world
Reliable Computing | 2000-03-22 | Paper |
Convex tours of bounded curvature
Computational Geometry | 2000-01-17 | Paper |
Further results on arithmetic filters for geometric predicates
Computational Geometry | 1999-11-23 | Paper |
A probabilistic analysis of the power of arithmetic filters
Discrete & Computational Geometry | 1999-05-18 | Paper |
Checking the convexity of polytopes and the planarity of subdivisions
Computational Geometry | 1999-04-11 | Paper |
Computing the maximum overlap of two convex polygons under translations
Theory of Computing Systems | 1998-11-11 | Paper |
SCALABLE ALGORITHMS FOR BICHROMATIC LINE SEGMENT INTERSECTION PROBLEMS ON COARSE GRAINED MULTICOMPUTERS
International Journal of Computational Geometry & Applications | 1997-10-05 | Paper |
Evaluating signs of determinants using single-precision arithmetic
Algorithmica | 1997-06-30 | Paper |
| scientific article; zbMATH DE number 797427 (Why is no real title available?) | 1997-04-23 | Paper |
Queries on Voronoi diagrams on moving points
Computational Geometry | 1997-03-03 | Paper |
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
Information Processing Letters | 1997-02-28 | Paper |
An introduction to randomization in computational geometry
Theoretical Computer Science | 1997-02-27 | Paper |
An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
Computational Geometry | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 910883 (Why is no real title available?) | 1996-08-22 | Paper |
OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES
International Journal of Computational Geometry & Applications | 1996-06-04 | Paper |
MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM
International Journal of Computational Geometry & Applications | 1996-02-26 | Paper |
SIMULTANEOUS CONTAINMENT OF SEVERAL POLYGONS: ANALYSIS OF THE CONTACT CONFIGURATIONS
International Journal of Computational Geometry & Applications | 1994-05-26 | Paper |
| scientific article; zbMATH DE number 432983 (Why is no real title available?) | 1993-12-07 | Paper |
A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
Algorithmica | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177537 (Why is no real title available?) | 1993-05-18 | Paper |
Fully dynamic Delaunay triangulation in logarithmic expected per operation
Computational Geometry | 1993-01-17 | Paper |
RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry | 1992-09-27 | Paper |
COMPUTING THE UNION OF 3-COLORED TRIANGLES
International Journal of Computational Geometry & Applications | 1992-06-27 | Paper |
