A note on linear expected time algorithms for finding convex hulls
暂无分享,去创建一个
[1] H. Carnal. Die konvexe Hülle von n rotationssymmetrisch verteilten Punkten , 1970 .
[2] William F. Eddy,et al. A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.
[3] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[4] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[5] Michael Ian Shamos,et al. Divide and Conquer for Linear Expected Time , 1978, Information Processing Letters.
[6] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[7] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[8] Bruce W. Weide,et al. Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.
[9] H. T. Kung,et al. On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.
[10] Luc Devroye,et al. How to reduce the average complexity of convex hull finding algorithms , 1981 .
[11] Selim G. Akl,et al. A Fast Convex Hull Algorithm , 1978, Inf. Process. Lett..
[12] Luc Devroye. A Note on Finding Convex Hulls Via Maximal Vectors , 1980, Inf. Process. Lett..
[13] P. A. P. Moran,et al. An introduction to probability theory , 1968 .
[14] Ray A. Jarvis,et al. On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..
[15] J. Kiefer,et al. Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator , 1956 .
[16] Luc Devroye,et al. Average time behavior of distributive sorting algorithms , 1981, Computing.