凹多边形凸分解算法在快速原型中的应用  

The application of concave polygon convex decomposition algorithm to rapid prototyping

作　　者：朱传敏[1] 唐珺[1] 许田贵[1] 

机构地区：[1]同济大学机械工程学院,上海201804

出　　处：《现代制造工程》2010年第2期53-56,共4页Modern Manufacturing Engineering

基　　金：上海市示范实验中心资助项目

摘　　要：快速原型是近年来兴起的一项新技术,而扫描路径规划是其核心问题之一。在众多路径生成算法中,分区式扫描由于在制件精度和效率上存在着诸多优势,逐渐成为应用最为广泛的算法。将计算机图形学中的凹多边形凸分解方法应用到分区算法中,将复杂的情形化繁为简,避免出现多边形求交的情形,极大地减小了算法的复杂程度。该算法作为快速原型路径生成软件的基本算法,已经在熔融沉积(FDM)快速原型机中应用,提高了制件的精度,缩短了加工时间。Rapid Prototyping （RP） is a newly developed technology in the past a few years. Scanning path planning is one of its core problems. With the major advantages in the parts precision and efficiency, sub-regional path generation method becomes more popular within all of the path generation methods. Concave polygon convex decomposition method of computer graphics is applied to the sub-regional path generation algorithm,in the consideration of requirements of RP, which simplifies the complex conditions and avoids the polygons intersection, therefore largely decreases the algorithm complexity. The algorithm is used as the fundamental algorithm in the FDM RP path generation software,which reduces the production time and enhances the parts precision.

关 键 词：快速原型 凹多边形凸分解 分区扫描 路径规划 

分 类 号：TH16[机械工程—机械制造及自动化]