| Publication | Date of Publication | Type |
|---|
| Computational geometry and discrete computations | 2024-07-05 | Paper |
| Covering families of triangles | 2023-10-04 | Paper |
| Optimal line bipartitions of point sets | 2023-01-25 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 2023-01-25 | Paper |
| Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers | 2023-01-18 | Paper |
| Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075759 | 2022-05-11 | Paper |
| Randomized incremental construction of Delaunay triangulations of nice point sets | 2021-07-02 | Paper |
| Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs | 2020-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115798 | 2020-08-18 | Paper |
| Rounding meshes in 3D | 2020-06-16 | Paper |
| Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity | 2020-02-05 | Paper |
| Simple and Efficient Distribution-Sensitive Point Location in Triangulations | 2019-09-12 | Paper |
| Canonical Ordering for Graphs on the Cylinder with Applications to Periodic Straight-line Drawings on the Flat Cylinder and Torus | 2019-02-27 | Paper |
| Array-based Compact Data Structures for Triangulations: Practical Solutions with Theoretical Guarantees | 2019-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560223 | 2018-12-10 | Paper |
| Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path | 2018-11-26 | Paper |
| Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation | 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 | 2017-10-20 | Paper |
| On the smoothed complexity of convex hulls | 2017-10-10 | Paper |
| Walking in a triangulation | 2017-09-29 | Paper |
| Inner and outer rounding of set operations on lattice polygonal regions | 2017-09-29 | Paper |
| The number of lines tangent to arbitrary convex polyhedra in 3D | 2017-09-29 | Paper |
| Triangulations in CGAL (extended abstract) | 2017-09-29 | Paper |
| Algebraic methods and arithmetic filtering for exact predicates on circle arcs | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2970458 | 2017-03-30 | Paper |
| The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$ | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2970468 | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968075 | 2017-03-09 | Paper |
| Hyperbolic Delaunay complexes and Voronoi diagrams made practical | 2017-03-09 | Paper |
| Monotone Simultaneous Embeddings of Paths in d Dimensions | 2017-02-21 | Paper |
| Efficiently navigating a random Delaunay triangulation | 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 | 2016-05-26 | Paper |
| Efficiently navigating a random Delaunay triangulation | 2016-03-01 | Paper |
| Homological reconstruction and simplification in \(\mathbb{R}^3\) | 2015-07-27 | Paper |
| Complexity analysis of random geometric structures made simpler | 2015-02-17 | Paper |
| Homological reconstruction and simplification in R 3 | 2015-02-17 | Paper |
| Hyperbolic delaunay complexes and voronoi diagrams made practical | 2015-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934705 | 2014-12-18 | Paper |
| Recognizing Shrinkable Complexes Is NP-Complete | 2014-10-08 | Paper |
| The monotonicity of \(f\)-vectors of random polytopes | 2014-09-22 | Paper |
| A pedagogic JavaScript program for point location strategies | 2014-03-24 | Paper |
| Practical distribution-sensitive point location in triangulations | 2014-02-19 | Paper |
| Vertex Deletion for 3D Delaunay Triangulations | 2013-09-17 | Paper |
| Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings | 2013-04-03 | Paper |
| Oja centers and centers of gravity | 2012-12-04 | Paper |
| A tight bound for the Delaunay triangulation of points on a polyhedron | 2012-08-13 | Paper |
| Catalog-based representation of 2D triangulations | 2012-06-20 | Paper |
| Explicit Array-Based Compact Data Structures for Triangulations | 2011-12-16 | Paper |
| On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\) | 2011-03-22 | Paper |
| 2D Centroidal Voronoi Tessellations with Constraints | 2011-02-05 | Paper |
| Perturbations for Delaunay and weighted Delaunay 3D triangulations | 2011-01-21 | Paper |
| Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization | 2011-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579508 | 2010-08-06 | Paper |
| Helly-type theorems for approximate covering | 2009-08-27 | Paper |
| On the complexity of umbra and penumbra | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602883 | 2009-02-12 | Paper |
| Predicates for line transversals to lines and line segments in three-dimensional space | 2009-02-12 | Paper |
| Helly-type theorems for approximate covering | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601554 | 2009-02-10 | Paper |
| Drawing Kn in Three Dimensions with One Bend per Edge | 2009-01-19 | Paper |
| Succinct representations of planar maps | 2008-12-12 | Paper |
| MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT | 2008-05-14 | Paper |
| Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra | 2008-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442555 | 2008-02-22 | Paper |
| Lines tangent to four triangles in three-dimensional space | 2007-04-26 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Inner and outer rounding of Boolean operations on lattice polygonal regions | 2005-12-05 | Paper |
| Centroidal Voronoi diagrams for isotropic surface remeshing | 2005-08-03 | Paper |
| WALKING IN A TRIANGULATION | 2005-06-22 | Paper |
| THE DELAUNAY HIERARCHY | 2005-06-22 | Paper |
| THE SHUFFLING BUFFER | 2005-06-10 | Paper |
| COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS | 2005-06-10 | Paper |
| Culling a Set of Points for Roundness or Cylindricity Evaluations | 2004-09-29 | Paper |
| ON DELETION IN DELAUNAY TRIANGULATIONS | 2004-09-29 | Paper |
| COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND | 2004-09-29 | Paper |
| MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471313 | 2004-07-28 | Paper |
| The number of cylindrical shells | 2004-07-07 | Paper |
| The Expected Number of 3D Visibility Events Is Linear | 2004-01-08 | Paper |
| Chromatic variants of the Erdős--Szekeres theorem on points in convex position. | 2003-10-14 | Paper |
| Circular cylinders through four or five points in space | 2003-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796184 | 2003-03-02 | Paper |
| Splitting a Delaunay triangulation in linear time | 2002-12-01 | Paper |
| Rounding Voronoi diagram | 2002-07-15 | Paper |
| Triangulations in CGAL | 2002-06-24 | Paper |
| Algebraic methods and arithmetic filtering for exact predicates on circle arcs | 2002-06-24 | Paper |
| Circular separability of polygons | 2002-05-14 | Paper |
| Dog Bites Postman | 2000-11-07 | Paper |
| OPTIMAL LINE BIPARTITIONS OF POINT SETS | 2000-11-07 | Paper |
| Motion Planning of Legged Robots | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948734 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952661 | 2000-05-10 | Paper |
| Removing degeneracies by perturbing the problem or perturbing the world | 2000-03-22 | Paper |
| Convex tours of bounded curvature | 2000-01-17 | Paper |
| Further results on arithmetic filters for geometric predicates | 1999-11-23 | Paper |
| A probabilistic analysis of the power of arithmetic filters | 1999-05-18 | Paper |
| Checking the convexity of polytopes and the planarity of subdivisions | 1999-04-11 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 1998-11-11 | Paper |
| SCALABLE ALGORITHMS FOR BICHROMATIC LINE SEGMENT INTERSECTION PROBLEMS ON COARSE GRAINED MULTICOMPUTERS | 1997-10-05 | Paper |
| Evaluating signs of determinants using single-precision arithmetic | 1997-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848585 | 1997-04-23 | Paper |
| Queries on Voronoi diagrams on moving points | 1997-03-03 | Paper |
| Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas | 1997-02-28 | Paper |
| An introduction to randomization in computational geometry | 1997-02-27 | Paper |
| An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886057 | 1996-08-22 | Paper |
| OUTPUT SENSITIVE CONSTRUCTION OF THE DELAUNAY TRIANGULATION OF POINTS LYING IN TWO PLANES | 1996-06-04 | Paper |
| MOTION PLANNING OF LEGGED ROBOTS: THE SPIDER ROBOT PROBLEM | 1996-02-26 | Paper |
| SIMULTANEOUS CONTAINMENT OF SEVERAL POLYGONS: ANALYSIS OF THE CONTACT CONFIGURATIONS | 1994-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139120 | 1993-12-07 | Paper |
| A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037406 | 1993-05-18 | Paper |
| Fully dynamic Delaunay triangulation in logarithmic expected per operation | 1993-01-17 | Paper |
| RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS | 1993-01-16 | Paper |
| Applications of random sampling to on-line algorithms in computational geometry | 1992-09-27 | Paper |
| COMPUTING THE UNION OF 3-COLORED TRIANGLES | 1992-06-27 | Paper |
