The number of small semispaces of a finite set of points in the plane
Journal of Combinatorial Theory Series A
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Handbook of discrete and computational geometry
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles
Combinatorics, Probability and Computing
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Crossing patterns of semi-algebraic sets
Journal of Combinatorial Theory Series A
Higher-order Voronoi diagrams on triangulated surfaces
Information Processing Letters
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
Cuttings for disks and axis-aligned rectangles
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We provide an alternative, simpler and more general derivation of the Clarkson–Shor probabilistic technique [7] and use it to obtain several extensions and new combinatorial bounds.