| Point-sets with few k-sets Helmut Alt (2007) | |||||||||||||||
Abstract | |||||||||||||||
| A k-set of a finite set S of points in the plane is a subset of cardinality k that can be separated from the rest by a straight line. The question of how many k-sets a set of n points can contain is a longstanding open problem where a lower bound of \Omega\Gamma n log k) and an upper bound of O(nk | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||