Construction of e-Nets.
Tight Upper Bounds for the Discrepancy of Half-Spaces.
Cutting Hyperplane Arrangements.
Lower Bounds on the Length of Monotone Paths in Arrangements.
On Geometric Optimization with Few Violated Constraints.
Dynamic Point Location in Arrangements of Hyperplanes.
Range Searching with Efficient Hierarchical Cuttings.
On Range Searching with Semialgebraic Sets.
On Ray Shooting in Convex Polytopes.
An Elementary Approach to Lower Bounds in Geometric Discrepancy.
Algorithms for Ham Sandwich Cuts.
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.
Piecewise Linear Paths Among Convex Obstacles.
Page 1