| Publication | Date of Publication | Type |
|---|
| Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves | 2021-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115798 | 2020-08-18 | Paper |
| Rounding meshes in 3D | 2020-06-16 | Paper |
| Corrigendum to ``On the edge-length ratio of outerplanar graphs | 2020-01-16 | Paper |
| On the edge-length ratio of outerplanar graphs | 2019-05-02 | Paper |
| On the edge-length ratio of outerplanar graphs | 2019-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560223 | 2018-12-10 | Paper |
| Analysis of farthest point sampling for approximating geodesics in a graph | 2018-01-19 | Paper |
| On the topology of planar algebraic curves | 2017-10-20 | Paper |
| Near-optimal parameterization of the intersection of quadrics | 2017-09-29 | Paper |
| The number of lines tangent to arbitrary convex polyhedra in 3D | 2017-09-29 | Paper |
| Intersecting quadrics | 2017-09-29 | Paper |
| Silhouette of a random polytope | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2970458 | 2017-03-30 | Paper |
| Bivariate triangular decompositions in the presence of asymptotes | 2017-02-24 | Paper |
| Monotone Simultaneous Embeddings of Paths in d Dimensions | 2017-02-21 | Paper |
| Rational univariate representations of bivariate systems and applications | 2017-02-10 | Paper |
| Separating linear forms for bivariate systems | 2017-02-10 | Paper |
| Solving bivariate systems using rational univariate representations | 2016-10-17 | Paper |
| Improved algorithm for computing separating linear forms for bivariate systems | 2015-11-11 | Paper |
| Separating linear forms and rational univariate representations of bivariate systems | 2014-12-09 | Paper |
| Recognizing Shrinkable Complexes Is NP-Complete | 2014-10-08 | Paper |
| Universal Point Sets for Drawing Planar Graphs with Circular Arcs | 2014-06-10 | Paper |
| On the complexity of sets of free lines and line segments among balls in three dimensions | 2014-04-03 | Paper |
| Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization | 2013-07-24 | Paper |
| On point-sets that support planar graphs | 2012-10-12 | Paper |
| On the complexity of sets of free lines and line segments among balls in three dimensions | 2012-05-22 | Paper |
| On Point-Sets That Support Planar Graphs | 2012-03-09 | Paper |
| Farthest-polygon Voronoi diagrams | 2011-03-25 | Paper |
| A SUCCINCT 3D VISIBILITY SKELETON | 2011-03-25 | Paper |
| On the topology of real algebraic plane curves | 2011-02-19 | Paper |
| On the Computation of 3D Visibility Skeletons | 2010-07-20 | Paper |
| Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices | 2010-03-04 | Paper |
| Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time | 2009-11-16 | Paper |
| The Voronoi diagram of three lines | 2009-07-06 | Paper |
| On the complexity of umbra and penumbra | 2009-06-30 | Paper |
| On the degree of standard geometric predicates for line transversals in 3D | 2009-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602882 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602883 | 2009-02-12 | Paper |
| Walking your dog in the woods in polynomial time | 2009-02-12 | Paper |
| Predicates for line transversals to lines and line segments in three-dimensional space | 2009-02-12 | Paper |
| Drawing Kn in Three Dimensions with One Bend per Edge | 2009-01-19 | Paper |
| An upper bound on the average size of silhouettes | 2008-12-02 | Paper |
| Near-optimal parameterization of the intersection of quadrics. I. The generic algorithm | 2008-11-18 | Paper |
| Near-optimal parameterization of the intersection of quadrics. II. A classification of pencils | 2008-11-18 | Paper |
| Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections | 2008-11-18 | Paper |
| Farthest-Polygon Voronoi Diagrams | 2008-09-25 | Paper |
| PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING | 2008-05-14 | Paper |
| ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX | 2008-05-14 | Paper |
| Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra | 2008-04-22 | Paper |
| Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices | 2008-03-25 | Paper |
| Throwing Stones Inside Simple Polygons | 2008-01-04 | Paper |
| Lines tangent to four triangles in three-dimensional space | 2007-04-26 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Intersecting quadrics: an efficient and exact implementation | 2006-10-10 | Paper |
| Common tangents to spheres in \(\mathbb R^{3}\) | 2006-03-21 | Paper |
| Transversals to line segments in three-dimensional space | 2005-11-10 | Paper |
| A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles | 2004-09-29 | Paper |
| The Expected Number of 3D Visibility Events Is Linear | 2004-01-08 | Paper |
| Curvature-Constrained Shortest Paths in a Convex Polygon | 2003-01-05 | Paper |
| An algorithm for computing a convex and simple path of bounded curvature in a simple polygon | 2002-09-25 | Paper |
| A note on reconfiguring tree linkages: Trees can lock | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511242 | 2000-10-30 | Paper |
| Motion Planning of Legged Robots | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848585 | 1997-04-23 | Paper |
