.png){kind=icon}
返回
Trimming self-intersections in swept volume solid modeling
.png){kind=icon}
PRE
AI
DOI：10.1631/jzus.A071357.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Swept volume solid modeling has been applied to many areas such as NC machining simulation and verification, robot workspace analysis, collision detection, and CAD. But self-intersections continue to be a challenging problem in the boundary representation of swept volume solids. A novel algorithm is presented in this paper to trim self-intersection regions in swept volume solids modeling. This trimming algorithm consists of two major steps: (1) roughly detecting self-intersection regions by checking intersections or overlapping of the envelop profiles; (2) splitting the whole envelop surfaces of the swept volume solid into separate non-self-intersecting patches to trim global self-intersections, and to trim local self-intersections, dividing local self-intersecting regions into patches and replacing self-intersecting patches with non-self-intersecting ones. Examples show that our algorithm is efficient and robust.
Keyword:
self-intersection
swept volume (SV)
solid modeling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.1K
被引数:
4.6K
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容