An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon.

T. C. Hu M. T. Shing An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon. 122-138 1981 2 J. Algorithms 2 db/journals/jal/jal2.html#HuS81