An algorithm for the Boolean operation of STL models based on spacial decomposition
The use of discrete data to represent engineering structures as derivatives from intersecting components requires algorithms to perform Boolean operations between groups of triangulated surfaces.In the intersection process, an accurate and efficient method for the determination of intersection lines is a crucial step for large scale and complex surface intersections. The topological structure of STL models is built to obtain the relationships among the triangular facets of the object. A background grid is employed to limit the scope of searching for candidate triangular facets that may intersect. To determine the intersection between two triangular facets, the method of overlapping region is adopted to enhance robustness and reliability. The inclusion prediction is taken by testing the candidate point inside or outside the other solid. The problem of ambiguous point in inclusion prediction is eliminated.
Boolean operations STL models Triangular facet Intersection chains/loops Neighbor tracing
Liu Bing Zhang Li-Chao Mo Jian-Hua Qian Bo
State Key Laboratory of Plastic Forming Simulation and Die & Mould Technology, School of Material Science and Engineering, Huazhong University of Science and Technology ,Wuhan, China
国际会议
北京
英文
516-524
2008-11-06（万方平台首次上网日期，不代表论文的发表时间）