RED-BLUE INTERSECTION DETECTION ALGORITHMS, WITH APPLICATIONS TO MOTION PLANNING AND COLLISION DETECTION

被引：23

作者：

AGARWAL, PK ^{[1
]}

SHARIR, M ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

来源：

SIAM JOURNAL ON COMPUTING | 1990年 / 19卷 / 02期

关键词：

D O I：

10.1137/0219020

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Let Γ be a collection of n (possibly intersecting) 'red' Jordan arcs of some simple shape in the plane and let Γ′ be a similar collection of m 'blue' arcs. Several efficient algorithms are presented for detecting an intersection between an arc of Γ and arc of Γ′.

引用

页码：297 / 321

页数：25

共 37 条

[1] AGARWAL P, 1987, 332 NEW YORK U DEP C
[2] AGARWAL P, IN PRESS J COMBIN A
[3] AGARWAL PK, 1989, 5TH P ACM S COMP GEO, P11
[4] ALEVIZOS P, 1988, UNPUB BOUNDARY UNION
[5] [Anonymous], 1988, THEORETICAL FDN COMP
[6] SOME DYNAMIC COMPUTATIONAL GEOMETRY PROBLEMS
ATALLAH, MJ
[J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1985, 11 (12) : 1171 - 1181
[7] BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432
[8] Chazelle B., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P590, DOI 10.1109/SFCS.1988.21975
[9] CHAZELLE B, 1985, LECTURE NOTES COMPUT, P145
[10] CHAZELLE B, 1988, UNPUB ALGORITHMS BIC

← 1 2 3 4 →