高级检索

点到任意多面体距离的快速计算方法

Algorithm for Fast Calculating the Nearest Distance Between Space Point and Arbitrary Polyhedron

  • 摘要: 提出了一种快速计算空间点到任意多面体的有符号距离的方法.该方法以空间点为中心,采用动态球搜索技术,能够快速准确地获得一个含多面体最近体元素在内的候选面片集,而且在一般情况下该候选集都足够小,队而对计算空间点到复杂多面体的最近距离起到明显的加速作用.与采用层次结构表示的方法相比,此方法避免了频繁计算点到各层次结构的距离.本算法可应用在需大量距离计算的环境,如距离场计算、虚拟环境下的碰撞检测、机器人运动规划及数控加工过程的干涉检查等.

     

    Abstract: The algorithm uses dynamic sphere searching technology which takes the given point as sphere center.A potential facet set can be found quickly and accurately and this set is compact enough to accelerate the distance calculation greatly.Compared with the hierarchical presentation approach,this algorithm avoids frequently calculating the distance between the point and hierarchical structure,thus being suitable to be applied to the cases where a great deal of distance calculations are needed,such as distance fields calculation,collision detection in virtual environment and interference test of robots and NC machining.

     

/

返回文章
返回