235 search results - page 9 / 47 » The Complexity of Separating Points in the Plane |
73
Voted
JCT
2011
14 years 4 months ago
2011
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three clas...
100
click to vote
VMV
2001
14 years 11 months ago
2001
This paper presents a new method for extracting cylinders from an unorganized set of 3D points. The originality of this approach is to separate the extraction problem into two dis...
111
click to vote
CIAC
2006
Springer
15 years 1 months 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...
MP
2007
14 years 9 months ago
2007
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
ISSAC
1998
Springer
15 years 1 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...