PERFORMANCE ANALYSIS OF CELL BASED GEOMETRIC FILE ORGANIZATIONS

被引：4

作者：

TAMMINEN, M

机构：

来源：

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING | 1983年 / 24卷 / 02期

关键词：

D O I：

10.1016/0734-189X(83)90041-5

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：160 / 181

页数：22

共 28 条

[1]

AHUJA N, 1981, COMPUT SURV, V13, P373, DOI 10.1145/356859.356861

[2] OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS [J].

BENTLEY, JL ;

WEIDE, BW ;

YAO, AC .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04) :563-580

[3]

BENTLEY JL, 1978, CMUCS78135 CARN MELL

[4]

Bently J. L., 1975, Information Processing Letters, V3, P170, DOI 10.1016/0020-0190(75)90034-4

[5]

COOK BG, 1978, P ADV STUDY S TOPOLO

[6]

Fagin R., 1979, ACM Transactions on Database Systems, V4, P315, DOI 10.1145/320083.320092

[7]

FRANKLIN WR, 1980, ACM COMPUTER GRAPHIC, V14, P117

[8] ELIMINATING HIDDEN EDGES IN LINE DRAWINGS [J].

GRIFFITHS, JG .

[9]

HARDING EF, 1974, STOCHASTIC GEOMETRY

[10]

Mantyla M., 1983, Computer Graphics, V17, P279, DOI 10.1145/964967.801159