HALFPLANAR RANGE SEARCH IN LINEAR-SPACE AND O(N0.695) QUERY TIME

被引：47

作者：

EDELSBRUNNER, H ^{[1
]}

WELZL, E ^{[1
]}

机构：

[1] AUSTRIAN COMP SOC,A-8010 GRAZ,AUSTRIA

来源：

关键词：

D O I：

10.1016/0020-0190(86)90088-8

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：289 / 293

页数：5

共 12 条

BENTLEY, JL .

[2]

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

EDELSBRUNNER, H ;

WELZL, E .

[4] POLYGONAL INTERSECTION SEARCHING [J].

EDELSBRUNNER, H ;

MAURER, HA ;

KIRKPATRICK, DG .

[5]

Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933

[6]

Fredman M. L., 1980, 21st Annual Symposium on Foundations of Computer Science, P191, DOI 10.1109/SFCS.1980.47

[7]

KNUTH DE, 1973, ART COMPUTER PROGRAM, V1, pCH1

[8]

KNUTH DE, 1973, ART COMPUTER PROGRAM, V3, pCH6

[9]

MEGIDDO N, UNPUB J ALGORITHMS

[10]

OVERMARS MH, 1982, INFORM PROCESS LETT, V12, P168