Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
We present an approach to parallel variational optical flow computation by using an arbitrary partition of the image plane and iteratively solving related local variational proble...
We consider the problem of computing stereo correspondence for scenes dense in physical structure, such as a bouquet of flowers. Boundaries are then space curves, formally govern...
This paper studies motion planning from one zero velocity state to another for a three-joint robot in a horizontal plane witha passive revolute third joint. Such a robot is small-...
Kevin M. Lynch, Naoji Shiroma, Hirohiko Arai, Kazu...
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...