Curved surface slicing algorithm of additive manufacturing digital model based on the combination of inner and outer bounding box and projection method
Runlin Cheng , Xiangman Zhou , Xiaochen Xiong , Xingwang Bai , Youlu Yuan , Haihua Wu , Junjian Fu , Youheng Fu
{"title":"Curved surface slicing algorithm of additive manufacturing digital model based on the combination of inner and outer bounding box and projection method","authors":"Runlin Cheng , Xiangman Zhou , Xiaochen Xiong , Xingwang Bai , Youlu Yuan , Haihua Wu , Junjian Fu , Youheng Fu","doi":"10.1016/j.jmapro.2025.06.094","DOIUrl":null,"url":null,"abstract":"<div><div>To address the issue of low intersection efficiency in curved surface slicing of an STL model in additive manufacturing, this study proposes a novel curved surface slicing algorithm that integrates inner and outer bounding boxes with a projection-based approach. The proposed methodology is outlined as follows: Firstly, during the intersection process between the curved surface layer and the model, oriented bounding boxes (OBBs) are constructed for both the curved surface layer and the model to identify the intersecting regions, and the triangles located within the intersecting regions are selected. Secondly, the inner bounding boxes are constructed within the curved surface layer, the triangles located within the intersecting regions of the model and the inner bounding boxes are then projected onto the <em>XOZ</em> and <em>YOZ</em> planes, and the triangles of the model that do not intersect with the curved surface layer are effectively removed by Boolean operations. Finally, after two rounds of screening, an axis-aligned bounding box (AABB) is constructed for both the remaining triangles of the model and the triangles of the curved surface layer within the intersecting region, the intersection calculations are then performed on the triangles that are likely to intersect. The algorithm is applied to the STL model of impeller blades, and the results demonstrate significant improvements in computational efficiency. Specifically, the time complexity of the proposed algorithm is approximately 37 % of that of the brute-force intersection algorithm and 77 % of the hierarchical bounding box algorithm. Furthermore, the running time is reduced to 18.6 % of that of the brute-force intersection algorithm and 47.6 % of the hierarchical bounding box algorithm. These results substantiate the feasibility and efficiency of the proposed algorithm in enhancing intersection calculations in additive manufacturing processes.</div></div>","PeriodicalId":16148,"journal":{"name":"Journal of Manufacturing Processes","volume":"150 ","pages":"Pages 914-923"},"PeriodicalIF":6.1000,"publicationDate":"2025-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Manufacturing Processes","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1526612525007522","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0
Abstract
To address the issue of low intersection efficiency in curved surface slicing of an STL model in additive manufacturing, this study proposes a novel curved surface slicing algorithm that integrates inner and outer bounding boxes with a projection-based approach. The proposed methodology is outlined as follows: Firstly, during the intersection process between the curved surface layer and the model, oriented bounding boxes (OBBs) are constructed for both the curved surface layer and the model to identify the intersecting regions, and the triangles located within the intersecting regions are selected. Secondly, the inner bounding boxes are constructed within the curved surface layer, the triangles located within the intersecting regions of the model and the inner bounding boxes are then projected onto the XOZ and YOZ planes, and the triangles of the model that do not intersect with the curved surface layer are effectively removed by Boolean operations. Finally, after two rounds of screening, an axis-aligned bounding box (AABB) is constructed for both the remaining triangles of the model and the triangles of the curved surface layer within the intersecting region, the intersection calculations are then performed on the triangles that are likely to intersect. The algorithm is applied to the STL model of impeller blades, and the results demonstrate significant improvements in computational efficiency. Specifically, the time complexity of the proposed algorithm is approximately 37 % of that of the brute-force intersection algorithm and 77 % of the hierarchical bounding box algorithm. Furthermore, the running time is reduced to 18.6 % of that of the brute-force intersection algorithm and 47.6 % of the hierarchical bounding box algorithm. These results substantiate the feasibility and efficiency of the proposed algorithm in enhancing intersection calculations in additive manufacturing processes.
期刊介绍:
The aim of the Journal of Manufacturing Processes (JMP) is to exchange current and future directions of manufacturing processes research, development and implementation, and to publish archival scholarly literature with a view to advancing state-of-the-art manufacturing processes and encouraging innovation for developing new and efficient processes. The journal will also publish from other research communities for rapid communication of innovative new concepts. Special-topic issues on emerging technologies and invited papers will also be published.