Relief grid representation and 3D printing slicing method and system based on bump map
A 3D printing and grid technology, applied in the field of 3D printing slicing, can solve the problems of large memory occupation, large file space, and unsmooth page running.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Publication Date
- 2020-07-07
Smart Images

Figure 1 
Figure 2 
Figure 3
Abstract
Description
technical field
[0001] The invention relates to the technical field of 3D printing slicing, in particular to a relief grid representation based on bump mapping and a method and system for 3D printing slicing. Background technique
[0002] From an engineering point of view, 3D printing is an engineering method that quickly expresses the designer's intention; from a manufacturing technology point of view, 3D printing is a process of manufacturing parts by layering molding materials based on CAD data. 3D printing is an efficient production tool, the specific steps are as follows:
[0003] Import the STL model. In computer graphics, STL, as a file format that can be recognized by computers, often uses binary format to store the geometric information of triangular faces;
[0004] For 3D slice calculation, generally select a series of cross-sections along the Z-axis to intercept the 3D model. During the interception process, each triangular face intersects with the cross-section ...
Examples
Embodiment Construction
[0051] refer to Figure 1 to Figure 6 , a kind of embossed grid representation and 3D printing slicing method based on bump map that the present invention proposes, comprises the following steps:
[0052] Step S1, obtaining a three-dimensional basic grid model, and performing adaptive midpoint subdivision processing on the triangles intersecting the Z plane in the three-dimensional basic grid model according to the topological rules of the grid;
[0053] In this step, judge whether the triangle in the three-dimensional basic mesh model intersects with the Z plane by an intersection test algorithm, wherein the intersection test algorithm includes:
[0054] Obtain the triangle q in the 3D basic mesh model;
[0055] Calculate the bounding box of the triangle q, wherein the bounding box Z-axis minimum value is zmin, and the bounding box Z-axis maximum value is zmax;
[0056] Calculating tmin and tmax, and judging whether tmin is less than tmax, when the judgment result is yes, t...