高级检索
翟晓雅, 陈发来. 分形模型的3D打印路径规划[J]. 计算机辅助设计与图形学学报, 2018, 30(6): 1123-1135. DOI: 10.3724/SP.J.1089.2018.16618
引用本文: 翟晓雅, 陈发来. 分形模型的3D打印路径规划[J]. 计算机辅助设计与图形学学报, 2018, 30(6): 1123-1135. DOI: 10.3724/SP.J.1089.2018.16618
Zhai Xiaoya, Chen Falai. 3D Printing Path Planning of Fractal Models[J]. Journal of Computer-Aided Design & Computer Graphics, 2018, 30(6): 1123-1135. DOI: 10.3724/SP.J.1089.2018.16618
Citation: Zhai Xiaoya, Chen Falai. 3D Printing Path Planning of Fractal Models[J]. Journal of Computer-Aided Design & Computer Graphics, 2018, 30(6): 1123-1135. DOI: 10.3724/SP.J.1089.2018.16618

分形模型的3D打印路径规划

3D Printing Path Planning of Fractal Models

  • 摘要: 为了在保证边缘细节的精度条件下最大限度地提高打印效率,提出了分形模型的3D打印路径规划算法.将分形模型分为3个打印区域:轮廓层,过渡层及内层.针对3个不同的区域采取不同的填充措施.文中算法主要分为以下4个步骤:(1)为了保证边缘细节的精度,利用轮廓平行算法的高保真性填充分形模型的轮廓层.将不同等距线进行特征点检测并设置相应的阈值来优化轮廓层层厚;(2)以过渡层的面积与过渡层内外边界是否相交为条件约束建立优化问题确定过渡层的最优层厚,并确定一条光顺的三次B样条曲线作为过渡层内边界(即内层边界);(3)针对过渡层和内层进行全局连续Fermat螺线填充,并提出Fermat螺线局部优化的算法;(4)将3个区域内部的填充曲线连接进行全局路径优化.实验结果表明,相比于传统的路径规划算法与连续Fermat螺线算法,文中算法具有更高的效率及更好的打印效果,并且适用于具有复杂边界及多连通区域的几何模型.

     

    Abstract: This paper presents a path planning algorithm for printing fractal models which guarantees the accuracy of the boundary details and maximizes the efficiency of 3 D printing process. We divide the printing region into three layers, namely the contour layer, the transitional layer and the inner layer. According to different layers we use different filling processes. The algorithm is comprised of four main steps:(1) adopt offset path for outer layer to ensure the boundary details, and the thickness of the outer layer is optimized by checking the number of feature points in the offset curves under the given threshold value;(2) determine a fair cubic B-spline curve as the boundary between the translation layer and inner layer, and then optimize the layer thickness of the transitional layer;(3) use a single continuous Fermat spiral to fill in the transitional layer and inner layer, and propose a local optimization algorithm for Fermat spiral;(4) optimize the global path in three regions. We provide several examples to demonstrate the effectiveness and the printing quality of our method. Comparisons are also made with previous approaches which show the superiority of our method. Furthermore, our method works for geometric models that are composed of multiply connected regions with complex boundaries.

     

/

返回文章
返回