3D打印中的模型去支撑划分方法  

Partition model into 3D-printable and no supporting parts

作　　者：魏潇然 耿国华[1] 张雨禾[1] 

机构地区：[1]西北大学信息科学与技术学院,陕西西安710069

出　　处：《西安电子科技大学学报》2016年第2期180-185,共6页Journal of Xidian University

基　　金：国家自然科学基金资助项目(61373117)

摘　　要：打印模型适应打印空间,模型悬空部分添加支撑,这是3D打印过程中需要解决的两类重要问题,现有算法无法同时解决这两类问题.针对这两类问题,提出一种模型划分算法,将模型划分为适应打印空间的锥体:锥体是一种打印时不需要支撑结构的图形.该算法首先采用区域生长方法对模型表面进行分区,分析各区域法向获取多个候选划分方向;用候选划分方向生成候选切面划分模型,若划分后的子模型为非锥体,则用相同的方法继续对子模型进行划分,直到所有子模型均为锥体.多个候选划分切面会生成多组划分方式,一组划分方式可以表示为一棵树,利用评价函数计算划分价值,并采用集束搜索对解空间搜索获得价值最大的树,即为最优划分.实验结果表明,该算法能将模型划分为不需要支撑结构同时适应打印空间的子模型.The printing object must fit into the printing working volume and overhangs require a disposable support structure to be added,which are two main problems in the 3Dprinting process.Existing algorithms cannot solve these two problems at the same time.To solve these problems,we present a model partition algorithm,dividing the model into the pyramidal fitting printing working volume,with the pyramidal having the shape which can be printed without a supporting structure.Firstly,we partition the model surface using the region growing method and analyze the region＇s normal vector to determine the candidate dividing directions.Secondly,we use the candidate dividing directions to generate candidate dividing planes in order to segment the model.If the divided submodel is not a pyramidal,continue segmenting the sub-model by using the same method until all of the sub-models are pyramidal.The candidate dividing planes may generate multi-group division modes.Each division mode constructs a tree,the evaluation function is employed to appraise the dividing values and the beam search method is utilized to search the largest value tree in the solution space which is the optimal partition.Experimental results show that the proposed algorithm can divide the model into sub-models which needn＇t support structures and fit into the printing working volume.

关 键 词：3D打印 模型划分 支撑结构 锥体 

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