David Eppstein

*Discrete & Computational Geometry* 20:463–476, 1998

*Proc. 27th Symp. Theory of Computing*, ACM, Jun 1995, pp. 662–671

Tech. report 95-11, Univ. of California, Irvine, Dept. of Information and Computer Science, 1995

*Mathematical Reviews* 99h:90082

http://www.ics.uci.edu/~eppstein/pubs/p-geomlb.html

http://www.acm.org/pubs/citations/proceedings/stoc/225058/p662-eppstein

http://link.springer.de/link/service/journals/00454/bibs/20n4p463.html

Cited by:

- How to cut pseudo-parabolas into segments
- Improved bounds for planar $k$-sets and related problems
- Parametric polymatroid optimization and its geometric applications
- On levels in arrangements of lines, segments, planes, and triangles
- Polytopes in arrangements
- Lovász's lemma for the three-dimensional $K$-level of concave surfaces and its applications
- Halving point sets
- Davenport-Schinzel sequences and their geometric applications{}
- Arrangements and their applications
- Combinatorics on arrangements and parametric matroids: A bridge between computational geometry and combinatorial optimization
- On levels in arrangements of curves
- Multi-parameter minimum spanning trees
- Notes on computing peaks in $k$-levels and parametric spanning trees
- The $k$-centrum multi-facility location problem
- Lectures on Discrete Geometry
- $K$-levels of concave surfaces
- A characterization of planar graphs by pseudo-line arrangements
- Minimax parametric optimization problems and multi-dimensional parametric searching
- On levels in arrangements of curves, II: a simple inequality and its consequences
- Kinetic Maintenance of Proximity Structures