839 search results - page 99 / 168 » Three-Clustering of Points in the Plane |
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
3DPVT
2002
IEEE
14 years 3 months ago
2002
IEEE
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...
STOC
1998
ACM
14 years 2 months ago
1998
ACM
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
ICRA
1993
IEEE
14 years 2 months ago
1993
IEEE
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...
HYBRID
1995
Springer
14 years 1 months ago
1995
Springer
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...