FAST DETECTION OF POLYHEDRAL INTERSECTION

被引：100

作者：

DOBKIN, DP ^{[1
]}

KIRKPATRICK, DG ^{[1
]}

机构：

[1] UNIV BRITISH COLUMBIA,DEPT COMP SCI,VANCOUVER V6T 1W5,BC,CANADA

来源：

关键词：

D O I：

10.1016/0304-3975(82)90120-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：241 / 253

页数：13

共 11 条

[1] Dantzig G. B., 1963, LINEAR PROGRAMMING I
[2] Dobkin D., 1980, ACM S THEOR COMP, P146
[3] Dobkin D. P., 1980, 21st Annual Symposium on Foundations of Computer Science, P200, DOI 10.1109/SFCS.1980.18
[4] KIRKPATRICK DG, 1980, OPTIMAL SEARCH PLANA
[5] MULLER DE, 1977, FINDING INTERSECTION
[6] MAINTENANCE OF CONFIGURATIONS IN THE PLANE
OVERMARS, MH
VANLEEUWEN, J
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 23 (02) : 166 - 204
[7] OVERMARS MH, 1981, RUUCS819 U UTR DEP C
[8] Shamos Michael I., 1978, THESIS YALE U
[9] WARNOCK JE, 1969, HIDDEN SURFACE ALGOR
[10] WATKINS GS, 1970, UTECCSC70101 U UT CO