期刊文献+

五轴数控仿真全局干涉检测算法研究 被引量:4

Research on the Global Collision Detection in 5-axis NC Machining Simulation
在线阅读 下载PDF
导出
摘要 针对五轴数控加工复杂曲面的全局干涉问题,提出了一种实时干涉初步检测算法。该算法基于分层方向包围盒以及八叉树空间简化法,采用改进的分离轴理论,通过比较空间多面体在特定轴上投影的距离关系来判别多面体之间是否相交。应用简化的方向包围盒及八叉树结构,当某一节点发生干涉时,才对其子节点进行进一步处理。该改进算法有效降低了空间复杂度,提高了效率。该算法已在某型号五轴数控加工中心仿真系统的全局干涉检测模块中得到应用,通过实验比较,证明了该算法的可行性。 Aiming at the global collision detection in 5 - axis NC machining free- form surfaces, it proposes a new method to primarily detect collision real- timed. This method is based on hierarchical oriented bounding box, octree space predigested method, whether the polyhedrons are intersected by comparing the relationship of the projection of space - polyhedron on axis each other. With the simplified structure of oriented bounding box and octree, if collision is found in one node, its sub - nodes needs to be further processed. It reduces effectively the complexity of the improved algorithm. This algorithm is feasible in global collision detection in 5 - axis NC machining simulation.
作者 朱聃 张丽艳
出处 《中国制造业信息化(学术版)》 2007年第1期57-59,63,共4页
关键词 方向包围盒 八叉树 全局干涉检测 五轴数控仿真 OBB Octree Global Collision Detection 5 - axis NC Machining Simulation
  • 相关文献

参考文献6

二级参考文献25

  • 1魏迎梅,王涌,吴泉源,石教英.碰撞检测中的层次包围盒方法[J].计算机应用,2000,20(S1):241-244. 被引量:39
  • 2S Gottschalk M C,Lin D Manocha. OBBTree:A Hierarchical Structure for Rapid Interference Detection[C].In:Proceedings of SIGGRAPH' 96,1996:171~180.
  • 3E G Gilbert,D W Johnson,S S Keerthi.A fast Procedure for computing the distance between complex Objects in Three-Dimensional Space[J].IEEE Journal of Robotics and Automation,1988;4(2):193~203.
  • 4G van den Bergen.A fast and Robust GJK implementation for collision detection for convex objects[J].Journal of Graphics tools, 1997.
  • 5M Lin,J Canny.A fast algorithm for incremental distance calculation[C].In:IEEE Int Conf Robot Automat,Sacramento,CA, 1991:1008~1014.
  • 6Y Sato,M Hirata,T Maruyama et al.Efficient Collision Detection using Fast Distance-Calculation Algorithms for Convex and Non-Convex Objects[C].In:Proceedings for the 1996 IEEE International Conference on Robotics and Automation Minneapolis,Minnesota-April, 1996:771~778.
  • 7S Cameron.Enhancing GJK:Computing minimum and penetration distances between convex pllyhedra[C].In:Proc IEEE Int Conf On Robotics and Automation, 1997: 3112~3117.
  • 8Katsuaki Kawachi, Hiromasa Suzuki. Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions[C].In: Geometric Modeling and Processing, Hong Kong, China,2000.
  • 9Stephen Cameron. A Comparison of Two Fast Algorithms for Computing the Distance Between Convex Polyhedra[J].IEEE transactions on robotics and automation, 1997; 13 (6).
  • 10S.Ding,M.A.Mannan,A.N.Poo.Oriented bounding box and octree based global interference detection in 5-axis machining of free-form surfaces[J].Computer-Aided Design,2004,36:1281-1294.

共引文献89

同被引文献24

引证文献4

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部