APPROXIMATION ALGORITHMS FOR CONVEX HULLS

被引：69

作者：

BENTLEY, JL

FAUST, MG

PREPARATA, FP

机构：

[1] CARNEGIE MELLON UNIV,DEPT MATH,PITTSBURGH,PA 15213

[2] UNIV ILLINOIS,URBANA,IL 61801

来源：

关键词：

D O I：

10.1145/358315.358392

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：64 / 68

页数：5

共 10 条

[1] DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME [J].

BENTLEY, JL ;

SHAMOS, MI .

[2]

BROWN KQ, 1979, THESIS CARNEGIEMELLO

[3]

DEVROYE L, INFORMATION PROCESSI, V11, P53

[4]

Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2

[5]

Lipton R. J., 1977, 18th Annual Symposium on Foundations of Computer Science, P162, DOI 10.1109/SFCS.1977.6

[6] OPTIMAL REAL-TIME ALGORITHM FOR PLANAR CONVEX HULLS [J].

PREPARATA, FP .

[7] CONVEX HULLS OF FINITE SETS OF POINTS IN 2 AND 3 DIMENSIONS [J].

PREPARATA, FP ;

HONG, SJ .

[8]

Shamos MI, 1978, THESIS YALE U NEW HA

[9]

YAO AC, 1979, STANCS79733 STANF U

[10]

YAO AC, 1977, STANCS77642 STANF U