ON THE COMPUTER-GENERATION OF RANDOM CONVEX HULLS

被引:5
作者
DEVROYE, L
机构
关键词
D O I
10.1016/0898-1221(82)90035-9
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:1 / 13
页数:13
相关论文
共 34 条
[1]   COMPUTER METHODS FOR SAMPLING FROM GAMMA, BETA, POISSON AND BINOMIAL DISTRIBUTIONS [J].
AHRENS, JH ;
DIETER, U .
COMPUTING, 1974, 12 (03) :223-246
[2]  
AHRENS JH, 1980, COMPUTING, V25
[3]   DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME [J].
BENTLEY, JL ;
SHAMOS, MI .
INFORMATION PROCESSING LETTERS, 1978, 7 (02) :87-91
[4]  
Best D. J., 1978, COMPSTAT 1978 Proceedings in Computational Statistics, P341
[5]  
Best D. J., 1978, APPL STAT, V29, P181
[6]   CONVEX HULLS OF POINTS DISTRIBUTED BY ROTATIONAL SYMMETRY [J].
CARNAL, H .
ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1970, 15 (02) :168-&
[8]   AVERAGE TIME BEHAVIOR OF DISTRIBUTIVE SORTING ALGORITHMS [J].
DEVROYE, L ;
KLINCSEK, T .
COMPUTING, 1981, 26 (01) :1-7
[9]   GENERATING THE MAXIMUM OF INDEPENDENT IDENTICALLY DISTRIBUTED RANDOM-VARIABLES [J].
DEVROYE, L .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1980, 6 (03) :305-315
[10]   ON THE AVERAGE COMPLEXITY OF SOME BUCKETING ALGORITHMS [J].
DEVROYE, L .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (05) :407-412