THE COMPLEXITY OF INCREMENTAL CONVEX-HULL ALGORITHMS IN RD

被引：40

|

作者：

KALLAY, M ^{[1
]}

机构：

[1] UNIV OKLAHOMA,NORMAN,OK 73019

来源：

INFORMATION PROCESSING LETTERS | 1984年 / 19卷 / 04期

关键词：

D O I：

10.1016/0020-0190(84)90084-X

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：197 / 197

页数：1

相关论文

共 50 条

[1] HOW TO REDUCE THE AVERAGE COMPLEXITY OF CONVEX-HULL FINDING ALGORITHMS
DEVROYE, L
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (04) : 299 - 308
[2] A NOTE ON CONVEX-HULL ALGORITHMS
GHOSH, SK
PATTERN RECOGNITION, 1986, 19 (01) : 75 - 75
[3] EFFICIENT PARALLEL CONVEX-HULL ALGORITHMS
MILLER, R
STOUT, QF
IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (12) : 1605 - 1618
[4] ON THE COMPLEXITY OF FINDING THE CONVEX-HULL OF A SET OF POINTS
AVIS, D
DISCRETE APPLIED MATHEMATICS, 1982, 4 (02) : 81 - 86
[5] AN INCREMENTAL COMPUTATION OF CONVEX-HULL OF PLANAR LINE INTERSECTIONS
BOREDDY, J
PATTERN RECOGNITION LETTERS, 1990, 11 (08) : 541 - 543
[6] Convex-Hull Algorithms: Implementation, Testing, and Experimentation
Gamby, Ask Neve
Katajainen, Jyrki
ALGORITHMS, 2018, 11 (12):
[7] SOME PERFORMANCE TESTS OF CONVEX-HULL ALGORITHMS
ALLISON, DCS
NOGA, MT
BIT, 1984, 24 (01): : 2 - 13
[8] A HISTORICAL NOTE ON CONVEX-HULL FINDING ALGORITHMS
TOUSSAINT, GT
PATTERN RECOGNITION LETTERS, 1985, 3 (01) : 21 - 28
[9] OPTIMAL CONVEX-HULL ALGORITHMS ON ENHANCED MESHES
OLARIU, S
SCHWING, JL
ZHANG, J
BIT, 1993, 33 (03): : 396 - 410
[10] On the Expected Diameter, Width, and Complexity of a Stochastic Convex-hull
Xue, Jie
Li, Yuan
Janardan, Ravi
ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 581 - 592

← 1 2 3 4 5 →