| Publication | Date of Publication | Type |
|---|
| Dominance in the presence of obstacles | 2024-02-28 | Paper |
| Models and motion planning | 2022-12-09 | Paper |
| Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric | 2022-12-09 | Paper |
| Intersection queries in sets of disks | 2022-12-09 | Paper |
| Dynamic partition trees | 2022-12-09 | Paper |
| New results on binary space partitions in the plane (extended abstract) | 2022-12-09 | Paper |
| Dynamic motion planning in low obstacle density environments | 2022-08-19 | Paper |
| Time vs bits | 2022-08-16 | Paper |
| Concatenable segment trees | 2022-08-16 | Paper |
| Separating point sets in polygonal environments | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501300 | 2015-08-03 | Paper |
| On a class of \(O(n^2)\) problems in computational geometry | 2012-05-18 | Paper |
| COMPUTING SIGNED PERMUTATIONS OF POLYGONS | 2011-06-17 | Paper |
| An Effective Framework for Path Planning Amidst Movable Obstacles | 2010-06-02 | Paper |
| Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles | 2010-06-02 | Paper |
| Flexible Path Planning Using Corridor Maps | 2008-11-25 | Paper |
| Realizing partitions respecting full and partial order information | 2008-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5452284 | 2008-03-25 | Paper |
| Computing Maximally Separated Sets in the Plane | 2007-06-26 | Paper |
| IMMOBILIZING HINGED POLYGONS | 2007-03-21 | Paper |
| An intersection-sensitive algorithm for snap rounding | 2007-02-19 | Paper |
| TSP with neighborhoods of varying size | 2005-11-16 | Paper |
| SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS | 2005-09-29 | Paper |
| Recent Developments in Motion Planning | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736556 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471809 | 2004-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431229 | 2003-10-21 | Paper |
| Preprocessing chains for fast dihedral rotations is hard or even impossible. | 2003-10-14 | Paper |
| Interference-free NC machining using spatial planning and Minkowski operations. | 2003-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427858 | 2003-09-14 | Paper |
| Guarding scenes against invasive hypercubes. | 2003-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411358 | 2003-07-08 | Paper |
| On R-trees with low query complexity | 2003-04-28 | Paper |
| Finding sets of points without empty convex 6-gons | 2003-03-17 | Paper |
| Flipturning Polygons | 2003-03-17 | Paper |
| Reporting intersecting pairs of convex polytopes in two and three dimensions | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778548 | 2002-11-18 | Paper |
| Models and motion planning | 2002-09-03 | Paper |
| Geometric eccentricity and the complexity of manipulation plans | 2002-08-05 | Paper |
| Orienting polyhedral parts by pushing | 2002-03-14 | Paper |
| Reconfiguring convex polygons | 2002-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753933 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499950 | 2000-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499951 | 2000-11-26 | Paper |
| Computing the Angularity Tolerance | 2000-11-07 | Paper |
| Approximating Voronoi Diagrams of Convex Sites in Any Dimension | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4947407 | 2000-04-18 | Paper |
| Dynamic motion planning in low obstacle density environments | 1999-02-02 | Paper |
| Motion planning in environments with low obstacle density | 1999-01-13 | Paper |
| Spheres, molecules, and hidden surface removal | 1998-12-21 | Paper |
| Computing fence designs for orienting parts | 1998-11-10 | Paper |
| Feasibility of design in stereolithography | 1998-02-04 | Paper |
| New results on binary space partitions in the plane | 1997-10-28 | Paper |
| The Floodlight Problem | 1997-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344150 | 1997-07-14 | Paper |
| Improved bounds for electing a leader in a synchronous ring | 1997-05-28 | Paper |
| Perfect binary space partitions | 1997-03-18 | Paper |
| Reaching a goal with directional uncertainty | 1997-02-28 | Paper |
| Range Searching and Point Location among Fat Objects | 1996-12-08 | Paper |
| The exact fitting problem in higher dimensions | 1996-11-17 | Paper |
| On a class of \(O(n^ 2)\) problems in computational geometry | 1995-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848583 | 1995-11-28 | Paper |
| MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES | 1995-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4307481 | 1994-09-28 | Paper |
| Efficient ray shooting and hidden surface removal | 1994-08-10 | Paper |
| Concatenable structures for decomposable problems | 1994-06-09 | Paper |
| Computing and Verifying Depth Orders | 1994-05-10 | Paper |
| An improved technique for output-sensitive hidden surface removal | 1994-05-05 | Paper |
| Output-sensitive methods for rectilinear hidden surface removal | 1994-03-24 | Paper |
| The complexity of the free space for a robot moving amidst fat obstacles | 1994-02-17 | Paper |
| Union-copy structures and dynamic segment trees | 1993-12-06 | Paper |
| Intersection Queries in Curved Objects | 1993-12-06 | Paper |
| Maintenance of 2- and 3-edge-connected components of graphs. I | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038727 | 1993-05-18 | Paper |
| Efficient hidden surface removal for objects with small union size | 1993-05-16 | Paper |
| Point location in fat subdivisions | 1993-05-16 | Paper |
| SHORTEST PATH QUERIES IN RECTILINEAR WORLDS | 1993-04-01 | Paper |
| Intersection queries in sets of disks | 1992-12-14 | Paper |
| Hidden surface removal for \(c\)-oriented polyhedra | 1992-09-27 | Paper |
| Finding minimum area \(k\)-gons | 1992-06-28 | Paper |
| Efficient Motion Planning for an L-Shaped Object | 1992-06-28 | Paper |
| A general approach to dominance in the plane | 1992-06-28 | Paper |
| A simple output-sensitive algorithm for hidden surface removal | 1992-06-28 | Paper |
| Divided \(k-d\) trees | 1992-06-27 | Paper |
| New Upper Bounds in Klee’s Measure Problem | 1992-06-27 | Paper |
| Dynamic partition trees | 1991-01-01 | Paper |
| Merging visibility maps | 1991-01-01 | Paper |
| Storing line segments in partition trees | 1990-01-01 | Paper |
| Searching for empty convex polygons | 1990-01-01 | Paper |
| Maintaining range trees in secondary memory. Part I: Partitions | 1990-01-01 | Paper |
| Maintaining range trees is secondary memory. Part II: Lower bounds | 1990-01-01 | Paper |
| Ranking intervals under visibility constraints∗ | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729324 | 1989-01-01 | Paper |
| Maintaining multiple representations of dynamic data structures | 1989-01-01 | Paper |
| General methods for adding range restrictions to decomposable searching problems | 1989-01-01 | Paper |
| Data structures in real-time environment | 1989-01-01 | Paper |
| Scanline algorithms on a grid | 1988-01-01 | Paper |
| A balanced search tree O(1) worst-case update time | 1988-01-01 | Paper |
| Efficient data structures for range searching on a grid | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787502 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796750 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796759 | 1988-01-01 | Paper |
| On rectangular visibility | 1988-01-01 | Paper |
| Zooming by repeated range detection | 1987-01-01 | Paper |
| Batched dynamic solutions to decomposable searching problems | 1985-01-01 | Paper |
| Some methods of computational geometry applied to computer graphics | 1984-01-01 | Paper |
| The design of dynamic data structures | 1983-01-01 | Paper |
| Stratified balanced search trees | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332265 | 1983-01-01 | Paper |
| On the equivalence of some rectangle problems | 1982-01-01 | Paper |
| Dynamic multi-dimensional data structures based on quad- and k-d trees | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332258 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332263 | 1982-01-01 | Paper |
| Some principles for dynamizing decomposable searching problems | 1981-01-01 | Paper |
| Two general methods for dynamizing decomposable searching problems | 1981-01-01 | Paper |
| General methods for 'all elements' and 'all pairs' problems | 1981-01-01 | Paper |
| Worst-case optimal insertion and deletion methods for decomposable searching problems | 1981-01-01 | Paper |
| Optimal dynamization of decomposable searching problems | 1981-01-01 | Paper |
| Maintenance of configurations in the plane | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907084 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3911410 | 1981-01-01 | Paper |
| Dynamization of order decomposable set problems | 1981-01-01 | Paper |
| Further comments on Bykat's convex hull algorithm | 1980-01-01 | Paper |
