CONSTRUCTING BELTS IN TWO-DIMENSIONAL ARRANGEMENTS WITH APPLICATIONS

被引：67

作者：

EDELSBRUNNER, H

WELZL, E

机构：

来源：

关键词：

D O I：

10.1137/0215019

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：271 / 284

页数：14

共 23 条

[1]

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

[2]

BENTLEY JL, 1979, COMPUT SURV, V11, P397, DOI 10.1145/356789.356797

[3] DECOMPOSABLE SEARCHING PROBLEMS [J].

BENTLEY, JL .

[4]

BROWN KQ, 1980, CMUCS80101 CARN U DE

[5]

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

[6]

COLE R, 1984, 117 NEW YORK U DEP C

[7]

COLE R, 1984, 16TH P ANN SIGACT S, P154

[8]

DOBKIN DP, COMMUNICATION

[9] POLYGONAL INTERSECTION SEARCHING [J].

EDELSBRUNNER, H ;

MAURER, HA ;

KIRKPATRICK, DG .

[10] ON THE NUMBER OF LINE SEPARATIONS OF A FINITE-SET IN THE PLANE [J].

EDELSBRUNNER, H ;

WELZL, E .