839 search results - page 67 / 168 » Three-Clustering of Points in the Plane |
ESA
1999
Springer
14 years 2 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
DM
2008
13 years 10 months ago
2008
Rahilly [10] described a construction that relates any Hadamard design H on 4m -1 points with a line spread to an affine design having the same parameters as the classical design ...
SIAMCOMP
2008
13 years 10 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
CORR
1999
Springer
13 years 9 months ago
1999
Springer
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
CVPR
2008
IEEE
15 years 5 days ago
2008
IEEE
We present a theoretical analysis for characterizing the shadows cast by a point light source given its relative position to the camera. In particular, we analyze the epipolar geo...