首页 | 本学科首页   官方微博 | 高级检索  
     

三维打印中的底层多边形优化
引用本文:李 蒙,宋春雨,谷静平,王 琼,刘 清.三维打印中的底层多边形优化[J].南京师范大学学报,2016,0(3).
作者姓名:李 蒙  宋春雨  谷静平  王 琼  刘 清
作者单位:南京师范大学计算机科学与技术学院,江苏 南京 210023
摘    要:三维打印过程中,底层多边形模型存在着数据点冗余、形状粗糙等问题,造成模型成型效率低,表面模型不光滑,急需要对底层多边形进行优化. 现有的多边形优化算法没有考虑到在三维打印过程从多边形转换为相应的加工指令及加工机构的平滑运行等问题. 为此,本文提出一种新的底层多边形优化算法,该算法利用基于面积最小原则的多边形简化算法来减少多边形顶点数,再通过Hermrite曲线和B样条对多边形进行样条化处理,使多边形边界变得光滑,并对样条化后的多边形顶点进行均匀离散化,使优化后的底层多边形更便于机械指令集的操作. 实验结果证明该算法可以提高底层多边形的质量并满足三维打印的工程要求.

关 键 词:三维打印  平滑  多边形简化  样条化  离散化

Underlying Polygon Optimization in Three Dimensional Printing
Li Meng,Song Chunyu,Gu Jingping,Wang Qiong,Liu Qing.Underlying Polygon Optimization in Three Dimensional Printing[J].Journal of Nanjing Nor Univ: Eng and Technol,2016,0(3).
Authors:Li Meng  Song Chunyu  Gu Jingping  Wang Qiong  Liu Qing
Affiliation:School of Computer Science and Technology,Nanjing Normal University,Nanjing 210023,China
Abstract:The polygon which is used in the underlying digital model in?the?field?of Three Dimension Printing has many problems,such as data redundancy and rough shape. These problems lead to the inefficiency of the product,and the surface model is not smooth. The existing optimization algorithm does not consider the problem of processing instructions and smooth operation. To solve these problems,this paper presents a new polygon optimization algorithm,by using polygon simplification algorithm based on the rule of minimum area to reduce the number of vertices of polygons,and spline polygon based on Hermrite curve and B-spline to make polygon boundary becomes smooth. Then this algorithm can also discrete polygon vertices,make it easier to process. Experimental results show that this algorithm can improve the quality of underlying polygons and satisfy engineering requirements.
Keywords:three dimension printing  smooth operation  polygon simplification  hermrite curve and B-spline  discrete
本文献已被 CNKI 等数据库收录!
点击此处可从《南京师范大学学报》浏览原始摘要信息
点击此处可从《南京师范大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号