检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴美娟 王士玮 石磊 杨周旺[1] 刘利刚[1] Wu Meijuan;Wang Shiwei;Shi Lei;Yang Zhouwang;Liu Ligang(School of Mathematical Sciences, University of Sciences and Technology of China, Hefei 230026)
机构地区:[1]中国科学技术大学数学科学学院,合肥230026
出 处:《计算机辅助设计与图形学学报》2017年第10期1816-1823,共8页Journal of Computer-Aided Design & Computer Graphics
基 金:国家自然科学基金(61672482;11626253)
摘 要:针对3D浮雕网格点数、面数空间占用大,在打印过程中耗费内存等缺点,提出将凹凸贴图表示的浮雕模型直接进行切片完成打印,并提出基于凹凸贴图的浮雕网格的3D打印自适应细分切片算法.在切片过程中,先对输入的粗网格根据凹凸图深度信息进行自适应中点细分,并更新细分后三角网格顶点的几何位置;然后对生成的局部三角网格集合与切片进行求交运算,将所获得的交线段存储后释放此三角形集合的内存;最后将生成的交线段重组成闭合多边形,生成打印路径,交由打印机完成浮雕模型打印.实验结果证明,将凹凸贴图推广到3D打印中,与传统的打印过程进行对比,该方法的空间利用率得到显著性提高.A large number of vertices and triangles in3D relief models may result in much memory cost when3D printing them.To handle this problem,we present a novel and efficient approach for3D relief meshes,which is achieved by representing the input3D fine relief mesh as a coarse mesh with a bump map and applying the slicing computation on the coarse mesh instead of the fine mesh.The algorithm consists of three steps.First,the coarse mesh is refined by an adaptive mid-point subdivision with the depth derived from the bump map.Second,we compute and store the slicing using the refined mesh and then release the memory storage of this mesh.Finally,the slicing is used for generating the printing path in3D printing.Experimental results have shown that the proposed method has greatly improved the efficiency of computing and reduced the memory storage in3D printing relief models.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49