| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147360 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187787 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065434 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059954 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059955 | 2023-11-02 | Paper |
| Time and space efficient collinearity indexing | 2023-01-09 | Paper |
| Visibility with multiple reflections | 2022-12-09 | Paper |
| On the number of regular vertices of the union of Jordan regions | 2022-12-09 | Paper |
| Star unfolding of a polytope with applications | 2022-12-09 | Paper |
| Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems | 2022-12-08 | Paper |
| Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model | 2022-11-16 | Paper |
| Bipartite diameter and other measures under translation | 2022-09-16 | Paper |
| Geometric pattern matching reduces to \(k\)-SUM | 2022-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088930 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089169 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090454 | 2022-07-18 | Paper |
| On β-Plurality Points in Spatial Voting Games | 2022-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002834 | 2021-07-28 | Paper |
| Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications | 2021-05-27 | Paper |
| Resolving SINR Queries in a Dynamic Setting | 2021-01-13 | Paper |
| On pseudo-disk hypergraphs | 2021-01-07 | Paper |
| Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications | 2020-12-04 | Paper |
| Eliminating depth cycles among triangles in three dimensions | 2020-10-23 | Paper |
| Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces | 2020-04-01 | Paper |
| Efficient nearest-neighbor query and clustering of planar curves | 2020-01-16 | Paper |
| Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications | 2019-10-15 | Paper |
| Segmentation of Trajectories on Non-Monotone Criteria | 2019-05-15 | Paper |
| Computing the Distance between Piecewise-Linear Bivariate Functions | 2019-05-10 | Paper |
| Batched Point Location in SINR Diagrams via Algebraic Tools | 2019-03-28 | Paper |
| More Turán-type theorems for triangles in convex point sets | 2019-03-05 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2019-01-11 | Paper |
| Incidences between points and circles in three and higher dimensions | 2018-11-23 | Paper |
| Cost prediction for ray shooting | 2018-11-23 | Paper |
| Nearest-Neighbor Searching Under Uncertainty II | 2018-11-05 | Paper |
| Computing the Distance between Piecewise-Linear Bivariate Functions | 2018-10-30 | Paper |
| Segmentation of Trajectories on Nonmonotone Criteria | 2018-10-30 | Paper |
| Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces | 2018-10-04 | Paper |
| Eliminating Depth Cycles among Triangles in Three Dimensions | 2018-07-16 | Paper |
| Time-space trade-offs for triangulating a simple polygon | 2018-06-05 | Paper |
| Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces | 2018-05-07 | Paper |
| Almost tight bounds for eliminating depth cycles in three dimensions | 2018-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132843 | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369532 | 2017-10-17 | Paper |
| A Helly-type theorem for hyperplane transversals to well-separated convex sets | 2017-09-29 | Paper |
| Cost-driven octree construction schemes | 2017-09-29 | Paper |
| On lines avoiding unit balls in three dimensions | 2017-09-29 | Paper |
| On the union of κ-round objects | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365154 | 2017-09-29 | Paper |
| Almost tight bounds for eliminating depth cycles in three dimensions | 2017-09-29 | Paper |
| The number of holes in the union of translates of a convex set in three dimensions | 2017-02-24 | Paper |
| Distance-sensitive planar point location | 2016-05-17 | Paper |
| Batched Point Location in SINR Diagrams via Algebraic Tools | 2015-10-27 | Paper |
| Efficient algorithms for bichromatic separability | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501826 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501327 | 2015-08-03 | Paper |
| Small-size ε-nets for axis-parallel rectangles and boxes | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921677 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921754 | 2014-10-13 | Paper |
| Witness rectangle graphs | 2014-09-19 | Paper |
| On the union complexity of diametral disks | 2014-08-14 | Paper |
| Improved Bounds for the Union of Locally Fat Objects in the Plane | 2014-07-30 | Paper |
| Mutual witness proximity graphs | 2014-06-23 | Paper |
| Convex equipartitions: the spicy chicken theorem | 2014-05-30 | Paper |
| Computing similarity between piecewise-linear functions | 2014-04-03 | Paper |
| Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons | 2014-03-24 | Paper |
| Computing Correlation between Piecewise-Linear Functions | 2014-02-04 | Paper |
| Witness Gabriel graphs | 2013-08-22 | Paper |
| Distance-Sensitive Planar Point Location | 2013-08-12 | Paper |
| How to cover a point set with a \(V\)-shape of minimum width | 2013-01-25 | Paper |
| Unions of fat convex polytopes have short skeletons | 2012-08-13 | Paper |
| Minimizing the error of linear separators on linearly inseparable data | 2012-06-18 | Paper |
| Complexity of a Single Face in an Arrangement of s-Intersecting Curves | 2011-08-22 | Paper |
| Witness Rectangle Graphs | 2011-08-12 | Paper |
| How to cover a point set with a \(V\)-shape of minimum width | 2011-08-12 | Paper |
| Witness (Delaunay) graphs | 2011-07-20 | Paper |
| Peeling meshed potatoes | 2011-05-10 | Paper |
| Approximate Halfspace Range Counting | 2011-04-04 | Paper |
| Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes | 2011-04-04 | Paper |
| Lines pinning lines | 2011-03-10 | Paper |
| Convex Equipartitions of volume and surface area | 2010-10-22 | Paper |
| Cutting triangular cycles of lines in space | 2010-08-16 | Paper |
| Distinct distances in three and higher dimensions | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579436 | 2010-08-06 | Paper |
| OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS | 2010-03-19 | Paper |
| Connect the Dot: Computing Feed-Links with Minimum Dilation | 2009-10-20 | Paper |
| Minimum-cost load-balancing partitions | 2009-08-27 | Paper |
| On Approximating the Depth and Related Problems | 2009-06-22 | Paper |
| Small weak epsilon-nets | 2009-06-18 | Paper |
| On approximate halfspace range counting and relative epsilon-approximations | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601526 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601553 | 2009-02-10 | Paper |
| The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains | 2008-11-25 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2008-09-18 | Paper |
| The Complexity of Diffuse Reflections in a Simple Polygon | 2008-09-18 | Paper |
| Ray shooting and intersection searching amidst fat convex polyhedra in 3-space | 2008-07-29 | Paper |
| Sparse geometric graphs with small dilation | 2008-06-18 | Paper |
| Optimal Triangulation with Steiner Points | 2008-05-27 | Paper |
| A generalization of magic squares with applications to digital halftoning | 2008-04-03 | Paper |
| Fréchet Distance for Curves, Revisited | 2008-03-11 | Paper |
| On the union of \(\kappa\)-round objects in three and four dimensions | 2006-12-06 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Cost prediction for ray shooting in octrees | 2006-06-30 | Paper |
| POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA | 2006-05-29 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Lines avoiding unit balls in three dimensions | 2005-11-01 | Paper |
| Geometric permutations induced by line transversals through a fixed point | 2005-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692689 | 2005-09-28 | Paper |
| Cost-driven octree construction schemes: An experimental study | 2005-05-04 | Paper |
| Cutting triangular cycles of lines in space | 2005-04-15 | Paper |
| Incidences between points and circles in three and higher dimensions | 2005-04-15 | Paper |
| Cell complexities in hyperplane arrangements | 2004-12-16 | Paper |
| Distinct Distances in Three and Higher Dimensions | 2004-09-24 | Paper |
| Facility location on a polyhedral surface | 2004-07-07 | Paper |
| On the number of views of translates of a cube and related problems. | 2004-03-14 | Paper |
| Cutting circles into pseudo-segments and improved bounds for incidences | 2003-03-17 | Paper |
| A lower bound on Voronoi diagram complexity. | 2003-01-21 | Paper |
| A Helly-type theorem for higher-dimensional transversals | 2003-01-08 | Paper |
| On the number of regular vertices of the union of Jordan regions | 2002-11-04 | Paper |
| A Helly-type theorem for hyperplane transversals to well-separated convex sets | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547793 | 2002-08-21 | Paper |
| Exact and approximation algorithms for minimum-width cylindrical shells | 2002-07-22 | Paper |
| Approximation algorithms for minimum-width annuli and shells | 2001-08-16 | Paper |
| On the Helly number for hyperplane transversals to unit balls | 2001-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952660 | 2001-01-29 | Paper |
| Motion planning for multiple robots | 1999-11-25 | Paper |
| Motion planning for a convex polygon in a polygonal environment | 1999-09-12 | Paper |
| Approximating minimum-weight triangulations in three dimensions | 1999-06-29 | Paper |
| Line transversals of balls and smallest enclosing cylinders in three dimensions | 1999-05-27 | Paper |
| Visibility with multiple reflections | 1998-10-26 | Paper |
| Visibility with one reflection | 1998-08-12 | Paper |
| The common exterior of convex polygons in the plane | 1998-02-16 | Paper |
| The Union of Convex Polyhedra in Three Dimensions | 1998-02-10 | Paper |
| Star Unfolding of a Polytope with Applications | 1998-02-10 | Paper |
| Computing Envelopes in Four Dimensions with Applications | 1998-02-10 | Paper |
| On Translational Motion Planning of a Convex Polyhedron in 3-Space | 1998-02-10 | Paper |
| Quasi-planar graphs have a linear number of edges | 1998-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4834995 | 1995-06-22 | Paper |
| Can visibility graphs be represented compactly? | 1994-11-27 | Paper |
| Castles in the air revisited | 1994-09-26 | Paper |
| Crossing families | 1994-08-11 | Paper |
| On the number of minimal 1-Steiner trees | 1994-08-10 | Paper |
| On the sum of squares of cell complexities in hyperplane arrangements | 1994-06-06 | Paper |
| An invariant property of balls in arrangements of hyperplanes | 1994-01-19 | Paper |
| On compatible triangulations of simple polygons | 1993-08-23 | Paper |
| Selecting distances in the plane | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037403 | 1993-05-18 | Paper |
| The furthest-site geodesic Voronoi diagram | 1993-05-16 | Paper |
| On the zone of a surface in a hyperplane arrangement | 1993-05-16 | Paper |
| The number of edges of many faces in a line segment arrangement | 1993-01-17 | Paper |
| Nonoverlap of the star unfolding | 1993-01-16 | Paper |
| Counting facets and incidences | 1992-09-26 | Paper |
| Computing external farthest neighbors for a simple polygon | 1992-06-25 | Paper |
| Points and triangles in the plane and halving planes in space | 1992-06-25 | Paper |
| Triangles in space or building (and analyzing) castles in the air | 1990-01-01 | Paper |
| On the geodesic Voronoi diagram of point sites in a simple polygon | 1989-01-01 | Paper |
