Name
Abstract | ||
|---|---|---|
We prove that a (k−1)-separated family of n compact convex sets in Rd can be met byk-transversals in at mostOdd22k+1-2knk+1kd-k or, for fixed k and d, O(nk(k+1)(d−k)) different order types. This is the first non-trivial bound for 1kd−1. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jcta.1996.0072 | Symposium on Computational Geometry 2013 |
Keywords | Field | DocType |
convex set,upper bound | Discrete mathematics,Combinatorics,Upper and lower bounds,Permutation,Regular polygon,Transversal (geometry),Order type,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
75 | 2 | 0097-3165 |
ISBN | Citations | PageRank |
0-89791-648-4 | 9 | 1.73 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jacob E. Goodman | 1 | 277 | 136.42 |
| Richard Pollack | 2 | 912 | 203.75 |
| Rephael Wenger | 3 | 441 | 43.54 |