Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
We present a fast and robust system for estimating structure
and motion using a stereo pair, with straight lines as
features. Our first set of contributions are efficient algorit...
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
We propose a geometric approach to 3-D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the ...