In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...
This paper proposes a method to recover the embedding
of the possible shapes assumed by a deforming nonrigid
object by comparing triplets of frames from an orthographic
video se...
Vincent Rabaud (University of California, San Dieg...
Abstract. Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main ...
Michael M. Kazhdan, Bernard Chazelle, David P. Dob...
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...