DYNAMIC ORTHOGONAL SEGMENT INTERSECTION SEARCH

被引：29

作者：

IMAI, H ^{[1
]}

ASANO, T ^{[1
]}

机构：

[1] UNIV TOKYO,FAC ENGN,DEPT MATH ENGN & INSTRUMENTAT PHYS,TOKYO 113,JAPAN

来源：

关键词：

D O I：

10.1016/0196-6774(87)90024-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 18

页数：18

共 22 条

[1] DECOMPOSABLE SEARCHING PROBLEMS [J].

BENTLEY, JL .

[2]

Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P122, DOI 10.1109/SFCS.1983.17

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

CHAZELLE, B .

[4]

EDELSBRUNNER H, 1980, 59 TU GRAZ I INF REP

[5] A LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION [J].

GABOW, HN ;

TARJAN, RE .

[6]

GABOW HN, 1983, 15TH P ANN ACM S THE, P246

[7]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P294, DOI 10.1137/0202024

[8] EFFICIENT ALGORITHMS FOR GEOMETRIC GRAPH SEARCH PROBLEMS [J].

IMAI, H ;

ASANO, T .

[9]

IMAI H, 1983, RMI8305 U TOK DEP MA

[10]

IMAI H, 1984, CAS84115 I EL COMM E