Abstract
We prove that the maximum number of k-sets in a set S of n points in ℝ 3 is O(nk3/2). This improves substantially the previous best known upper bound of O(nk5/3) (see [7] and [1]).
Original language | English |
---|---|
Pages (from-to) | 195-204 |
Number of pages | 10 |
Journal | Discrete and Computational Geometry |
Volume | 26 |
Issue number | 2 |
DOIs | |
State | Published - 1 Jan 2001 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics