| Publication | Date of Publication | Type |
|---|
Models and motion planning
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Dynamic motion planning in low obstacle density environments
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Reprint of: Bounding the locus of the center of mass for a part with shape variation
Computational Geometry | 2015-04-27 | Paper |
Bounding the locus of the center of mass for a part with shape variation
Computational Geometry | 2014-06-27 | Paper |
| Immobilization: analysis, existence, and output-sensitive synthesis | 2013-04-15 | Paper |
An effective framework for path planning amidst movable obstacles
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
Caging polygons with two and three fingers
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
| scientific article; zbMATH DE number 5506207 (Why is no real title available?) | 2009-02-10 | Paper |
On realistic terrains
Computational Geometry | 2008-07-29 | Paper |
Approximate unions of lines and Minkowski sums
Algorithmica | 2007-06-21 | Paper |
IMMOBILIZING HINGED POLYGONS
International Journal of Computational Geometry & Applications | 2007-03-21 | Paper |
Computing all immobilizing grasps of a simple polygon with few contacts
Algorithmica | 2006-06-14 | Paper |
TSP with neighborhoods of varying size
Journal of Algorithms | 2005-11-16 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2085303 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2043583 (Why is no real title available?) | 2004-02-16 | 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 the flatness of Minkowski sums
Information Processing Letters | 2003-06-24 | Paper |
Realistic input models for geometric algorithms
Algorithmica | 2002-12-01 | Paper |
Models and motion planning
Computational Geometry | 2002-09-03 | Paper |
Geometric eccentricity and the complexity of manipulation plans
Algorithmica | 2002-08-05 | Paper |
Orienting polyhedral parts by pushing
Computational Geometry | 2002-03-14 | Paper |
| scientific article; zbMATH DE number 1501069 (Why is no real title available?) | 2000-11-26 | Paper |
Motion planning for multiple robots
Discrete & Computational Geometry | 1999-11-25 | 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 |
Computing fence designs for orienting parts
Computational Geometry | 1998-11-10 | Paper |
Range Searching and Point Location among Fat Objects
Journal of Algorithms | 1996-12-08 | Paper |
The complexity of the free space for motion planning amidst fat obstacles
Journal of Intelligent & Robotic Systems | 1995-04-20 | Paper |
The complexity of the free space for a robot moving amidst fat obstacles
Computational Geometry | 1994-02-17 | Paper |
Parallel Sparse LU Decomposition on a Mesh Network of Transputers
SIAM Journal on Matrix Analysis and Applications | 1993-10-18 | Paper |
