NC machining verification algorithm based on the STL model

被引:0
作者
Ying Miao
Xiaowen Song
Jun Wang
Zhonghua Lu
机构
[1] Wuxi Institute of Technology,Mechanical Institute of Technology
[2] Wuxi Institute of Technology,Jiangsu Intelligent Production Line Technology and Equipment Engineering Research Center
[3] Zhejiang University,State Key Laboratory of Fluid Power and Mechatronic System, College of Mechanical Engineering
来源
The International Journal of Advanced Manufacturing Technology | 2020年 / 110卷
关键词
NC machining verification; STL model; Sampling step; Signed distance; Background grid;
D O I
暂无
中图分类号
学科分类号
摘要
An algorithm to assess the deviation of a machined workpiece model for a nominal part of the stereolithography (STL) model-based numerically controlled (NC) machining verification is presented, which is inspired by several algorithms used for evaluating the difference between two triangular meshes of similar shape, and some improvements are made. First, each triangle of the machined workpiece model is sampled under a user-defined sampling step δ. Then, the signed distance between each sample and the nominal part is computed to obtain the maximal error, minimal error, and mean error between the two STL models. Finally, a background grid is constructed to quickly search for the triangle closest to the sampling point. The experimental results demonstrate that the accuracy can be improved by sampling all the triangles, including those too small to be sampled under the current sampling step δ. The efficiency can be increased by applying a background grid, and the undercut and overcut areas can be easily detected by coloring the machined workpiece model according to the signed distance associated with each sample.
引用
收藏
页码:1153 / 1161
页数:8
相关论文
共 46 条
[31]   Research on adaptive slicing method for optimizing STL model manufacturing details [J].
Wu, Yan ;
Chen, Xiaoshuai ;
Sun, Ruijin ;
He, Chaoqun ;
Hu, Jiale ;
Han, Shizhan .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2024, 130 (9-10) :4459-4468
[32]   Boolean operations of STL models based on edge-facet intersection [J].
郭开波 ;
张李超 ;
王从军 ;
黄树槐 .
Journal of Harbin Institute of Technology, 2007, (05) :711-717
[33]   3D Flash Display for STL Model in Rapid Prototyping System [J].
LI Jian guo XU Ming heng School of Mechanical Engineering Southwest Jiaotong University Chengdu PRChina .
InternationalJournalofPlantEngineeringandManagement, 2003, (04) :206-209
[34]   A grid generator for 3-D explosion simulations using the staircase, boundary approach in Cartesian coordinates based on STL models [J].
Ning, Jianguo ;
Ma, Tianbao ;
Lin, Genghao .
ADVANCES IN ENGINEERING SOFTWARE, 2014, 67 :148-155
[35]   Recursive Layered Algorithm with Directive Weighted Graph Based on Packet Sequencing [J].
Wang, Lei ;
Hu, Yan-Juan ;
Wang, Yao .
2015 INTERNATIONAL CONFERENCE ON MECHANICAL SCIENCE AND MECHANICAL DESIGN, MSMD 2015, 2015, :8-14
[36]   Design and implementation of FDM support automatic generation algorithm based on Matlab [J].
Song, Tingqiang ;
Liu, YaLin ;
Zhang, Min ;
Ma, XingLu .
2017 INTERNATIONAL CONFERENCE ON SECURITY, PATTERN ANALYSIS, AND CYBERNETICS (SPAC), 2017, :520-525
[37]   Model and algorithm for fuzzy joint replenishment and delivery scheduling without explicit membership function [J].
Wang, Lin ;
Dun, Cai-Xia ;
Lee, Chi-Guhn ;
Fu, Qing-Liang ;
Zeng, Yu-Rong .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (9-12) :1907-1920
[38]   Model and algorithm for fuzzy joint replenishment and delivery scheduling without explicit membership function [J].
Lin Wang ;
Cai-Xia Dun ;
Chi-Guhn Lee ;
Qing-Liang Fu ;
Yu-Rong Zeng .
The International Journal of Advanced Manufacturing Technology, 2013, 66 :1907-1920
[39]   Collaborative filtering recommendation algorithm based on interval-valued fuzzy numbers [J].
Yitao Wu ;
Yi ZHao ;
Shuai Wei .
Applied Intelligence, 2020, 50 :2663-2675
[40]   Collaborative filtering recommendation algorithm based on interval-valued fuzzy numbers [J].
Wu, Yitao ;
ZHao, Yi ;
Wei, Shuai .
APPLIED INTELLIGENCE, 2020, 50 (09) :2663-2675