On the general motion planning problem with two degrees of freedom
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Coordinated motion planning for two independent robots
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Efficient motion planning for an L-shaped object
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Placing the largest similar copy of a convex polygon among polygonal obstacles
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Extremal polygon containment problems
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Combinatorial complexity of translating a box in polyhedral 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
ACM SIGACT News
How to cut pseudo-parabolas into segments
Proceedings of the eleventh annual symposium on Computational geometry
On Computing the Upper Envelope of Segments in Parallel
IEEE Transactions on Parallel and Distributed Systems
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Pianos are not flat: rigid motion planning in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric algorithms for clearance based optimal path computation
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
| Hi-index | 0.00 |