A LINEAR ALGORITHM FOR DETERMINING THE SEPARATION OF CONVEX POLYHEDRA

被引：118

作者：

DOBKIN, DP

KIRKPATRICK, DG

机构：

[1] PRINCETON UNIV,DEPT ELECT ENGN & COMP SCI,PRINCETON,NJ 08544

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

来源：

关键词：

D O I：

10.1016/0196-6774(85)90007-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：381 / 392

页数：12

共 16 条

[1] CHAZELLE B, 1980, 12TH P ANN ACM S THE, P146
[2] CHIN F, 1982, TR828 U ALB DEP COMP
[3] FAST DETECTION OF POLYHEDRAL INTERSECTION
DOBKIN, DP
KIRKPATRICK, DG
[J]. THEORETICAL COMPUTER SCIENCE, 1983, 27 (03) : 241 - 253
[4] DOBKIN DP, UNPUB FAST ALGORITHM
[5] DYER ME, UNPUB O N ALGORITHM
[6] DYER ME, UNPUB SIMPLIFIED O N
[7] EDELSBRUNNER H, 1982, 96 TU GRAZ I INF REP
[8] Grunbaum B, 1967, CONVEX POLYTOPES
[9] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364
[10] OPTIMAL SEARCH IN PLANAR SUBDIVISIONS
KIRKPATRICK, D
[J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 28 - 35