3d print slice rapid generation method

Abstract

The invention discloses a 3d print slice rapid generation method. The method comprises the steps of three-dimensional mesh preprocessing, slice contour line generation and slice print path generation. In the step of slice contour line generation, triangular patches in a triangular mesh are classified according to the minimum z value; a classification triangular mesh chain table is constructed to reduce the number of intersecting of triangular patches and the slice plane; and the slice contour line generation efficiency is improved. Based on the generated slice contour lines, a two-dimensional polygon scan line filling algorithm is combined, and the characteristics of the intersection of a scan line and the contour lines are used to quickly judge a filling region and a void region between the contour lines. Judgment inside and outside a polygon can be reduced. The slice print path generation efficiency is improved. The 3d print slice rapid generation method has the advantages of being simple, robust algorithm and high generation efficiency. The efficiency and quality of slice generation in 3d printing are improved.

Description

technical field [0001] The invention relates to the field of 3D printing, in particular to slice generation in the 3D printing process. Background technique [0002] The 3D slice is obtained by intersecting the slice plane with the triangular surface in the 3D mesh model. Since the triangular mesh model usually contains a large number of triangular faces, if the method of directly intersecting is used, the time cost will be very huge, and it is basically not applicable in the actual production process. At present, the commonly used 3D slice generation technology usually uses space subdivision trees, such as binary space subdivision trees, octrees and other data structures to accelerate, reducing unnecessary intersection times between triangular patches and slice planes, thereby reducing for time complexity purposes. However, the data structure of these spatial subdivision trees is often complicated to implement, and it is not optimized for the special case that the slice p...

AI Technical Summary

Problems solved by technology

[0004] In view of the complex data structure, difficult implementation and low generation efficiency in the current 3D slicing method, the present invention classifies the triangular patches in the triangular grid according to their minimum z value, constructs a linked list of classified triangular patches, and reduces the number of judgment triangles. Whether there is a number of intersections between the patch and the slice plane, so as to improve the generation efficiency of the contour line in the slice

Images