基于临界倾角约束的树形支撑结构生成算法

为节省三维打印的材料和时间，针对支撑结构体积优化的问题，提出了一种基于临界倾角约束的树形支撑结构生成算法。首先识别待支撑区域，并基于面积自适应采样获得待支撑点；再利用临界倾角约束进行树形结构节点的计算，并存储同一棵树上各节点的连接关系；采用扫掠和泊松曲面重建方法，生成树形支撑实体，最后通过实例进行了验证。实验结果表明，所提出的方法在保证打印稳定性的前提下，有效减少了支撑材料，缩短了打印时间。

Generation of Branching Support Structures Based on Critical Angle Constraint

In order to optimize support structures' volume, and save the material and printing time, an automatic generation algorithm was proposed based on critical angle constraint. Firstly, the algorithm detected areas that required support, and the support points were obtained by adaptive sampling based on the area. Secondly, through critical angle constraint, the nodes in branching support structures were calculated, and all nodes information in a tree were saved. Finally, the resulting structure was obtained by the sweep surface after Poisson reconstruction. The algorithm was evaluated by experiments, and the experimental results demonstrate that the algorithm provides a reliable method to ensure the printing stability as well as reducing the printing material and time.