ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...
IJCGA
2007
13 years 4 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...