A NEW APPROACH TO PLANAR POINT LOCATION

被引：66

作者：

PREPARATA, FP

机构：

[1] UNIV ILLINOIS,DEPT ELECT ENGN,URBANA,IL 61801

[2] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

关键词：

D O I：

10.1137/0210035

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：473 / 482

页数：10

共 17 条

[1] BENTLEY JL, 1979, INFORM PROCESS LETT, V8, P133
[2] DECOMPOSABLE SEARCHING PROBLEMS
BENTLEY, JL
[J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 244 - 251
[3] BENTLEY JL, UNPUBLISHED
[4] BENTLEY JL, 1977, MULTIDIMENSIONAL DIV
[5] PARALLEL EVALUATION OF ARITHMETIC EXPRESSIONS WITHOUT DIVISION
BRENT, R
KUCK, D
MARUYAMA, K
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1973, C 22 (05) : 532 - 534
[6] Dobkin D., 1976, SIAM Journal on Computing, V5, P181, DOI 10.1137/0205015
[7] TRIANGULATING A SIMPLE POLYGON
GAREY, MR
JOHNSON, DS
PREPARATA, FP
TARJAN, RE
[J]. INFORMATION PROCESSING LETTERS, 1978, 7 (04) : 175 - 179
[8] KIRKPATRICK DG, 1979, OPTIMAL SEARCH PLANA
[9] Knuth D. E., 1969, ART COMPUTER PROGRAM, V1
[10] Lee D. T., 1977, SIAM Journal on Computing, V6, P594, DOI 10.1137/0206043