Convex Hull Peeling
Given a set of n points in the plane, a method is described for constructing a nested sequence of m < n/2 convex polygons based on the points. If the points are a random sample, it is shown that the convex sets share some of the distributional properties of one-dimensional order statistics. An algorithm which requires 0(n3) time and 0(n2) space is described for constructing the sequence of convex sets.
Key wordsconvex polygon order statistic intersection
Unable to display preview. Download preview PDF.
- Barnett, V. (1976). The ordering of multivariate data. J. R. Statis. Soc. A, 139, 318–354.Google Scholar
- Bebbington, A. C. (1978). A method of bivariate trimming for robust estimation of the correlation coefficient. Appl. Statist. 27, 221–226.Google Scholar
- Eddy, W. F. (1977). A new convex hull algorithm for planar sets. ACM Trans. Math. Software, 3, 398–403.Google Scholar
- Eddy, W. F. (1980). The distribution of the convex hull of a Gaussian sample. J. Appl. Prob., 17, 686–695.Google Scholar
- Eddy, W. F. (1981). Discussion of “Graphics for the Multivariate Two Sample Problem” by J. H. Friedman and L. C. Rafsky, J. Amer. Statist. Assoc., 76, 287–289.Google Scholar
- Eddy, W. F. and J. D. Gale (1981). The convex hull of a spherically symmetric sample. Adv. Appl. Prob., 13, 751–763.Google Scholar
- Graham, R. L. (1972). An efficient algorithm for determining the convex hull of a planar set. Inform. Proc. Letters, 1, 132–133.Google Scholar
- Green, P. J. (1980). Peeling bivariate data. Proc. Sheffield Conf. Multivariate Data Analysis, Chapter 1, 3–19.Google Scholar
- Matheron, G. (1975). Random Sets and Integral Geometry, Wiley, New York.Google Scholar
- Tukey, J. W. (1975). Mathematics and the picturing of data. Proc. Int. Cong. Math., Vancouver, 1974, Vol. 2, 523–531.Google Scholar