A PRACTICAL DIVIDE-AND-CONQUER ALGORITHM FOR THE RECTANGLE INTERSECTION PROBLEM

被引：20

作者：

GUTING, RH

SCHILLING, W

机构：

来源：

关键词：

D O I：

10.1016/0020-0255(87)90018-1

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：95 / 112

页数：18

共 15 条

[1]

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

[2]

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

[3]

CHAZELLE BM, 1983, CS8315 BROWN U DEP C

[4] BATCHED DYNAMIC SOLUTIONS TO DECOMPOSABLE SEARCHING PROBLEMS [J].

EDELSBRUNNER, H ;

OVERMARS, MH .

[5]

EDELSBRUNNER H, 1983, INT J COMPUT MATH, V13, P221, DOI 10.1080/00207168308803365

GUTING, RH .

[7] FINDING RECTANGLE INTERSECTIONS BY DIVIDE-AND-CONQUER [J].

GUTING, RH ;

WOOD, D .

[8]

HON RW, 1983, CMUCS83170 CARN U

[9]

LAUTHER U, 1981, 18TH P DES AUT C, P1

[10] PRIORITY SEARCH-TREES [J].

MCCREIGHT, EM .