Abstract
In this paper, a new algorithm for direct slicing of triangular facet grouping slices based on STL model in rapid prototyping is proposed. A triangular facet matrix is created by reading the binary format information of the STL model. Firstly, the binary search algorithm is used to search the triangular facet intersecting with the slice plane, and the grouping matrix is established. Then according to the slice plane intersecting with the triangular plane, the intersection line segment is obtained. Finally, the depth-first search algorithm is used to optimize the contour lines with different heights. The algorithm reduces the judgment of the position relationship between the slice plane and the triangular facet and avoids the establishment of the topological information relationship between the triangular facets. It has obvious advantage in slice time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
