一种基于分层邻接的快速切片与拓扑重建算法  

A Rapid Slicing and Topological Reconstruction Algorithm Based on Stratified Adjacency

作　　者：徐明月 吴鹏伟 XU Mingyue;WU Pengwei(School of Computer,Hangzhou Dianzi University,Hangzhou Zhejiang 310018,China)

机构地区：[1]杭州电子科技大学计算机学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2018年第3期53-58,共6页Journal of Hangzhou Dianzi University：Natural Sciences

摘　　要：针对快速成型技术对切片速度和拓扑构建的需求,提出了一种基于分层邻接的快速切片和拓扑重建算法。在Z轴正方向上逐渐增加切平面的高度,用其去截三角面片,将所截边存入对应切片层,并按规定的正方向对交点进行排序从而形成最终切片层的轮廓。轮廓线中相邻交点对应的三角面片是相邻的,根据此关系在切片结果上完成对STL模型文件的拓扑结构重建。实验以1mm为切片精度,用改进后算法与传统快速切片算法对咖啡勺、鲸鱼和花瓶的模型文件进行切片处理。与传统切片算法相比,改进后算法的速度提升率分别为9.345%,10.736%和12.541%;拓扑重建耗时分别为223ms,258ms和420ms。由实验可以看出,改进后算法切片速度更快,同时又可以完成拓扑结构的构建。In order to meet the requirement of rapid prototyping technology,a fast slicing and topology reconstruction algorithm based on stratified adjacency is proposed.The height of the tangent plane is gradually increased in the positive direction of the Z-axis,which is used to cut the triangular facets.Then the slicing edges are stored in the corresponding slicing layer,and the intersection points are sorted according to the prescribed positive direction so as to form the outline of the final slice layer.The triangular facets of the adjacent intersection points in the contour line are adjacent to each other.According to this relationship,the topology reconstruction of the STL model file is completed over the slicing result.The experiments were carried out on the model files of coffee spoon,whale and vase with improved and traditional slicing algorithms,taking 1 mm as slice precision.Compared with the traditional slicing algorithm,the speed lifting rate of the improved algorithm is 9.345%,10.736% and12.541%respectively.Topology reconstruction takes 223 ms,258 ms and 420 ms.The experiment results show that the improved algorithm is faster in slicing and can complete the construction of topology.

关 键 词：快速切片 拓扑重建 分层邻接 STL模型文件 快速成型 

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