On generalizations of Radon's theorem and the Ham sandwich theorem
European Journal of Combinatorics - Special issue dedicated to Bernt Lindstro¨m
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Lectures on Discrete Geometry
A 3-space partition and its applications
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
New Constructions of Weak ε-Nets
Discrete & Computational Geometry
An optimal generalization of the centerpoint theorem, and its extensions
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Weak ε-nets have basis of size O (1/εlog(1/ε)) in any dimension
Computational Geometry: Theory and Applications
Intersecting convex sets by rays
Proceedings of the twenty-fourth annual symposium on Computational geometry
Approximate center points with proofs
Proceedings of the twenty-fifth annual symposium on Computational geometry
Ray-shooting depth: computing statistical data depth of point sets in the plane
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.00 |
Using a technique that Tverberg and Vrecica (1993) [16] discovered to give a surprisingly simple proof of Tverberg's theorem, we show the following extension of the centerpoint theorem. Given any set P of n points in the plane, and a parameter 1/3=