Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Slimming down by adding; selecting heavily covered points
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Points and triangles in the plane and halving planes in space
Discrete & Computational Geometry
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
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
An optimal extension of the centerpoint theorem
Computational Geometry: Theory and Applications
Reprint of: Weak ε-nets have basis of size O(1/εlog(1/ε) ) in any dimension
Computational Geometry: Theory and Applications
A theorem of bárány revisited and extended
Proceedings of the twenty-eighth annual symposium on Computational geometry
| Hi-index | 0.00 |