Fractional Cascading: II. Applications

被引：88

作者：

Chazelle, Bernard ^{[3
,4
]}

Guibas, Leonidas J. ^{[1
,2
]}

机构：

[1] DEC, Syst Res Ctr, Palo Alto, CA 94301 USA

[2] Stanford Univ, Stanford, CA 94305 USA

[3] Brown Univ, Providence, RI 02912 USA

[4] Ecole Normale Super, Paris, France

来源：

ALGORITHMICA | 1986年 / 1卷 / 1-4期

关键词：

Fractional cascading; Iterative search; Multiple look-up; Binary search; B-tree; Range query; Dynamization of data structures;

D O I：

10.1007/BF01840441

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper presents several applications of fractional cascading, a new searching technique which has been described in a companion paper. The applications center around a variety of geometric query problems. Examples include intersecting a polygonal path with a line, slanted range search, orthogonal range search, computing locus functions, and others. Some results on the optimality of fractional cascading, and certain extensions of the technique for retrieving additional information are also included.

引用

页码：163 / 191

页数：29

共 32 条

[1]

[Anonymous], P 1 ACM S COMP GEOM

[2]

BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628

[3] MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J].

BENTLEY, JL .

COMMUNICATIONS OF THE ACM, 1980, 23 (04) :214-229

[4]

BENTLEY JL, 1980, J ALGORITHMS, V0001, P00301

[5]

BENTLEY JL, 1977, P 15 ALL C COMM CONT, P193

[6]

CHAZELLE B, 1986, P 2 ACM S C IN PRESS

[7]

CHAZELLE B, 1985, BIT, V25, P1

[8]

CHAZELLE B, 1985, INFORM CONTROL

[9]

CHAZELLE B, 1984, CS8411 BROWN U

[10]

CHAZELLE B, 1983, P 24 ANN S FDN COMP, P122

← 1 2 3 4 →