摘要
着重分析了填充扫描轨迹算法,和以牺牲空间为代价的时间优化算法。提出了一种轮廓线线段主动搜索扫描线的填充思想,较大程度地提高了填充扫描速度。同时给出了两种算法的性能比较和实例运行效果,为自主开发RP软件技术作了有益的尝试。
The paper analyzes the filling scan algorithm in rapid prototyping（ RP）, puts forward a minimum time path algorithm that is at the price of sacrificing space and presents the performances and in- stances of the two algorithms, which will lead to China＇s own development of RP software. The filling is done in the way that contour line sections actively search for scan paths, a way which greatly increases the filling scan speed.
出处
《机械科学与技术》
CSCD
北大核心
2006年第9期1038-1041,共4页
Mechanical Science and Technology for Aerospace Engineering
基金
四川省教育厅基金项目(2003B021)资助
关键词
快速成形
扫描填充
轮廓线
rapid prototyping
filling scan algorithm
contour line
