Rapid generation of contour parallel toolpaths for 2.5D closed cavity based on accurate discrete medial axis transform

Peng Shi, Xiaomeng Tong, Hongquan Qu, Maolin Cai
{"title":"Rapid generation of contour parallel toolpaths for 2.5D closed cavity based on accurate discrete medial axis transform","authors":"Peng Shi,&nbsp;Xiaomeng Tong,&nbsp;Hongquan Qu,&nbsp;Maolin Cai","doi":"10.1016/j.precisioneng.2024.11.014","DOIUrl":null,"url":null,"abstract":"<div><div>Contour parallel toolpaths are the most common machining strategies for 2.5D features. To enhance the machining efficiency, different cutting paths for various tool combinations should be considered. However, existing algorithms have paid limited attention to multi-tool cutting, which is nevertheless an industrial practice in roughening and finishing. This paper proposes a rapid generation method for contour parallel toolpaths based on an accurate two-dimensional discrete medial-axis transform (MAT) for complex closed cavities. The accurate discrete MAT was refined using the Delaunay triangulation (DT) method. According to the definition of MAT, the calculated discrete medial axis (MA) points are adjusted to obtain accurate MA points by iterative method. The accurate discrete MAT obtained served as the basis for the toolpath generation. Contour parallel toolpaths can be rapidly generated by applying the discrete MAT and the proposed toolpath generation method. The resulting toolpaths have been validated to closely match the cutting path obtained through commercial software calculations, which require much higher computational efforts. The proposed method introduces a novel accurate discrete medial axis calculation method and enables the rapid computation of multi-tool combination cutting paths., which is more suitable in toolpath generation, cutting time prediction and toolset optimization in practice.</div></div>","PeriodicalId":54589,"journal":{"name":"Precision Engineering-Journal of the International Societies for Precision Engineering and Nanotechnology","volume":"92 ","pages":"Pages 231-252"},"PeriodicalIF":3.5000,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Precision Engineering-Journal of the International Societies for Precision Engineering and Nanotechnology","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0141635924002629","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

Abstract

Contour parallel toolpaths are the most common machining strategies for 2.5D features. To enhance the machining efficiency, different cutting paths for various tool combinations should be considered. However, existing algorithms have paid limited attention to multi-tool cutting, which is nevertheless an industrial practice in roughening and finishing. This paper proposes a rapid generation method for contour parallel toolpaths based on an accurate two-dimensional discrete medial-axis transform (MAT) for complex closed cavities. The accurate discrete MAT was refined using the Delaunay triangulation (DT) method. According to the definition of MAT, the calculated discrete medial axis (MA) points are adjusted to obtain accurate MA points by iterative method. The accurate discrete MAT obtained served as the basis for the toolpath generation. Contour parallel toolpaths can be rapidly generated by applying the discrete MAT and the proposed toolpath generation method. The resulting toolpaths have been validated to closely match the cutting path obtained through commercial software calculations, which require much higher computational efforts. The proposed method introduces a novel accurate discrete medial axis calculation method and enables the rapid computation of multi-tool combination cutting paths., which is more suitable in toolpath generation, cutting time prediction and toolset optimization in practice.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
7.40
自引率
5.60%
发文量
177
审稿时长
46 days
期刊介绍: Precision Engineering - Journal of the International Societies for Precision Engineering and Nanotechnology is devoted to the multidisciplinary study and practice of high accuracy engineering, metrology, and manufacturing. The journal takes an integrated approach to all subjects related to research, design, manufacture, performance validation, and application of high precision machines, instruments, and components, including fundamental and applied research and development in manufacturing processes, fabrication technology, and advanced measurement science. The scope includes precision-engineered systems and supporting metrology over the full range of length scales, from atom-based nanotechnology and advanced lithographic technology to large-scale systems, including optical and radio telescopes and macrometrology.
期刊最新文献
Dynamic balancing of a flexure-based Watt’s linkage horological oscillator Design of a novel Z-shaped flexure hinge and a 2DOF XY precision positioning platform Numerical and experimental study of material removal characteristics for magnetorheological micro-jet polishing Investigation on the machining mechanism and surface integrity in ultrasonic elliptical vibration cutting of Al-Si alloys Avoid the influence of error point cloud registration homogenization on the evaluation of blade machining allowance distribution
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1