3D printing hierarchical control algorithm

Abstract

The invention discloses a 3D printing hierarchical control which is a directed weighted graph recursive hierarchical algorithm based on grouping sorting, and the algorithm comprises the following steps: (1) analyzing an STL model file in 3D printing, and carrying out grouping sorting on all triangular patches; (2) finding the corresponding relation between the triangular patches and the hierarchical plane serial numbers for the triangular patches subjected to grouping and sorting, and establishing a hierarchical relation matrix; (3) establishing an adjacent relation between the triangular patches to obtain a directed weighted graph of the triangular patches; (4) carrying out directed weighted graph recursive search on the active triangular patches respectively to find adjacent triangles; and (5) finding out edges of the adjacent triangles according to the weight data of the adjacent triangles, further solving intersection points of the edges and the sections, determining the trend of the section contour, and finally generating section contour data. The 3D printing hierarchical control algorithm can reduce the time for establishing the topological relation between the surface patches, and is simple to implement, stable and reliable.

Description

technical field [0001] The invention belongs to the technical field of 3D printing, and relates to a 3D printing layered control algorithm. Background technique [0002] There are two main types of STL model algorithms in existing 3D printing: [0003] One is an algorithm based on the geometric feature classification of the STL model. This algorithm directly grades and classifies the triangular faces of the STL file, and then performs intersection calculations, but the section contour information must be sorted out to form closed directed line segments. Utilize the existing characteristics of the triangular patch: the longer the triangular patch in the Z direction, the more tangent planes it will intersect; the lower the lowest point of the triangular patch in the Z direction, the faster the intersection with the tangent plane will be . [0004] The second is a hierarchical algorithm based on the topology information of the STL model. Triangular patches have no order in ...

AI Technical Summary

Problems solved by technology

[0005] There are certain defects in the above two STL model algorithms: the division index of the first algorithm for triangular patch classification is a fuzzy value, so it is difficult to completely eliminate the invalid judgment of the positional relationship; , each triangle patch only intersects one edge, and the directed closed contour can be directly obtained, but the process of establishing topology data is time-consuming and takes up a lot of memory

Images