期刊文献+

电子束快速成型复合扫描填充算法的实现 被引量:1

Realization of composite filling method in electron beam rapid prototyping
下载PDF
导出
摘要 电子束快速成型技术是电子束加工技术与快速成型技术结合产生的一种新技术,但目前在国内外基于电子束的金属零件快速制造工艺研究方面的报道比较少。在此对现有的二维截面造型的扫描填充方法进行了深入分析,对于复杂的截面轮廓,提出了轮廓偏置和分区扫描相结合的复合扫描填充算法。新的算法依据优化规则先将整个层面分为若干个连贯的小区域,然后在每个小区域内采用轮廓偏置填充,这种新算法具有轮廓偏置扫描精确度高和分区扫描高效稳定的特点,可以适用于多种快速成型工艺,并通过实例证明提出的算法是稳定可靠的。 Electron beam rapid prototyping technology is a novel processing method which can be considered as the combination of electron beam processing and rapid prototyping manufacturings.However,only few related research works have been reported around the world.None has been published at home.Through in-depth research and analysis for the existing technique of scanning and fill algorithm,a novel composite filling algorithm,which combined contours offsetting and region fill algorithm,has been put forward.The present way can make use of the properly of high accuracy and efficiency in contours offsetting and region fill algorithm.And it is adaptive for various technics in RP&M.In order to implement the proposed method,the slicing layer is divided into several small regions according to optimization rule,and contours offsetting is adopted in each small region.The group algorithm of intersections, which reduced the process of partition and increased the efficiency, is also used to realize the region fill algorithm.
出处 《电焊机》 北大核心 2011年第10期39-41,61,共4页 Electric Welding Machine
关键词 电子束快速成型 复合扫描 填充算法 electron beam rapid prototyping composite scanning fill algorithm
  • 相关文献

参考文献6

二级参考文献15

  • 1Farouki R T, et al. Offset curves in layered manufacturing[J]. Manufacturing Science and Engineering, 1994, (2).
  • 2Lee D T. Medial Axis Transformation of a planar shape[J].IEEE Trans. on PAMI, 1982,4(4) :363-369.
  • 3Held M. On the Computational Geometry of Pocket Machining[M]. Vol. 500 of Lecture Notes in Computer Science,Springer, Berlin, 1991.
  • 4Aggarwal A, et al. A linear-time algorithm for computing the voronoi diagram of a convex polygon[J]. DIscrete Computer Geometry, 1989,4(6) :591-604.
  • 5Devillers O. Randomization yields simple O(n logn) algorithms for difficult Ω(n) problems[J]. International Journal of Computer Geometry and Applications, 1992, 2(1).
  • 6Chin F, et al. Finding the medial axis of a simple polygon in linear time[A]. Proceeding of the 7^th Canadian Conference on Computer Geometry[C], Quebec City, Canada, 1995.
  • 7Srinivasan V and Nackman R. Voronoi diagrams for multi-ply-connected polygon domains-1 Algorithm[J]. IBM Journal of Research and Development, 1987, 31(3): 361-372.
  • 8Held M. Voronoi diagrams and offset curves of curvilinear polygons[J]. Computer-Aided Design, 1998, 30:287-300.
  • 9严蔚敏,数据结构(C语言版),1997年
  • 10Xue Yan,computer Aided Design,1996年,28卷,4期,307页

共引文献41

同被引文献4

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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