Non-planar slicing algorithm based on AABB and OBB bounding boxes for additive manufacturing
Abstract To solve the geometric computation and execution efficiency problems involved in surface layering in additive manufacturing technology, a non-planar slicing algorithm using the envelope box optimization computation is proposed. First, the base mesh is offset to obtain a set of curved cross-sections. Second, collision detection is performed on the axis-aligned bounding boxes of the triangular facets in the intersection space of the model and the oriented bounding boxes of the cross-section. Finally, intersection is computed only for the pairs of triangles that pass the detection. The proposed non-planar slicing algorithm is applied to the STL model of the part. The results show that the proposed method can effectively reduce redundant computations, speed up the running time by 99.8% compared with the direct slicing method, and greatly improve the efficiency of obtaining the closed contour.
Authors
- Han Liu (ORCID: https://orcid.org/0009-0002-6416-7697)
- Fei Xing (ORCID: https://orcid.org/0009-0006-8973-5282)
Institutions
- Shenyang University of Technology (CN)
Publication Details
- Journal
- Journal of Physics Conference Series
- Published
- 2025-02-01
- DOI
- https://doi.org/10.1088/1742-6596/2951/1/012096
- Citations
- 1
- Primary Topic
- Additive Manufacturing and 3D Printing Technologies
- Type
- article
- Field-Weighted Citation Impact
- 0.68