Kenneth L. Clarkson,
David Eppstein,
Gary L. Miller,
Carl Sturtivant,
and Shang-Hua Teng

*Int. J. Computational Geometry & Applications* 6(3):357–377, Sep 1996

*Proc. 9th Symp. Computational Geometry*, ACM, May 1993, pp. 91–98

*Mathematical Reviews* 97h:65010

Cited by:

- Moments of inertia and graph separators
- Simulating quadratic dynamical systems is PSPACE-complete
- Geometric range searching
- A computational view of population genetics
- Automatic mesh partitioning
- Disk packings and planar separators
- Partitioning meshes with lines and planes
- Geometric mesh partitioning: implementation and experiments
- Derandomization in computational geometry
- Fast separator decomposition for finite element meshes
- Algorithmic techniqes for geometric optimization
- Efficient algorithms for geometric optimization
- Separators for sphere-packings and nearest neighbor graphs
- Approximate center points in dense point sets
- Fast nested dissection for finite element meshes
- Geometric separators for finite-element meshes
- Provably good partitioning and load balancing algorithms for parallel adaptive $N$-body simulation
- Depth in an arrangement of hyperplanes
- A data-parallel implementation of the geometric partitioning algorithm
- Efficient Data Parallel Implementations of Highly Irregular Problems
- Arrangements and their applications
- Computing a high depth point in the plane
- Graph partitioning algorithms for distributing workloads of parallel computations
- Fast software for box intersection
- Lectures on Discrete Geometry
- An optimal randomized algorithm for maximum Tukey depth
- Computational geometry and statistical depth measures
- Exact algorithms for computing the locatino depth and the $k$-th depth regions based on parallel arrangement constructions
- A Geometric Theory of Outliers and Perturbation
- Algorithms for center and Tverberg points
- Staying in the middle: exact and approximate medians in $R^1$ and $R^2$ for moving points