David Eppstein

*Proc. 32nd Symp. Foundations of Computer Science*, IEEE, Oct 1991, pp. 488–494

*ORSA J. Computing* 4(4):360–368, 1992

Tech. report 91-53, Univ. of California, Irvine, Dept. of Information and Computer Science, 1991

http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-91-53.pdf

Cited by:

- Dynamic half-space range reporting and its applications
- Linear optimization queries
- Computational Geometry: An Introduction through Randomized Algorithms
- Compatible tetrahedralizations
- Tentative prune-and-search for computing Voronoi vertices
- A simple algorithm for maintaining the center of a planar point set
- Monge and feasibility sequences in general flow problems
- A geometric proof of the combinatorial bounds for the number of optimal solutions for the 2-center Euclidean problem
- Fixed-dimensional parallel linear programming via relative epsilon-approximation
- A near-linear algorithm for the planar 2-center problem
- Optimal separable partitioning in the plane
- Output-sensitive results on convex hulls, extreme points, and related problems
- Deterministic algorithms for 2-d convex programming and 3-d online linear programming
- An efficient algorithm for terrain simplification
- Efficient algorithms for geometric optimization
- Output-Sensitive Construction of Convex Hulls
- Linear programming in low dimensions
- Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
- Rectilinear 2-center problems
- More planar two-center algorithms
- Optimizing the sum of linear fractional functions and applications
- The 2-center problem with obstacles
- A fully dynamic algorithm for planar width
- A fast algorithm for the alpha-connected two-center decision problem
- Efficient algorithms for bichromatic separability
- An efficient data structure for advance bandwidth reservations on the internet
- Data structure for a time-based bandwidth reservations problem
- Low-dimensional linear programming with violations
- Data Structures for Bandwidth Reservations and Quality of Service on the Internet
- A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries