17 search results - page 1 / 4 » The number of points in a matroid with no n-point line as a ... |
JCT
2010
13 years 3 months ago
2010
SIAMDM
2008
13 years 4 months ago
2008
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...
STOC
2001
ACM
14 years 5 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...
CIAC
2006
Springer
13 years 8 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...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...