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.
No takes yet. Share an insight, caveat, or question.
J. A. Hartigan (1987) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: