DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME

被引:65
作者
BENTLEY, JL
SHAMOS, MI
机构
[1] Departments of Computer Science and Mathematics, Carnegie-Mellon University, Pittsburgh
关键词
Average-case analysis; computational geometry; convex hull; divide-and-conquer; expected time; linear programming; random sets;
D O I
10.1016/0020-0190(78)90051-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:87 / 91
页数:5
相关论文
共 18 条
  • [1] Carnal, Die konvexe Hülle von n rotationssymmetrische verteilten Punkten, Z. Wahrscheinlichkeits, 15, pp. 168-176, (1970)
  • [2] Eddy, A new convex hull algorithm for planar sets, ACM Transactions on Mathematical Software, (1977)
  • [3] Efron, The convex hull of a random set of points, Biometrika, 52, pp. 331-344, (1965)
  • [4] Graham, An efficient algorithm for determining the convex hull of a planar set, Information Processing Lett., 1, pp. 132-133, (1972)
  • [5] Jarvis, On the identification of the convex hull of a finite set of points in the plane, Information Processing Lett., 2, pp. 18-21, (1973)
  • [6] Kendall, Moran, Geometrical Probability, (1963)
  • [7] Preparata, Hong, Convex hulls of finite sets of points in two and three dimensions, CACM, 20, 2, pp. 87-93, (1977)
  • [8] Raynaud, Sur l'enveloppe convexe des nuages des points aléatoires dans R<sub>n</sub>, I, Journal of Applied Probability, 7, pp. 35-48, (1970)
  • [9] Renyi, Sulanke, Über die konvexe Hülle von n zufallig gewahlten Punkten I, Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete, 2, pp. 75-84, (1963)
  • [10] Renyi, Sulanke, Über die konvexe Hülle von n zufallig gewahlten Punkten II, Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete, 3, pp. 138-147, (1964)