A blind classification algorithm is presented that uses hyperdimensional geometric algorithms to locate a hypothesis, in the form of a convex polytope or hyper-sphere. The convex ...
We present a new approach to the algorithmic study of planar curves, with applications to estimations of contours in images. We construct spaces of curves satisfying constraints su...
—To rapidly and accurately search the corresponding points along scan-lines, rectification of stereo pairs are performed so that corresponding epipolar lines are parallel to the ...
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
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...