期刊文献+

坯料网格边界延展及规则化算法

Extension and Regularization Method Based on the Boundary of Blank Mesh
下载PDF
导出
摘要 提出了一种毛坯边界非等距外延方法,即将毛坯边界节点非等距外延后,利用NURBS曲线拟合技术生成等距的新毛坯边界,再用NURBS曲面蒙皮算法生成平面,然后通过网格生成算法将生成平面离散成网格,最后用一种基于协方差矩阵特征值的坯料边界规则化算法来得到具有规则形状的坯料。 An indirect algorithm based on the discrete boundary point of extended blank was presented. The boundary points of new blank were obtained by non-uniform extension of the boundary discrete points of original blank, and then the boundary curve and the new blank surface were found by NURBS technology. At the same time, an optimized algorithm for complex boundary was provided to reduce the complexity of industrial production.
出处 《中国机械工程》 EI CAS CSCD 北大核心 2007年第5期594-596,共3页 China Mechanical Engineering
基金 国家自然科学基金资助重点项目(19832020) 国家杰出青年科学基金资助项目(10125208)
关键词 非等距外延 非均匀有理B样条 有限元网格 优化规则算法 non-uniform extension NURBS finite element mesh optimal regularization method
  • 相关文献

参考文献4

二级参考文献14

  • 1魏迎梅,王涌,吴泉源,石教英.碰撞检测中的层次包围盒方法[J].计算机应用,2000,20(S1):241-244. 被引量:38
  • 2王凯华,肖祥芷,肖景容.确定拉深件合理毛坯形状理论方法的发展现状[J].模具技术,1995(4):3-8. 被引量:8
  • 3常志华,吕亚清,姜奎华.矩形盒毛坯合理形状的确定[J].锻压技术,1990,15(3):16-23. 被引量:4
  • 4S Gottschalk M C,Lin D Manocha. OBBTree:A Hierarchical Structure for Rapid Interference Detection[C].In:Proceedings of SIGGRAPH' 96,1996:171~180.
  • 5E 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.
  • 6G van den Bergen.A fast and Robust GJK implementation for collision detection for convex objects[J].Journal of Graphics tools, 1997.
  • 7M Lin,J Canny.A fast algorithm for incremental distance calculation[C].In:IEEE Int Conf Robot Automat,Sacramento,CA, 1991:1008~1014.
  • 8Y 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.
  • 9S Cameron.Enhancing GJK:Computing minimum and penetration distances between convex pllyhedra[C].In:Proc IEEE Int Conf On Robotics and Automation, 1997: 3112~3117.
  • 10Katsuaki 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.

共引文献101

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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