Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Optimal shortest path queries in a simple polygon
Journal of Computer and System Sciences
A new data structure for shortest path queries in a simple polygon
Information Processing Letters
Algorithmic motion planning in robotics
Handbook of theoretical computer science (vol. A)
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Motion planning for a steering-constrained robot through moderate obstacles
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The complexity of the two dimensional curvature-constrained shortest-path problem
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Smooth paths in a polygonal channel
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Robot Motion Planning and Control
Robot Motion Planning and Control
Robot Motion Planning
Approximation Algorithms for Curvature-Constrained Shortest Paths
SIAM Journal on Computing
Curvature-Constrained Shortest Paths in a Convex Polygon
SIAM Journal on Computing
Finding curvature-constrained paths that avoid polygonal obstacles
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
ACC'09 Proceedings of the 2009 conference on American Control Conference
Simple wriggling is hard unless you are a fat hippo
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Visiting a sequence of points with a bevel-tip needle
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Computational Geometry: Theory and Applications
Approximating minimum bending energy path in a simple corridor
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We consider the existence and efficient construction of bounded curvature paths traversing constant-width regions of the plane, called corridors. We make explicit a width threshold τ with the property that (a) all corridors of width at least τ admit a unit-curvature traversal and (b) for any width w