QUASI-OPTIMAL RANGE SEARCHING IN SPACES OF FINITE VC-DIMENSION

被引:106
作者
CHAZELLE, B [1 ]
WELZL, E [1 ]
机构
[1] FREE UNIV BERLIN,DEPT MATH,D-1000 BERLIN 33,FED REP GER
关键词
D O I
10.1007/BF02187743
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:467 / 489
页数:23
相关论文
共 24 条
[1]  
ALON N, 1987, 3RD P S COMP GEOM WA, P331
[2]  
[Anonymous], 1987, EATCS MONOGRAPHS THE
[3]   DENSITY AND DIMENSION [J].
ASSOUAD, P .
ANNALES DE L INSTITUT FOURIER, 1983, 33 (03) :233-282
[4]  
CHAZELLE B, 1985, 1ST P ACM S COMP GEO, P135
[5]  
CHAZELLE B, IN PRESS J AM MATH S
[6]   FAST DETECTION OF POLYHEDRAL INTERSECTION [J].
DOBKIN, DP ;
KIRKPATRICK, DG .
THEORETICAL COMPUTER SCIENCE, 1983, 27 (03) :241-253
[7]   CENTRAL LIMIT-THEOREMS FOR EMPIRICAL MEASURES [J].
DUDLEY, RM .
ANNALS OF PROBABILITY, 1978, 6 (06) :899-929
[8]   HALFPLANAR RANGE SEARCH IN LINEAR-SPACE AND O(N0.695) QUERY TIME [J].
EDELSBRUNNER, H ;
WELZL, E .
INFORMATION PROCESSING LETTERS, 1986, 23 (06) :289-293
[9]  
EDELSBRUNNER H, 1988, 4TH P ACM S COMP GEO, P56
[10]   LOWER BOUNDS ON THE COMPLEXITY OF SOME OPTIMAL DATA-STRUCTURES [J].
FREDMAN, ML .
SIAM JOURNAL ON COMPUTING, 1981, 10 (01) :1-10