Convex distance functions in 3-space are different
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Piecewise linear paths among convex obstacles
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Curvature-constrained shortest paths in a convex polygon (extended abstract)
Proceedings of the fourteenth annual symposium on Computational geometry
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Approximation algorithms for curvature-constrained shortest paths
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Reachability by paths of bounded curvature in convex polygons
Proceedings of the sixteenth annual symposium on Computational geometry
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the topological structure of configuration spaces
Annals of Mathematics and Artificial Intelligence
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Theoretical Computer Science - Algebraic and numerical algorithm
Curvature-bounded traversals of narrow corridors
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A solution to the Path Planning problem using angle preprocessing
Robotics and Autonomous Systems
Reachability by paths of bounded curvature in a convex polygon
Computational Geometry: Theory and Applications
Algorithmic motion planning: the randomized approach
General Theory of Information Transfer and Combinatorics
Convex Distance Functions In 3-Space Are Different
Fundamenta Informaticae
| Hi-index | 0.00 |