David Eppstein,
Mark Overmars,
Günter Rote,
and Gerhard J. Woeginger

*Discrete & Computational Geometry* 7(1):45–58, 1992

*Mathematical Reviews* 92k:52026

http://www.ics.uci.edu/~eppstein/pubs/EppOveRot-DCG-92.pdf

Cited by:

- Finding $k$ points with minimum diameter and related problems
- Counting $k$-subsets and convex $k$-gons in the plane
- Geometric knapsack problems
- Stacks, queues, and deques with order-statistic operations
- A (usually?) connected subgraph of the minimum weight triangulation
- Counting convex polygons in planar point sets
- Sequential and parallel algorithms for finding a maximum convex polygon
- On minimum-area hulls
- Resource-constrained geometric network optimization
- Finding minimum area simple pentagons
- Generalized LMT-skeleton heuristics for several new classes of optimal triangulations
- Area optimization of simple polygons
- On simple polygonalizations with optimal area
- LMT-skeleton heuristics for several new classes of optimal triangulations
- On computing new classes of optimal triangulations with angular constraints
- Smallest color-spanning objects
- Smallest nonparametric tolerance regions
- Removing outliers to minimize area and perimeter

Early drafts of this (before the merger with Overmars et al) used the title "Finding the smallest quadrilateral".