| Publication | Date of Publication | Type |
|---|
| Shortest coordinated motion for square robots | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147360 | 2024-01-15 | Paper |
| Throwing a sofa through the window | 2023-12-21 | Paper |
| Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead | 2023-10-31 | Paper |
| Multi-robot motion planning for unit discs with revolving areas | 2023-07-31 | Paper |
| Space-aware reconfiguration | 2023-05-12 | Paper |
| On the number of regular vertices of the union of Jordan regions | 2022-12-09 | Paper |
| Area Optimal Polygonization Using Simulated Annealing | 2022-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088955 | 2022-07-18 | Paper |
| The maximum-level vertex in an arrangement of lines | 2022-03-21 | Paper |
| Space-Aware Reconfiguration | 2021-09-20 | Paper |
| Optimized Synthesis of Snapping Fixtures | 2021-09-20 | Paper |
| Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications | 2019-09-11 | Paper |
| Efficient maintenance and self-collision testing for Kinematic Chains | 2018-11-23 | Paper |
| Improved construction of vertical decompositions of three-dimensional arrangements | 2018-11-23 | Paper |
| Exact Minkowski sums of polygons with holes | 2018-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606351 | 2018-03-02 | Paper |
| Dynamic maintenance of molecular surfaces under conformational changes | 2017-10-20 | Paper |
| The visibility--voronoi complex and its applications | 2017-10-20 | Paper |
| The 2-center problem with obstacles | 2017-09-29 | Paper |
| Controlled perturbation for arrangements of circles | 2017-09-29 | Paper |
| Continuous path verification in multi-axis NC-machining | 2017-09-29 | Paper |
| Optimal randomized incremental construction for guaranteed logarithmic planar point location | 2016-11-14 | Paper |
| New perspective on sampling-based motion planning via random geometric graphs | 2016-02-17 | Paper |
| Exact Minkowski sums of polygons with holes | 2015-11-19 | Paper |
| The Offset Filtration of Convex Objects | 2015-11-19 | Paper |
| Motion planning via manifold samples | 2015-03-23 | Paper |
| An experimental study of point location in planar arrangements in CGAL | 2014-04-01 | Paper |
| Deconstructing approximate offsets | 2014-03-24 | Paper |
| Deconstructing approximate offsets | 2013-01-11 | Paper |
| Lines through Segments in 3D Space | 2012-09-25 | Paper |
| Improved Implementation of Point Location in General Two-Dimensional Subdivisions | 2012-09-25 | Paper |
| Motion planning via manifold samples | 2011-09-16 | Paper |
| Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners | 2011-08-04 | Paper |
| Exact and efficient construction of Minkowski sums of convex polyhedra with applications | 2011-03-04 | Paper |
| Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact | 2011-03-02 | Paper |
| Arrangements on parametric surfaces. I: General framework and infrastructure | 2011-02-19 | Paper |
| Arrangements on parametric surfaces. II: Concretizations and applications | 2011-02-19 | Paper |
| CGAL Arrangements and their applications. A step-by-step guide | 2011-02-16 | Paper |
| Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space | 2010-11-08 | Paper |
| Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space | 2010-11-02 | Paper |
| Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic | 2010-09-14 | Paper |
| Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space | 2010-09-06 | Paper |
| Planning Near-Optimal Corridors Amidst Obstacles | 2010-06-02 | Paper |
| On the exact maximum complexity of Minkowski sums of polytopes | 2009-12-14 | Paper |
| On the exact maximum complexity of Minkowski sums of convex polyhedra | 2009-02-12 | Paper |
| The complexity of the outer face in arrangements of random segments | 2009-02-12 | Paper |
| Arrangements of geodesic arcs on the sphere | 2009-02-12 | Paper |
| Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space | 2009-02-12 | Paper |
| Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step | 2008-09-25 | Paper |
| Advanced programming techniques applied to CGAL's arrangement package | 2007-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292189 | 2007-06-19 | Paper |
| The visibility-Voronoi complex and its applications | 2007-03-12 | Paper |
| An intersection-sensitive algorithm for snap rounding | 2007-02-19 | Paper |
| CONTINUOUS PATH VERIFICATION IN MULTI-AXIS NC-MACHINING | 2005-09-29 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| The design and implementation of panar maps in CGAL | 2005-08-04 | Paper |
| AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE | 2005-03-30 | Paper |
| CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES | 2004-11-01 | Paper |
| Speeding up the incremental construction of the union of geometric objects in practice. | 2004-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749763 | 2003-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411384 | 2003-07-08 | Paper |
| Iterated snap rounding | 2003-03-10 | Paper |
| On the number of regular vertices of the union of Jordan regions | 2002-11-04 | Paper |
| The 2-Center Problem with Obstacles | 2002-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547793 | 2002-08-21 | Paper |
| Polygon decomposition for efficient construction of Minkowski sums | 2002-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753919 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499951 | 2000-11-26 | Paper |
| Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250208 | 2000-06-21 | Paper |
| A general framework for assembly planning: The motion space approach | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401031 | 1999-11-08 | Paper |
| On the area bisectors of a polygon | 1999-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401011 | 1999-03-02 | Paper |
| Spheres, molecules, and hidden surface removal | 1998-12-21 | Paper |
| A perturbation scheme for spherical arrangements with application to molecular modeling | 1998-09-28 | Paper |
| Combinatorial complexity of translating a box in polyhedral 3-space | 1998-08-30 | Paper |
| Reaching a goal with directional uncertainty | 1997-02-28 | Paper |
| A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment | 1996-10-13 | Paper |
| Almost tight upper bounds for the single cell and zone problems in the three dimensions | 1996-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875176 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848610 | 1996-03-27 | Paper |
| Vertical decompositions for triangles in 3-space | 1996-02-13 | Paper |
| New bounds for lower envelopes in three dimensions, with applications to visibility in terrains | 1995-08-27 | Paper |
| Vertical decomposition of arrangements of hyperplanes in four dimensions | 1995-08-13 | Paper |
| Arrangements of segments that share endpoints: Single face results | 1995-07-02 | Paper |
| Robot motion planning and the single cell problem in arrangements | 1995-04-20 | Paper |
| Efficient ray shooting and hidden surface removal | 1994-08-10 | Paper |
| Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines | 1994-08-03 | Paper |
| On the complexity of a single cell in certain arrangements of surfaces related to motion planning | 1994-07-28 | Paper |
| The complexity of the free space for a robot moving amidst fat obstacles | 1994-02-17 | Paper |
| Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom | 1992-09-27 | Paper |
| On disjoint concave chains in arrangements of (pseudo) lines | 1992-06-28 | Paper |
| Efficient Motion Planning for an L-Shaped Object | 1992-06-28 | Paper |
