A DIRECT MINIMIZATION APPROACH FOR OBTAINING THE DISTANCE BETWEEN CONVEX POLYHEDRA

被引:39
作者
BOBROW, JE
机构
关键词
D O I
10.1177/027836498900800304
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
引用
收藏
页码:65 / 76
页数:12
相关论文
共 19 条
[1]  
BOBROW JE, 1988, IEEE J ROBOTIC AUTOM, P443
[2]   AN OVERVIEW OF ANALYTIC SOLID MODELING [J].
CASALE, MS ;
STANTON, EL .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1985, 5 (02) :45-56
[3]  
CHIN F, 1983, IEEE T COMPUT, V32, P1203, DOI 10.1109/TC.1983.1676186
[4]   A LINEAR ALGORITHM FOR DETERMINING THE SEPARATION OF CONVEX POLYHEDRA [J].
DOBKIN, DP ;
KIRKPATRICK, DG .
JOURNAL OF ALGORITHMS, 1985, 6 (03) :381-392
[5]  
FOX RL, 1971, OPTIMIZATION METHODS
[6]  
Gilbert E. G., 1985, IEEE Journal of Robotics and Automation, VRA-1, P21
[7]   A FAST PROCEDURE FOR COMPUTING THE DISTANCE BETWEEN COMPLEX OBJECTS IN 3-DIMENSIONAL SPACE [J].
GILBERT, EG ;
JOHNSON, DW ;
KEERTHI, SS .
IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1988, 4 (02) :193-203
[8]   STRATEGIES FOR SOLVING COLLISION-FREE TRAJECTORIES PROBLEMS FOR MOBILE AND MANIPULATOR ROBOTS [J].
GOUZENES, L .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1984, 3 (04) :51-75
[9]  
Luenberger D., 1968, OPTIMIZATION VECTOR
[10]   ON FAST COMPUTATION OF DISTANCE BETWEEN LINE SEGMENTS [J].
LUMELSKY, VJ .
INFORMATION PROCESSING LETTERS, 1985, 21 (02) :55-61