| Publication | Date of Publication | Type |
|---|
| The centroid of points with approximate weights | 2023-05-08 | Paper |
| Input-sensitive compliant motion in the plane | 2022-12-09 | Paper |
| Upper envelope onion peeling | 2022-12-09 | Paper |
| Applications of a semi-dynamic convex hull algorithm | 2022-12-09 | Paper |
| Fully dynamic 2-edge-connectivity in planar graphs | 2022-12-09 | Paper |
| Convex polygons made from few lines and convex decompositions of polyhedra | 2022-12-09 | Paper |
| A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane | 2022-08-25 | Paper |
| Maintaining the extent of a moving point set | 2022-08-19 | Paper |
| Cartographic line simplication and polygon CSG formulae in O(n log* n) time | 2022-08-19 | Paper |
| Efficient breakout routing in printed circuit boards | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111738 | 2020-05-27 | Paper |
| Shortest paths in the plane with obstacle violations | 2020-05-21 | Paper |
| Two approaches to building time-windowed geometric data structures | 2019-08-20 | Paper |
| Finding the k shortest simple paths | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132872 | 2018-01-30 | Paper |
| Geometric k Shortest Paths | 2017-10-05 | Paper |
| Kinetic connectivity for unit disks | 2017-09-29 | Paper |
| Smooth kinetic maintenance of clusters | 2017-09-29 | Paper |
| Binary space partitions of orthogonal subdivisions | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365046 | 2017-09-29 | Paper |
| Hyperplane separability and convexity of probabilistic point sets | 2017-03-30 | Paper |
| Bundled Crossings in Embedded Graphs | 2016-05-03 | Paper |
| On the difficulty of some shortest path problems | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501855 | 2015-08-14 | Paper |
| Matrix searching with the shortest path metric | 2015-05-07 | Paper |
| A near-optimal algorithm for shortest paths among curved obstacles in the plane | 2015-02-17 | Paper |
| On the complexity of time-dependent shortest paths | 2014-12-02 | Paper |
| Summarizing spatial data streams using ClusterHulls | 2014-04-01 | Paper |
| Stable snap rounding | 2014-03-24 | Paper |
| Computing Shortest Paths amid Convex Pseudodisks | 2013-09-25 | Paper |
| Stable snap rounding | 2013-03-07 | Paper |
| The Union of Probabilistic Boxes: Maintaining the Volume | 2011-09-16 | Paper |
| Kinetic collision detection with fast flight plan changes | 2009-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619944 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601560 | 2009-02-10 | Paper |
| Simplified Planar Coresets for Data Streams | 2008-07-15 | Paper |
| Improved output-sensitive snap rounding | 2008-04-16 | Paper |
| Adaptive sampling for geometric problems over data streams | 2008-03-13 | Paper |
| Adaptive spatial partitioning for multidimensional data streams | 2006-10-16 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Polygonal path simplification with angle constraints | 2005-11-01 | Paper |
| Binary Space Partitions of Orthogonal Subdivisions | 2005-09-16 | Paper |
| Smooth kinetic maintenance of clusters | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471280 | 2004-07-28 | Paper |
| Kinetic collision detection between two simple polygons. | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418662 | 2003-08-11 | Paper |
| Maintaining the extent of a moving point set | 2002-07-22 | Paper |
| Kinetic connectivity for unit disks | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749774 | 2002-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768286 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768318 | 2002-01-30 | Paper |
| Morphing simple polygons | 2001-09-10 | Paper |
| Lower bounds for kinetic planar subdivisions | 2000-12-19 | Paper |
| Data Structures for Mobile Data | 1999-12-05 | Paper |
| An Optimal Algorithm for Euclidean Shortest Paths in the Plane | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252278 | 1999-06-17 | Paper |
| Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time | 1999-02-02 | Paper |
| Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) | 1998-10-01 | Paper |
| Erased arrangements of linear and convex decompositions of polyhedra | 1998-04-13 | Paper |
| Matrix Searching with the Shortest-Path Metric | 1998-02-10 | Paper |
| Off-Line Maintenance of Planar Configurations | 1997-06-03 | Paper |
| Finding a shortest diagonal of a simple polygon in linear time | 1997-05-06 | Paper |
| Efficiently Planning Compliant Motion in the Plane | 1996-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886077 | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886071 | 1996-07-28 | Paper |
| OPTIMAL PARALLEL ALGORITHMS FOR TRIANGULATED SIMPLE POLYGONS | 1996-02-26 | Paper |
| Data structures for two-edge connectivity in planar graphs | 1995-10-09 | Paper |
| A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk | 1995-07-03 | Paper |
| Selecting Heavily Covered Points | 1995-04-06 | Paper |
| APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140401 | 1994-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138890 | 1994-09-19 | 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 |
| https://portal.mardi4nfdi.de/entity/Q3138936 | 1993-10-20 | Paper |
| A faster algorithm for the two-center decision problem | 1993-10-17 | Paper |
| An efficient algorithm for finding the CSG representation of a simple polygon | 1993-09-01 | Paper |
| Computing the intersection-depth to polyhedra | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036602 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037430 | 1993-05-18 | Paper |
| Upper envelope onion peeling | 1993-01-17 | Paper |
| Minimizing the sum of diameters efficiently | 1993-01-17 | Paper |
| Applications of a semi-dynamic convex hull algorithm | 1992-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011326 | 1992-09-27 | Paper |
| A new data structure for shortest path queries in a simple polygon | 1992-06-26 | Paper |
| COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS | 1991-01-01 | Paper |
| Finding tailored partitions | 1991-01-01 | Paper |
| Finding the upper envelope of n line segments in O(n log n) time | 1989-01-01 | Paper |
| An optimal visibility graph algorithm for triangulated simple polygons | 1989-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 |
| Optimal shortest path queries in a simple polygon | 1989-01-01 | Paper |
| An O(n2) shortest path algorithm for a non-rotating convex body | 1988-01-01 | Paper |
| Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons | 1987-01-01 | Paper |
| Visibility of disjoint polygons | 1986-01-01 | Paper |
| A polynomial time algorithm for finding the prime factors of Cartesian- product graphs | 1985-01-01 | Paper |
