| Publication | Date of Publication | Type |
|---|
| Counting and reporting red/blue segment intersections | 2023-01-18 | Paper |
| Computing common tangents without a separating line | 2022-12-16 | Paper |
| Input-sensitive compliant motion in the plane | 2022-12-09 | Paper |
| Two- and three- dimensional point location in rectangular subdivisions | 2022-12-09 | Paper |
| Convex polygons made from few lines and convex decompositions of polyhedra | 2022-12-09 | Paper |
| Cartographic line simplication and polygon CSG formulae in O(n log* n) time | 2022-08-19 | Paper |
| Linear-time reconstruction of Delaunay triangulations with applications | 2021-12-20 | Paper |
| Computation of spatial skyline points | 2021-01-07 | Paper |
| Implementing streaming simplification for large labeled meshes | 2019-09-11 | Paper |
| Testing Homotopy for paths in the plane | 2018-11-23 | Paper |
| Interlocked open linkages with few joints | 2018-11-23 | Paper |
| Bumpy pyramid folding | 2018-10-31 | Paper |
| Visibility graphs, dismantlability, and the cops and robbers game | 2018-02-12 | Paper |
| Kinetic collision detection for simple polygons | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501287 | 2015-08-03 | Paper |
| Computing planar Voronoi diagrams in double precision | 2014-04-03 | Paper |
| Fitting spheres to electron density | 2014-03-24 | Paper |
| Number of Crossing-Free Geometric Graphs vs. Triangulations | 2013-06-28 | Paper |
| Reconstructing polygons from scanner data | 2011-07-27 | Paper |
| Degree-Driven Design for Correct Geometric Algorithms | 2011-06-03 | Paper |
| Lossless compression of predicted floating-point geometry | 2011-03-04 | Paper |
| Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) | 2011-01-31 | Paper |
| Capturing crossings: convex hulls of segment and plane intersections | 2010-04-19 | Paper |
| Computation of Non-dominated Points Using Compact Voronoi Diagrams | 2010-02-09 | Paper |
| Reconstructing Polygons from Scanner Data | 2009-12-17 | Paper |
| Isocontour based Visualization of Time-varying Scalar Fields | 2009-12-11 | Paper |
| Delaunay triangulation of imprecise points in linear time after preprocessing | 2009-11-16 | Paper |
| Computing the Implicit Voronoi Diagram in Triple Precision | 2009-10-20 | Paper |
| Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree | 2009-10-16 | Paper |
| Representing Interpolant Topology for Contour Tree Computation | 2009-05-20 | Paper |
| How long can a graph be kept planar? | 2009-04-07 | Paper |
| Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams | 2009-02-12 | Paper |
| Delaunay triangulations of imprecise pointsin linear time after preprocessing | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601517 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601579 | 2009-02-10 | Paper |
| FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION | 2008-09-29 | Paper |
| Time-varying Reeb graphs for continuous space-time data | 2008-09-19 | Paper |
| Efficient algorithms for maximum regression depth | 2008-08-19 | Paper |
| Faster placement of hydrogens in protein structures by dynamic programming | 2008-06-20 | Paper |
| Delineating boundaries for imprecise regions | 2008-04-03 | Paper |
| Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL | 2007-07-04 | Paper |
| Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm | 2007-06-26 | Paper |
| Maximum independent set for intervals by divide and conquer with pruning | 2007-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5290271 | 2006-04-28 | Paper |
| THE REFLEX-FREE HULL | 2005-12-09 | Paper |
| Polygonal path simplification with angle constraints | 2005-11-01 | Paper |
| A lower bound for multicast key distribution | 2005-02-09 | Paper |
| KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS | 2004-09-29 | Paper |
| ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS | 2004-09-29 | Paper |
| Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree | 2004-09-22 | Paper |
| Testing homotopy for paths in the plane | 2004-03-11 | Paper |
| Spanning trees crossing few barriers | 2004-02-05 | Paper |
| Interlocked open and closed linkages with few joints. | 2003-07-01 | Paper |
| Spirale reversi: Reverse decoding of the edgebreaker encoding | 2003-06-03 | Paper |
| Tight degree bounds for pseudo-triangulations of points | 2003-05-19 | Paper |
| The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra | 2003-05-19 | Paper |
| Compressing the Property Mapping of Polygon Meshes | 2003-05-14 | Paper |
| Computing contour trees in all dimensions | 2003-04-28 | Paper |
| The size of spanning disks for polygonal curves | 2003-03-17 | Paper |
| Some aperture-angle optimization problems | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547813 | 2002-08-21 | Paper |
| Efficiently approximating polygonal paths in three and higher dimensions | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768318 | 2002-01-30 | Paper |
| Generalizing ham sandwich cuts to equitable subdivisions | 2001-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721993 | 2001-07-11 | Paper |
| Efficient algorithms for line and curve segment intersection using restricted predicates | 2001-04-09 | Paper |
| On exclusion regions for optimal triangulations | 2001-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761861 | 2001-02-21 | Paper |
| COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME | 2000-11-07 | Paper |
| Queries with segments in Voronoi diagrams | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952718 | 2000-05-10 | Paper |
| Removing degeneracies by perturbing the problem or perturbing the world | 2000-03-22 | Paper |
| Cross-ratios and angles determine a polygon | 1999-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252280 | 1999-06-17 | Paper |
| Finding the medial axis of a simple polygon in linear time | 1999-05-27 | Paper |
| On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time | 1999-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401020 | 1999-03-02 | Paper |
| Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time | 1999-02-02 | Paper |
| Fitting a set of points by a circle | 1998-12-02 | Paper |
| Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams | 1998-07-27 | Paper |
| Erased arrangements of linear and convex decompositions of polyhedra | 1998-04-13 | Paper |
| Optimal Algorithms to Embed Trees in a Point Set | 1998-04-01 | Paper |
| Generating random polygons with given vertices | 1997-03-03 | Paper |
| Efficiently Planning Compliant Motion in the Plane | 1996-11-26 | Paper |
| Folding rulers inside triangles | 1996-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886058 | 1996-08-22 | Paper |
| Point location in zones of \(k\)-flats in arrangements | 1996-07-14 | Paper |
| A compact piecewise-linear Voronoi diagram for convex sites in the plane | 1996-02-13 | Paper |
| Objects that cannot be taken apart with two hands | 1995-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327373 | 1995-04-05 | Paper |
| MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES | 1995-01-26 | Paper |
| APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138890 | 1994-09-19 | Paper |
| An optimal algorithm for the on-line closest-pair problem | 1994-08-10 | Paper |
| Efficient ray shooting and hidden surface removal | 1994-08-10 | Paper |
| Ray shooting in polygons using geodesic triangulations | 1994-08-10 | Paper |
| Computing minimum length paths of a given homotopy class | 1994-07-21 | Paper |
| Computing a Face in an Arrangement of Line Segments and Related Problems | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138981 | 1993-10-20 | Paper |
| An efficient algorithm for finding the CSG representation of a simple polygon | 1993-09-01 | Paper |
| Stabbing parallel segments with a convex polygon | 1993-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036602 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037430 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028889 | 1993-03-28 | Paper |
| Counting and cutting cycles of lines and rods in space | 1992-09-27 | Paper |
| COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS | 1991-01-01 | Paper |
| On arrangements of Jordan arcs with three intersections per pair | 1989-01-01 | Paper |
| Implicitly representing arrangements of lines or segments | 1989-01-01 | Paper |
