| Publication | Date of Publication | Type |
|---|
| Designing the computational geometry algorithms library CGAL | 2024-06-21 | Paper |
Dominance in the presence of obstacles
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Intersection queries in sets of disks
SWAT 90 | 2022-12-09 | Paper |
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
SWAT 90 | 2022-12-09 | Paper |
Models and motion planning
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Dynamic partition trees
SWAT 90 | 2022-12-09 | Paper |
New results on binary space partitions in the plane (extended abstract)
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Dynamic motion planning in low obstacle density environments
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Concatenable segment trees (extended abstract)
STACS 89 | 2022-08-16 | Paper |
Time vs bits
STACS 89 | 2022-08-16 | Paper |
Separating point sets in polygonal environments
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks | 2015-08-03 | Paper |
On a class of O(n^2) problems in computational geometry
Computational Geometry | 2012-05-18 | Paper |
Computing signed permutations of polygons
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
An effective framework for path planning amidst movable obstacles
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
Flexible Path Planning Using Corridor Maps
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Realizing partitions respecting full and partial order information
Journal of Discrete Algorithms | 2008-11-18 | Paper |
| Computational geometry. Algorithms and applications. | 2008-03-25 | Paper |
Computing Maximally Separated Sets in the Plane
SIAM Journal on Computing | 2007-06-26 | Paper |
IMMOBILIZING HINGED POLYGONS
International Journal of Computational Geometry & Applications | 2007-03-21 | Paper |
An intersection-sensitive algorithm for snap rounding
Computational Geometry | 2007-02-19 | Paper |
TSP with neighborhoods of varying size
Journal of Algorithms | 2005-11-16 | Paper |
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
Recent Developments in Motion Planning
Lecture Notes in Computer Science | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2085303 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2079740 (Why is no real title available?) | 2004-07-30 | Paper |
| scientific article; zbMATH DE number 1993586 (Why is no real title available?) | 2003-10-21 | Paper |
Preprocessing chains for fast dihedral rotations is hard or even impossible.
Computational Geometry | 2003-10-14 | Paper |
Interference-free NC machining using spatial planning and Minkowski operations.
CAD. Computer-Aided Design | 2003-09-24 | Paper |
| scientific article; zbMATH DE number 1979514 (Why is no real title available?) | 2003-09-14 | Paper |
Guarding scenes against invasive hypercubes.
Computational Geometry | 2003-08-25 | Paper |
| scientific article; zbMATH DE number 1947392 (Why is no real title available?) | 2003-07-08 | Paper |
On R-trees with low query complexity
Computational Geometry | 2003-04-28 | Paper |
Flipturning Polygons
Discrete & Computational Geometry | 2003-03-17 | Paper |
Finding sets of points without empty convex 6-gons
Discrete & Computational Geometry | 2003-03-17 | Paper |
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry | 2003-03-10 | Paper |
| scientific article; zbMATH DE number 1830727 (Why is no real title available?) | 2002-11-18 | Paper |
Models and motion planning
Computational Geometry | 2002-09-03 | Paper |
Geometric eccentricity and the complexity of manipulation plans
Algorithmica | 2002-08-05 | Paper |
Locked and unlocked polygonal chains in three dimensions
Discrete & Computational Geometry | 2002-07-22 | Paper |
Orienting polyhedral parts by pushing
Computational Geometry | 2002-03-14 | Paper |
Reconfiguring convex polygons
Computational Geometry | 2002-01-14 | Paper |
| scientific article; zbMATH DE number 1670656 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1501069 (Why is no real title available?) | 2000-11-26 | Paper |
| scientific article; zbMATH DE number 1501070 (Why is no real title available?) | 2000-11-26 | Paper |
Approximating Voronoi Diagrams of Convex Sites in Any Dimension
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Computing the Angularity Tolerance
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1433426 (Why is no real title available?) | 2000-04-18 | Paper |
Dynamic motion planning in low obstacle density environments
Computational Geometry | 1999-02-02 | Paper |
Motion planning in environments with low obstacle density
Discrete & Computational Geometry | 1999-01-13 | Paper |
Spheres, molecules, and hidden surface removal
Computational Geometry | 1998-12-21 | Paper |
Computing fence designs for orienting parts
Computational Geometry | 1998-11-10 | Paper |
Feasibility of design in stereolithography
Algorithmica | 1998-02-04 | Paper |
New results on binary space partitions in the plane
Computational Geometry | 1997-10-28 | Paper |
The Floodlight Problem
International Journal of Computational Geometry & Applications | 1997-07-27 | Paper |
| scientific article; zbMATH DE number 1033560 (Why is no real title available?) | 1997-07-14 | Paper |
Improved bounds for electing a leader in a synchronous ring
Algorithmica | 1997-05-28 | Paper |
Perfect binary space partitions
Computational Geometry | 1997-03-18 | Paper |
Reaching a goal with directional uncertainty
Theoretical Computer Science | 1997-02-28 | Paper |
Range Searching and Point Location among Fat Objects
Journal of Algorithms | 1996-12-08 | Paper |
The exact fitting problem in higher dimensions
Computational Geometry | 1996-11-17 | Paper |
On a class of \(O(n^ 2)\) problems in computational geometry
Computational Geometry | 1995-12-12 | Paper |
| scientific article; zbMATH DE number 797425 (Why is no real title available?) | 1995-11-28 | Paper |
MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES
International Journal of Computational Geometry & Applications | 1995-01-26 | Paper |
| scientific article; zbMATH DE number 645770 (Why is no real title available?) | 1994-09-28 | Paper |
Efficient ray shooting and hidden surface removal
Algorithmica | 1994-08-10 | Paper |
Concatenable structures for decomposable problems
Information and Computation | 1994-06-09 | Paper |
Computing and Verifying Depth Orders
SIAM Journal on Computing | 1994-05-10 | Paper |
An improved technique for output-sensitive hidden surface removal
Algorithmica | 1994-05-05 | Paper |
Output-sensitive methods for rectilinear hidden surface removal
Information and Computation | 1994-03-24 | Paper |
The complexity of the free space for a robot moving amidst fat obstacles
Computational Geometry | 1994-02-17 | Paper |
Intersection Queries in Curved Objects
Journal of Algorithms | 1993-12-06 | Paper |
Union-copy structures and dynamic segment trees
Journal of the ACM | 1993-12-06 | Paper |
Maintenance of 2- and 3-edge-connected components of graphs. I
Discrete Mathematics | 1993-10-24 | Paper |
| scientific article; zbMATH DE number 177849 (Why is no real title available?) | 1993-05-18 | Paper |
Point location in fat subdivisions
Information Processing Letters | 1993-05-16 | Paper |
Efficient hidden surface removal for objects with small union size
Computational Geometry | 1993-05-16 | Paper |
SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
Intersection queries in sets of disks
BIT | 1992-12-14 | Paper |
Hidden surface removal for \(c\)-oriented polyhedra
Computational Geometry | 1992-09-27 | Paper |
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics | 1992-06-28 | Paper |
A general approach to dominance in the plane
Journal of Algorithms | 1992-06-28 | Paper |
Efficient Motion Planning for an <i>L</i>-Shaped Object
SIAM Journal on Computing | 1992-06-28 | Paper |
Finding minimum area \(k\)-gons
Discrete & Computational Geometry | 1992-06-28 | Paper |
Divided \(k-d\) trees
Algorithmica | 1992-06-27 | Paper |
New Upper Bounds in Klee’s Measure Problem
SIAM Journal on Computing | 1992-06-27 | Paper |
Merging visibility maps
Computational Geometry | 1991-01-01 | Paper |
Dynamic partition trees
BIT | 1991-01-01 | Paper |
Storing line segments in partition trees
BIT | 1990-01-01 | Paper |
Maintaining range trees in secondary memory. Part I: Partitions
Acta Informatica | 1990-01-01 | Paper |
Ranking intervals under visibility constraints<sup>∗</sup>
International Journal of Computer Mathematics | 1990-01-01 | Paper |
Maintaining range trees is secondary memory. Part II: Lower bounds
Acta Informatica | 1990-01-01 | Paper |
Searching for empty convex polygons
Algorithmica | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4113964 (Why is no real title available?) | 1989-01-01 | Paper |
Maintaining multiple representations of dynamic data structures
Information and Computation | 1989-01-01 | Paper |
Data structures in real-time environment
Information Processing Letters | 1989-01-01 | Paper |
General methods for adding range restrictions to decomposable searching problems
Journal of Symbolic Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4051018 (Why is no real title available?) | 1988-01-01 | Paper |
Scanline algorithms on a grid
BIT | 1988-01-01 | Paper |
A balanced search tree O(1) worst-case update time
Acta Informatica | 1988-01-01 | Paper |
On rectangular visibility
Journal of Algorithms | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062603 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062593 (Why is no real title available?) | 1988-01-01 | Paper |
Efficient data structures for range searching on a grid
Journal of Algorithms | 1988-01-01 | Paper |
Zooming by repeated range detection
Information Processing Letters | 1987-01-01 | Paper |
Batched dynamic solutions to decomposable searching problems
Journal of Algorithms | 1985-01-01 | Paper |
Some methods of computational geometry applied to computer graphics
Computer Vision, Graphics, and Image Processing | 1984-01-01 | Paper |
Stratified balanced search trees
Acta Informatica | 1983-01-01 | Paper |
The design of dynamic data structures
Lecture Notes in Computer Science | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3864520 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3864518 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3864511 (Why is no real title available?) | 1982-01-01 | Paper |
Dynamic multi-dimensional data structures based on quad- and k-d trees
Acta Informatica | 1982-01-01 | Paper |
On the equivalence of some rectangle problems
Information Processing Letters | 1982-01-01 | Paper |
Dynamization of order decomposable set problems
Journal of Algorithms | 1981-01-01 | Paper |
Maintenance of configurations in the plane
Journal of Computer and System Sciences | 1981-01-01 | Paper |
Optimal dynamization of decomposable searching problems
Information Processing Letters | 1981-01-01 | Paper |
Worst-case optimal insertion and deletion methods for decomposable searching problems
Information Processing Letters | 1981-01-01 | Paper |
General methods for 'all elements' and 'all pairs' problems
Information Processing Letters | 1981-01-01 | Paper |
Two general methods for dynamizing decomposable searching problems
Computing | 1981-01-01 | Paper |
Some principles for dynamizing decomposable searching problems
Information Processing Letters | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3716801 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3722116 (Why is no real title available?) | 1981-01-01 | Paper |
Further comments on Bykat's convex hull algorithm
Information Processing Letters | 1980-01-01 | Paper |
