摘要
充分考虑路径排序问题的一般性,建立了快速成形中扫描填充加工路径排序优化问题的两种完整数学计算模型,提出并证明了路径的遍历策略及简化定理。引入路径潜在起点的概念,设计了基于所有路径潜在起点(而非仅仅原始起点)的全局贪婪搜索求解算法。该算法不仅适用于所有路径排序问题,而且因为扩大了搜索范围,避免了一般贪婪算法对路径内节点初始排列次序的依赖性,求出了路径排序问题的全局更优解。
Two mathematical models were presented for paths ordering problem （POP） in rapid prototyping （RP）, considering universality of POP. Theorems were also presented and proved for how to traverse a path and predigest a non-loop-path. After conception of potential start-point had been brought in, a global greedy method for paths ordering problem （GGM-POP） was designed based on potential start-points （not only original start point） of all paths. Better global result can be brought out by this algorithm, which fits all POP and largely expands search boundary and avoids dependency on original order of point in a path.
出处
《中国机械工程》
EI
CAS
CSCD
北大核心
2008年第3期317-320,共4页
China Mechanical Engineering
基金
湖北省自然科学基金资助项目(2004ABC001)
关键词
快速成形
扫描填充
路径排序
潜在起点
贪婪算法
rapid prototyping
scanning and filling
paths ordering
potential start- point
greedy algorithm
