Geometric medians
暂无分享,去创建一个
[1] A. Rényi,et al. über die konvexe Hülle von n zufällig gewählten Punkten , 1963 .
[2] Regina Y. Liu. On a Notion of Data Depth Based on Random Simplices , 1990 .
[3] Richard Cole,et al. On k-Hulls and Related Problems , 1987, SIAM J. Comput..
[4] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[5] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..
[6] Raimund Seidel,et al. Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..
[7] Bernard Chazelle,et al. On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.
[8] D. Gale. 15. Neighboring Vertices on a Convex Polyhedron , 1957 .
[9] Samir Khuller,et al. On a Triangle Counting Problem , 1990, Inf. Process. Lett..
[10] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[11] Z. Füredi,et al. The number of triangles covering the center of an n-set , 1984 .
[12] Imre Bárány,et al. A generalization of carathéodory's theorem , 1982, Discret. Math..
[13] H. Raynaud. Sur L'enveloppe convexe des nuages de points aleatoires dans Rn . I , 1970 .
[14] David G. Kirkpatrick,et al. The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..