## Improved Bounds on Planar k-sets and k-levels (1997)

### Cached

### Download Links

- [www.cis.ohio-state.edu]
- [www.cse.ohio-state.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Discrete Comput. Geom |

Citations: | 16 - 0 self |

### BibTeX

@ARTICLE{Dey97improvedbounds,

author = {Tamal K. Dey},

title = {Improved Bounds on Planar k-sets and k-levels},

journal = {Discrete Comput. Geom},

year = {1997},

volume = {19},

pages = {156--161}

}

### Years of Citing Articles

### OpenURL

### Abstract

We prove an O(nk 1=3 ) upper bound for planar k-sets. This is the first considerable improvement on this bound after its early solutions approximately twenty seven years ago. Our proof technique also applies to improve the current bounds on the combinatorial complexities of k-levels in arrangements of line segments, k convex polygons in the union of n lines, parametric minimum spanning trees and parametric matroids in general. 1 Introduction The problem of determining the optimum asymptotic bound on the number of k-sets is one of the most tantalizing open problems in combinatorial geometry. Due to its importance in analyzing geometric algorithms [8, 9, 18], the problem has caught the attention of the computational geometers as well [5, 6, 7, 13, 17, 26, 28]. Given a set P of n points in ! d , and a positive integer k n, a k-set is a subset P 0 ` P such that P 0 = P " H for a halfspace H and jP 0 j = k. A close to optimal solution for the problem remains elusive even in ! ...