David P. Dobkin
and David Eppstein

*Proc. 9th Symp. Computational Geometry*, ACM, May 1993, pp. 47–52

Cited by:

- Geometric discrepancy revisited
- Computing the rectangle discrepancy
- Computing the maximum bichromatic discrepancy with applications to computer graphics and machine learning
- The maximum discrepancy of simple geometric ranges
- Computing half-plane and strip discrepancy of planar point sets
- Concept learning with simple geometric hypotheses
- Constructing efficient decision trees by using optimized numeric association rules
- Efficient algorithms for computing the $L_2$ discrepancy
- Computational Geometry: Algorithms and Applications
- Trends and developments in computational geometry
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Efficient and small representation of line arrangements with applications
- An algorithm to compute bounds for the star discrepancy
- Optimal volume subintervals with $k$ points and star discrepancy via integer programming
- Computing bounds for the star discrepancy
- Sur le Calcul et la Majoration de la Discrépance à l'Origine
- The Computational Measure of Uniformity
- An alternative method to the scrambled Halton sequence for removing correlation between standard Halton sequences in high dimensions
- The hunting of the bump: on maximizing statistical discrepancy