Trimming self-intersections in swept volume solid modeling

作     者：Zhi-qi XU Xiu-zi YE Zhi-yang CHEN Yin ZHANG San-yuan ZHANG 

作者机构：State Key Laboratory of CAD ＆ CG School of Computer Science and Technology Zhejiang University Hangzhou 310027 China College of Software Zhejiang University of Technology Hangzhou 310014 China 

出 版 物：《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 (浙江大学学报（英文版）A辑（应用物理与工程）)

年 卷 期：2008年第9卷第4期

页      面：470-480页

核心收录：

学科分类：0810[工学-信息与通信工程] 081203[工学-计算机应用技术] 08[工学] 0805[工学-材料科学与工程（可授工学、理学学位）] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Project supported by the National Natural Science Foundation of China (No. 60473106) the Hi-Tech Research and Development Program (863) of China (Nos. 2007AA01Z311 and 2007AA04Z1A5) the National Research Foundation for the Doctoral Program of Higher Education of China (No. 20060335114) 

主　　题：Self-intersection Swept volume (SV) Solid modeling 

摘      要：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.