SOME TECHNIQUES FOR GEOMETRIC SEARCHING WITH IMPLICIT SET REPRESENTATIONS

被引：8

作者：

CHAZELLE, B

机构：

[1] Department of Computer Science, Princeton University, Princeton, 08544, NJ, United States

来源：

ACTA INFORMATICA | 1987年 / 24卷 / 05期

关键词：

D O I：

10.1007/BF00263295

中图分类号：

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

学科分类号：

0812 ;

摘要：

COMPUTER PROGRAMMING

引用

页码：565 / 582

页数：18

共 34 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9

[3] THE POWER OF GEOMETRIC DUALITY [J].

CHAZELLE, B ;

GUIBAS, LJ ;

LEE, DT .

BIT, 1985, 25 (01) :76-90

[4] FILTERING SEARCH - A NEW APPROACH TO QUERY-ANSWERING [J].

CHAZELLE, B .

SIAM JOURNAL ON COMPUTING, 1986, 15 (03) :703-724

[5]

CHAZELLE B, 1985, LECT NOTES COMPUT SC, V185, P145

[6]

CHAZELLE B, 1986, FRACTIONAL CASCADI 2, V1, P163

[7]

Chazelle B., 1985, P ACM S COMPUTATIONA, P125

[8] MINIMUM VERTEX DISTANCE BETWEEN SEPARABLE CONVEX POLYGONS [J].

CHIN, F ;

WANG, CA .

INFORMATION PROCESSING LETTERS, 1984, 18 (01) :41-45

[9]

Cole R., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P255, DOI 10.1109/SFCS.1984.715923

[10] GEOMETRIC RETRIEVAL PROBLEMS [J].

COLE, R ;

YAP, CK .

INFORMATION AND CONTROL, 1984, 63 (1-2) :39-57

← 1 2 3 4 →