Section layering method based on STL model

Abstract

The invention provides a section layering method based on an STL model and solves the problem of slow layering speed in the prior art. The method comprises the steps of: determining a layering number of sections; determining the layer number where each triangular face is located of the STL model; establishing a grouping matrix aiming at each layer of sections and generating an active triangular face table, wherein the grouping matrix comprises a triangular face set having a section direction which is intersected with the plane of the sections, and index numbers of all triangular faces in the grouping matrix are stored in the active triangular face table; determining an adjacency relation of respective triangular faces in each layer based on the active triangular face table, after intersecting each layer of sections, generating a profile ring corresponding to each layer of sections by combining with the adjacency relation to obtain a whole section profile. By establishing the grouping matrix in a layering manner, and establishing the active triangular face table of the grouping matrix, based on the adjacency relation, a topological relation is established in a smaller triangular face range, position judging times and calculated amount are reduced and the layering efficiency is effectively improved.

Description

technical field [0001] The invention belongs to the technical field of computer applications, and in particular relates to a slice layering method based on an STL model in 3D printing technology. Background technique [0002] At present, the most commonly used printing data in the field of 3D printing is obtained through the STL (Stereo Litbography) model. [0003] Specifically, the intersection of a slice plane and the entire STL model is calculated from bottom to top. Therefore, to determine whether a certain triangle surface intersects with the slice plane, it is necessary to traverse the entire triangle surface set, and then perform intersection after calculating the intersection line. The orderly arrangement of the lines; however, in this algorithm, the triangular patch with the same edge will be calculated twice, and the result is actually the same target point, and the calculation redundancy is large. Although in some algorithms, the entire model is topologically sor...

AI Technical Summary

Problems solved by technology

Although in some algorithms, the entire model is topologically sorted, thereby simplifying the sorting operation after obtaining the intersection line, however, performing topological sorting on the entire model itself requires a large amount of calculation, which leads to the current layering of the STL model. the speed is slow

Images