Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Counting triangle crossings and halving planes
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Improved bounds on weak &egr;-nets for convex sets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cutting dense point sets in half
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Results on k-sets and j-facets via continuous motion
Proceedings of the fourteenth annual symposium on Computational geometry
Motion planning of a ball amid segments in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixteenth annual symposium on Computational geometry
An improved bound for k-sets in three dimensions
Proceedings of the sixteenth annual symposium on Computational geometry
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles
Combinatorics, Probability and Computing
On levels in arrangements of surfaces in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the bichromatic k-set problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Note: Eppstein's bound on intersecting triangles revisited
Journal of Combinatorial Theory Series A
On the bichromatic k-set problem
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |