New algorithms for minimum area $k$-gons

David Eppstein
Proc. 3rd Symp. Discrete Algorithms, ACM and SIAM, Jan 1992, pp. 83–86
Tech. report 91-59, Univ. of California, Irvine, Dept. of Information and Computer Science, 1991

Cited by:

• Computing the smallest $k$-enclosing circle and related problems
• Stacks, queues, and deques with order-statistic operations
• Finding subsets maximizing minimum structures
• Spanning trees — short or small
• Counting convex polygons in planar point sets
• Finding minimum area simple pentagons
• Smallest nonparametric tolerance regions
• Minimum area polygons with two reflex angles enclosing $k$ points
• Removing outliers to minimize area and perimeter

Journal version is included in "Iterated nearest neighbors".