| Publication | Date of Publication | Type |
|---|
| A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square | 2023-12-04 | Paper |
| Inserting one edge into a simple drawing is hard | 2023-03-09 | Paper |
| Inserting one edge into a simple drawing is hard | 2022-12-21 | Paper |
| Four results on randomized incremental constructions | 2022-08-18 | Paper |
| A tail estimate for Mulmuley's segment intersection algorithm | 2019-12-04 | Paper |
| On the exact computation of the topology of real algebraic curves | 2017-10-20 | Paper |
| Counting triangulations and other crossing-free structures approximately | 2015-04-27 | Paper |
| A simple aggregative algorithm for counting triangulations of planar point sets and related problems | 2015-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417706 | 2014-05-22 | Paper |
| Convex hulls of spheres and convex hulls of disjoint convex polytopes | 2013-04-29 | Paper |
| Can Nearest Neighbor Searching Be Simple and Always Fast? | 2011-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077021 | 2011-02-21 | Paper |
| Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons | 2010-07-28 | Paper |
| Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices | 2010-01-29 | Paper |
| Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric | 2009-11-16 | Paper |
| Maintaining Ideally Distributed Random Search Trees without Extra Space | 2009-11-12 | Paper |
| On the complexity of umbra and penumbra | 2009-06-30 | Paper |
| On the Number of Cycles in Planar Graphs | 2009-03-06 | Paper |
| On Computing the Centroid of the Vertices of an Arrangement and Related Problems | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602883 | 2009-02-12 | Paper |
| On the all-pairs-shortest-path problem in unweighted undirected graphs. | 2008-12-21 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| MAXIMIZING A VORONOI REGION: THE CONVEX CASE | 2005-11-29 | Paper |
| Top-Down Analysis of Path Compression | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471671 | 2004-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427882 | 2003-09-14 | Paper |
| A better upper bound on the number of triangulations of a planar point set | 2003-05-27 | Paper |
| On the Exact Worst Case Query Complexity of Planar Point Location | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250230 | 1999-06-17 | Paper |
| Note on the number of triangulations of planar point sets | 1999-05-18 | Paper |
| Checking geometric programs or verification of geometric structures | 1999-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401009 | 1998-08-02 | Paper |
| How good are convex hull algorithms? | 1997-12-08 | Paper |
| The upper bound theorem for polytopes: An easy proof of its asymptotic version | 1995-10-29 | Paper |
| Selecting Heavily Covered Points | 1995-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138743 | 1993-11-11 | Paper |
| Four results on randomized incremental constructions | 1993-11-01 | Paper |
| On compatible triangulations of simple polygons | 1993-08-23 | Paper |
| On the Zone Theorem for Hyperplane Arrangements | 1993-05-17 | Paper |
| Counting and cutting cycles of lines and rods in space | 1992-09-27 | Paper |
| On the difficulty of triangulating three-dimensional nonconvex polyhedra | 1992-06-28 | Paper |
| Arrangements of curves in the plane --- topology, combinatorics, and algorithms | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974990 | 1992-06-26 | Paper |
| Small-dimensional linear programming and convex hulls made easy | 1992-06-25 | Paper |
| A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons | 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 |
| Computing the link center of a simple polygon | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795219 | 1988-01-01 | Paper |
| Computing convolutions by reciprocal search | 1987-01-01 | Paper |
| Voronoi diagrams and arrangements | 1986-01-01 | Paper |
| The Ultimate Planar Convex Hull Algorithm? | 1986-01-01 | Paper |
| Constructing Arrangements of Lines and Hyperplanes with Applications | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716335 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716336 | 1985-01-01 | Paper |
| Some methods of computational geometry applied to computer graphics | 1984-01-01 | Paper |
| On the shape of a set of points in the plane | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323309 | 1982-01-01 | Paper |
