Estimation of a Convex Density Contour in Two Dimensions
研究了在二维密度具有凸轮廓线时，如何通过样本点找到包含比例α的最小面积凸多边形来估计该轮廓，并给出了O(n²)空间和O(n³)时间的算法。
Abstract If a density in two dimensions has a convex contour containing probability α, the contour may be estimated from a sample by finding the convex polygon of smallest area containing a proportion α of the sample points. An algorithm for finding a particular contour is given that takes O(n 2) space and O(n 3) time for n sample points.