| Publication | Date of Publication | Type |
|---|
| Visualizing geometric algorithms -- state of the art | 2024-06-21 | Paper |
| Geometric problems in machine learning | 2024-06-21 | Paper |
| Generating sparse spanners for weighted graphs | 2022-12-09 | Paper |
| Efficient and small representation of line arrangements with applications | 2017-09-29 | Paper |
| Shape distributions | 2008-12-21 | Paper |
| Strategies for polyhedral surface decomposition: an experimental study. | 2008-04-25 | Paper |
| TEMPORAL COHERENCE IN BOUNDING VOLUME HIERARCHIES FOR COLLISION DETECTION | 2007-02-09 | Paper |
| A reflective symmetry descriptor for 3D models | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945508 | 2000-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318735 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401032 | 1998-08-02 | Paper |
| The quickhull algorithm for convex hulls | 1998-01-07 | Paper |
| Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning | 1996-11-26 | Paper |
| TRIANGULATING POLYGONS WITHOUT LARGE ANGLES | 1995-05-17 | Paper |
| Maintenance of geometric extrema | 1994-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288337 | 1994-05-19 | Paper |
| Visibility with a moving point of view | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138884 | 1994-01-02 | 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/Q4038707 | 1993-05-18 | Paper |
| Detecting the intersection of convex objects in the plane | 1992-06-28 | Paper |
| Delaunay graphs are almost as good as complete graphs | 1990-01-01 | Paper |
| Computational geometry in a curved world | 1990-01-01 | Paper |
| Searching for empty convex polygons | 1990-01-01 | Paper |
| Applied computational geometry: Towards robust solutions of basic problems | 1990-01-01 | Paper |
| Primitives for the manipulation of three-dimensional subdivisions | 1989-01-01 | Paper |
| Partitioning Space for Range Queries | 1989-01-01 | Paper |
| Decomposition and intersection of simple splinegons | 1988-01-01 | Paper |
| Space searching for intersecting objects | 1987-01-01 | Paper |
| Space searching for intersecting objects | 1987-01-01 | Paper |
| Finding Extremal Polygons | 1985-01-01 | Paper |
| A linear algorithm for determining the separation of convex polyhedra | 1985-01-01 | Paper |
| Efficient uses of the past | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750120 | 1985-01-01 | Paper |
| Fast detection of polyhedral intersection | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745276 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957945 | 1982-01-01 | Paper |
| Optimal Time Minimal Space Selection Algorithms | 1981-01-01 | Paper |
| Determining the mode | 1980-01-01 | Paper |
| An Improved Lower Bound on Polynomial Multiplication | 1980-01-01 | Paper |
| Addition Chain Methods for the Evaluation of Specific Polynomials | 1980-01-01 | Paper |
| The complexity of linear programming | 1980-01-01 | Paper |
| Linear programming is log-space hard for P | 1979-01-01 | Paper |
| On the complexity of computations under varying sets of primitives | 1979-01-01 | Paper |
| On the optimal evaluation of a set of bilinear forms | 1978-01-01 | Paper |
| A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4160413 | 1978-01-01 | Paper |
| Complexity measures and hierarchies for the evaluation of integers and polynomials | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3906497 | 1977-01-01 | Paper |
| Inclusion complete tally languages and the Hartmanis-Berman conjecture | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195944 | 1977-01-01 | Paper |
| A nonlinear lower bound on linear search tree programs for solving knapsack-problems | 1976-01-01 | Paper |
| The complexity of vector-products | 1976-01-01 | Paper |
| Multidimensional Searching Problems | 1976-01-01 | Paper |
| On the Number of Multiplications Required for Matrix Multiplication | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136563 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4080721 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134963 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4094392 | 1973-01-01 | Paper |
