Incremental algorithms of finding offset distance and minimum passage width using Voronoi diagram technique [CAM machining]

W. Lai, T. Faddis, R. Sorem
{"title":"Incremental algorithms of finding offset distance and minimum passage width using Voronoi diagram technique [CAM machining]","authors":"W. Lai, T. Faddis, R. Sorem","doi":"10.1109/ADHES.1998.742053","DOIUrl":null,"url":null,"abstract":"Since some practical areas, such as computer graphics, computer-aided design, robotics, pattern recognition, and finite element methods, give rise to geometrical problems, Voronoi diagrams have broad areas of application, such as mesh generation in FEA (finite element analysis) and machining toolpath planning in CAM (computer-aided manufacturing) for NC pocket machining. When the mesh generation is applied in FEA, the information for extraction of geometric proximity is important. When the contour-parallel strategy is applied to machining toolpath planning, geometric degeneracies can occur and significantly require the performance of complicated and time-consuming computations of offset curves. The best way to deal with geometric proximity and geometric degeneracies is with Voronoi diagrams. If islands are considered in machining toolpath planning, it is necessary to calculate the minimum passage width between islands, or between islands and contour segments. This paper presents the incremental algorithms of the Voronoi diagram technique to calculate the offset distance for offset curves and the minimum passage width for pocket machining toolpath planning.","PeriodicalId":183195,"journal":{"name":"Proceedings of 3rd International Conference on Adhesive Joining and Coating Technology in Electronics Manufacturing 1998 (Cat. No.98EX180)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd International Conference on Adhesive Joining and Coating Technology in Electronics Manufacturing 1998 (Cat. No.98EX180)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADHES.1998.742053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Since some practical areas, such as computer graphics, computer-aided design, robotics, pattern recognition, and finite element methods, give rise to geometrical problems, Voronoi diagrams have broad areas of application, such as mesh generation in FEA (finite element analysis) and machining toolpath planning in CAM (computer-aided manufacturing) for NC pocket machining. When the mesh generation is applied in FEA, the information for extraction of geometric proximity is important. When the contour-parallel strategy is applied to machining toolpath planning, geometric degeneracies can occur and significantly require the performance of complicated and time-consuming computations of offset curves. The best way to deal with geometric proximity and geometric degeneracies is with Voronoi diagrams. If islands are considered in machining toolpath planning, it is necessary to calculate the minimum passage width between islands, or between islands and contour segments. This paper presents the incremental algorithms of the Voronoi diagram technique to calculate the offset distance for offset curves and the minimum passage width for pocket machining toolpath planning.
基于Voronoi图技术的偏移距离和最小通道宽度的增量算法[CAM加工]
由于一些实际领域,如计算机图形学、计算机辅助设计、机器人技术、模式识别和有限元方法,会产生几何问题,因此Voronoi图具有广泛的应用领域,例如有限元分析中的网格生成和数控口袋加工的CAM(计算机辅助制造)中的加工刀具路径规划。在有限元分析中进行网格生成时,提取几何接近度的信息是非常重要的。当轮廓并行策略应用于加工刀具轨迹规划时,会产生几何退化,并且需要执行复杂且耗时的偏移曲线计算。处理几何接近和几何简并的最好方法是使用Voronoi图。如果在加工刀具轨迹规划中考虑孤岛,则需要计算孤岛之间或孤岛与轮廓段之间的最小通道宽度。提出了用Voronoi图技术计算偏置曲线的偏置距离和插袋加工刀路规划的最小通道宽度的增量算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信