Uses dynamic programming to choose sets of k
points optimizing various criteria on the quality of their convex hull
(in particular area). The time complexity (cubic in
Co-authors – Publications – David Eppstein – Theory Group – Inf. & Comp. Sci. – UC Irvine
Semi-automatically filtered from a common source file.