Curvature-constrained shortest paths in a convex polygon (extended abstract)
Proceedings of the fourteenth annual symposium on Computational geometry
Pseudo approximation algorithms, with applications to optimal motion planning
Proceedings of the eighteenth annual symposium on Computational geometry
Algorithmic issues in modeling motion
ACM Computing Surveys (CSUR)
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
Journal of Global Optimization
Towards a Software Development Kit for Motion Synthesis in Virtual Worlds
VSMM '01 Proceedings of the Seventh International Conference on Virtual Systems and Multimedia (VSMM'01)
Geometric design of motions constrained by a contacting surface pair
Computer Aided Geometric Design
Pianos are not flat: rigid motion planning in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the exact maximum complexity of Minkowski sums of convex polyhedra
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
Computer-Aided Design
Stabbing Convex Polygons with a Segment or a Polygon
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Algorithmic motion planning: the randomized approach
General Theory of Information Transfer and Combinatorics
On soft predicates in subdivision motion planning
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |