A fast procedure for computing incremental growth distances

被引:0
|
作者
Hong, SM [1 ]
机构
[1] Kyungpook Natl Univ, Sch Elect & Elect Engn, Taegu 702701, South Korea
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A fast numerical procedure is presented for computing growth distances between a pair of polytopes in R-3 that move incrementally along specified smooth paths. The procedure carrys out the growth distance evaluations efficiently bgl predicting and verifying contact configurations between a pair of grown polytopes. The computation time, in average, is very small and does not depend significantly on the geometric complexity of two polytopes.
引用
收藏
页码:1170 / 1177
页数:8
相关论文
共 50 条