面向快速制造扫描分区的凹多边形凸分解算法  

New concave polygon convex decomposition algorithm for rapid prototyping subarea scanning

作　　者：卞宏友[1] 刘伟军[1] 王天然[1] 赵吉宾[1] 

机构地区：[1]中国科学院沈阳自动化研究所

出　　处：《计算机应用》2005年第9期2143-2145,共3页journal of Computer Applications

基　　金：国家863计划资助项目(2001AA421160)

摘　　要：提出了一个面向快速成型扫描路径规划的凹多边形凸分解算法。首先应用所提出的基于正负法搜索凹点对应的可见点的新算法来找出凹点的可见点串,然后结合所提出的适用于快速制造中扫描分区的剖分准则,利用权函数选择最佳剖分点,并合理使用辅助点,保证了剖分所得凸多边形的形态质量。该算法作为快速成形选区环形扫描路径规划软件的底层算法,在对待扫描的层面轮廓进行分区时得到了应用。A new concave polygon convex decomposition algorithm for rapid prototyping subarea scanning was proposed. The visible point chain of reflex point basic on the plus-minus method was found, and the related decomposition regulations aimed to the subarea of rapid prototyping scanning were presented. The best link point was selected by using the weight function or adopting the assistant point according to those regulations, and the acquired convex polygon shape quality was effectively advanced. The algorithm, as the bottom algorithm of the rapid prototyping scanning software system, has been applied to zone the profiled outline.

关 键 词：凹多边形 凸分解 正负法 可见点 快速成型 分区扫描 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]