17 search results - page 4 / 4 » The number of points in a matroid with no n-point line as a ... |
IPCO
2001
13 years 6 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
FOCS
2009
IEEE
14 years 2 days ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...