839 search results - page 42 / 168 » Three-Clustering of Points in the Plane |
CIAC
2006
Springer
14 years 22 days ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
JGAA
2006
13 years 9 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
INFORMATICALT
2000
13 years 8 months ago
2000
The result of simulation of an idealized thin wet film connecting fixed points in the Euclidean plane is a length-minimizing curve. Gradually increasing the exterior pressure we ar...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
SIBGRAPI
2008
IEEE
14 years 3 months ago
2008
IEEE
Recognizing shapes in multiview imaging is still a challenging task, which usually relies on geometrical invariants estimations. However, very few geometric estimators that are pro...