AN O(N2) SHORTEST-PATH ALGORITHM FOR A NON-ROTATING CONVEX BODY

被引:17
作者
HERSHBERGER, J
GUIBAS, LJ
机构
[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
[2] DIGITAL EQUIPMENT CORP,SYST RES CTR,PALO ALTO,CA 94301
关键词
D O I
10.1016/0196-6774(88)90003-X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:18 / 46
页数:29
相关论文
共 11 条
[1]  
AHO AV, 1974, DESIGN ANAL COMPUTER, P207
[2]  
Asano T., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P155, DOI 10.1109/SFCS.1985.65
[3]  
BAKER B, 1985, JUL SIAM C GEOM MOD
[4]  
Chew L.P., 1985, P 1 ANN S COMP GEOM, P214
[5]  
Fredman M. L., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P338, DOI 10.1109/SFCS.1984.715934
[6]  
Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2
[7]  
Guibas L., 1983, 24th Annual Symposium on Foundations of Computer Science, P100, DOI 10.1109/SFCS.1983.1
[8]   ON THE UNION OF JORDAN REGIONS AND COLLISION-FREE TRANSLATIONAL MOTION AMIDST POLYGONAL OBSTACLES [J].
KEDEM, K ;
LIVNE, R ;
PACH, J ;
SHARIR, M .
DISCRETE & COMPUTATIONAL GEOMETRY, 1986, 1 (01) :59-71
[9]   ALGORITHM FOR PLANNING COLLISION-FREE PATHS AMONG POLYHEDRAL OBSTACLES [J].
LOZANOPEREZ, T ;
WESLEY, MA .
COMMUNICATIONS OF THE ACM, 1979, 22 (10) :560-570
[10]  
REIF JH, 1985, CS85121 BRAND U COMP