CN115027060A - Determination method of three-dimensional model layered section and three-dimensional printing method - Google Patents
Determination method of three-dimensional model layered section and three-dimensional printing method Download PDFInfo
- Publication number
- CN115027060A CN115027060A CN202210883677.9A CN202210883677A CN115027060A CN 115027060 A CN115027060 A CN 115027060A CN 202210883677 A CN202210883677 A CN 202210883677A CN 115027060 A CN115027060 A CN 115027060A
- Authority
- CN
- China
- Prior art keywords
- section
- height
- triangular
- triangular patch
- layered
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000010146 3D printing Methods 0.000 title claims abstract description 14
- 238000007639 printing Methods 0.000 claims description 7
- 230000008569 process Effects 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 230000008030 elimination Effects 0.000 claims description 3
- 238000003379 elimination reaction Methods 0.000 claims description 3
- 238000002372 labelling Methods 0.000 claims 1
- 238000004364 calculation method Methods 0.000 abstract description 4
- 230000009467 reduction Effects 0.000 abstract description 3
- 238000003860 storage Methods 0.000 description 13
- 239000004576 sand Substances 0.000 description 8
- 101100479039 Caenorhabditis elegans aars-1 gene Proteins 0.000 description 7
- 238000005192 partition Methods 0.000 description 6
- 239000011159 matrix material Substances 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 239000000463 material Substances 0.000 description 4
- 101150062329 Ars2 gene Proteins 0.000 description 3
- 101100479031 Caenorhabditis elegans aars-2 gene Proteins 0.000 description 3
- 238000012937 correction Methods 0.000 description 3
- 230000007123 defense Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 239000000654 additive Substances 0.000 description 1
- 230000000996 additive effect Effects 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 238000013079 data visualisation Methods 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
- 238000012876 topography Methods 0.000 description 1
- 238000012549 training Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C64/00—Additive manufacturing, i.e. manufacturing of three-dimensional [3D] objects by additive deposition, additive agglomeration or additive layering, e.g. by 3D printing, stereolithography or selective laser sintering
- B29C64/30—Auxiliary operations or equipment
- B29C64/386—Data acquisition or data processing for additive manufacturing
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C64/00—Additive manufacturing, i.e. manufacturing of three-dimensional [3D] objects by additive deposition, additive agglomeration or additive layering, e.g. by 3D printing, stereolithography or selective laser sintering
- B29C64/10—Processes of additive manufacturing
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y10/00—Processes of additive manufacturing
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y50/00—Data acquisition or data processing for additive manufacturing
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y80/00—Products made by additive manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P10/00—Technologies related to metal processing
- Y02P10/25—Process efficiency
Landscapes
- Chemical & Material Sciences (AREA)
- Engineering & Computer Science (AREA)
- Materials Engineering (AREA)
- Manufacturing & Machinery (AREA)
- Physics & Mathematics (AREA)
- Mechanical Engineering (AREA)
- Optics & Photonics (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention relates to a method for determining a three-dimensional model layered section and a method for three-dimensional printing. The combined navigation method of the rotorcraft comprises the following steps: acquiring data of a triangular mesh of the three-dimensional model; determining the height of the current layering section; sorting and marking according to the point heights of the triangular patches in the three-dimensional model; comparing the point height of the triangular patch with the height of the layered section, and storing the triangular patch intersected with the layered section after excluding the triangular patch not intersected with the layered section according to the comparison result; and calculating the intersection point of the reserved triangular patch and the plane where the layered section is located, and determining the outline of the current layered section. According to the invention, the triangular patches which are not intersected with the layered section are eliminated, and only the triangular patches which are intersected with the layered section are stored, so that the calculation efficiency of the profile of the layered section is gradually improved along with the gradual reduction of the triangular patches which are intersected with the layered section, and meanwhile, the layering efficiency of the three-dimensional model is further improved.
Description
Technical Field
The embodiment of the invention relates to the technical field of additive manufacturing, in particular to a method for determining a layered section of a three-dimensional model and a method for three-dimensional printing.
Background
Three-dimensional (3D) printing, refers to the process of making a digital model into a Three-dimensional entity by layers of material. The sand table is a model which is piled up by silt, military chess and other materials according to a certain proportion relation according to a topographic map, an aviation photograph or a field topography. The prior sand table is mainly manufactured by methods of manual stacking, bonding, carving and the like, and has low manufacturing efficiency and high cost. The acquisition and transmission of data security and the classification of data categories cannot meet the requirements of relevant works such as coastal defense simulation training, combat experiments, theoretical research and the like.
With regard to the above technical solutions, the inventors have found that at least some of the following technical problems exist:
when a three-dimensional model similar to a sand table is printed in a 3D mode, the layering section of each layer is relatively more complex, so that when the layering section of the three-dimensional model is determined, the determination process is more complex, the operation efficiency is not high, and the layering efficiency of the three-dimensional model in the 3D printing is influenced.
Accordingly, there is a need to ameliorate one or more of the problems with the related art solutions described above.
It is noted that this section is intended to provide a background or context to the inventive concepts recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
Disclosure of Invention
An object of the present invention is to provide a method for determining a layered cross-section of a three-dimensional model and a method for three-dimensional printing, which address, at least to some extent, one or more of the above-mentioned problems due to limitations and disadvantages of the related art.
The invention firstly provides a method for determining a three-dimensional model layered section, which comprises the following steps:
acquiring data of a triangular mesh of the three-dimensional model;
determining the height of the current layering section;
sorting and marking according to the point heights of the triangular patches in the three-dimensional model;
comparing the point height of the triangular patch with the height of the layered cross section, and saving the triangular patch intersected with the layered cross section after excluding the triangular patch not intersected with the layered cross section according to the comparison result;
and calculating the intersection point of the reserved triangular patch and the plane where the layered section is located, and determining the contour of the current layered section.
In the invention, the step of sequencing and marking according to the point heights of the triangular patches in the three-dimensional model comprises the following steps:
and respectively sequencing and marking according to the point heights of the highest point and the lowest point of the triangular patch in the three-dimensional model.
In the present invention, the step of comparing the point height of the triangular patch with the height of the layered cross section and storing the triangular patch intersecting the layered cross section after excluding the triangular patch not intersecting the layered cross section according to the comparison result includes:
storing the triangular patch which meets the following conditions: the height of the highest point is greater than or equal to the height of the layered cross section, and the height of the lowest point is less than or equal to the height of the layered cross section.
In the present invention, the step of comparing the point height of the triangular patch with the height of the layered cross section and storing the triangular patch intersecting the layered cross section after excluding the triangular patch not intersecting the layered cross section according to the comparison result includes:
and reordering and marking the stored triangular patches according to the point heights of the stored triangular patches, and establishing an adjacency relation.
In the present invention, the step of comparing the point height of the triangular patch with the height of the layered cross section and storing the triangular patch intersecting the layered cross section after excluding the triangular patch not intersecting the layered cross section according to the comparison result includes:
the triangular patch with the highest point height less than the height of the hierarchical cross section is deleted from all ordered sequences.
The invention, comparing the point height of the triangular patch with the height of the layered cross section, and saving the triangular patch intersected with the layered cross section after excluding the triangular patch not intersected with the layered cross section according to the comparison result, comprises:
and aiming at the triangular patch with the lowest point higher than the height of the layered section, performing additional caching after elimination, and acquiring the cached triangular patch before comparing the height of the next layered section.
In the invention, the method also comprises the following steps: and after the contour of the current hierarchical section is determined, obtaining the height of the next hierarchical section, obtaining the stored triangular patch and the cached triangular patch, repeating the comparison process of the point height of the triangular patch and the height of the hierarchical section according to the height of the next hierarchical section, and determining the contour of the next hierarchical section.
The invention also provides a three-dimensional printing method, which comprises the following steps:
constructing a three-dimensional model;
obtaining the outline of the layered section according to any one of the three-dimensional model layered section determining methods; and
and performing filling printing according to the outline of the layered section.
In the invention, the step of constructing the three-dimensional model comprises the following steps:
acquiring a digital elevation model image and a remote sensing image;
and superposing the orthographic remote sensing image on the basis of the elevation model image, and generating the three-dimensional model.
In the invention, the step of constructing the three-dimensional model comprises the following steps:
and carrying out color assignment on the three-dimensional model according to the remote sensing image.
The technical scheme provided by the invention can have the following beneficial effects:
according to the method, the triangular patches which are not intersected with the layered section are eliminated, only the triangular patches which are intersected with the layered section are stored, so that the calculation efficiency of the outline of the layered section is gradually improved along with the gradual reduction of the triangular patches which are intersected with the layered section, and meanwhile, the layering efficiency of the three-dimensional model is further improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
FIG. 1 illustrates a flow diagram of a method for determining a three-dimensional model hierarchy section in an exemplary embodiment of the invention;
FIG. 2 illustrates a logical representation of a method of determining a hierarchical section of a three-dimensional model in an exemplary embodiment of the invention;
FIG. 3 illustrates a schematic flow chart for building a three-dimensional model in an exemplary embodiment of the invention;
fig. 4 shows a schematic diagram of a storage medium in an exemplary embodiment of the invention.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Furthermore, the drawings are merely schematic illustrations of embodiments of the invention, which are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities.
It is first provided in this exemplary embodiment, with reference to fig. 1, that the method comprises the following steps:
step S101: and acquiring data of the triangular mesh of the three-dimensional model.
Step S102: the height of the current slice section is determined.
Step S103: and sequencing and marking according to the point heights of the triangular patches in the three-dimensional model.
Step S104: comparing the point height of the triangular patch with the height of the layered cross section, and saving the triangular patch intersected with the layered cross section after excluding the triangular patch not intersected with the layered cross section according to the comparison result.
Step S105: and calculating the intersection point of the reserved triangular patch and the plane where the layered section is located, and determining the outline of the current layered section.
It is to be understood that Stereolithography (STL) is a standard triangle language. The 3D model file with STL as a suffix becomes a standard file for 3D printing, and almost all rapid prototyping machines can receive the STL file format for printing. After the STL file is saved, all surfaces and curves of the design are converted into a triangular mesh, which is generally composed of a series of triangles, i.e., triangular patches whose dimensions represent the exact geometric meaning in the design prototype. Many triangular patches may exhibit smooth curves, which requires the derivation of high resolution STL files, but some of these triangular patches may become so small that they are imperceptible to a machine. This requires saving the STL file to the appropriate resolution.
It should also be understood that the data for the three-dimensional model is not limited to a specific form, and for example, the three-dimensional model may be designed using CAD software, or may be designed using ArcGis software or the like. Specifically, when the ArcGis software is used, the Digital Elevation Model (DEM) data is modeled using the ArcGis and data in a format required for 3D printing is generated. That is, the designed three-dimensional model is converted into an STL file of a triangular mesh. And setting an elevation scale of the sand table according to the thickness of the actual terrain and the engraving plate for 3D printing. After the STL file is imported, all data points except the vector coordinates of the division are sequenced according to the z value, and finally a completely effective triangular patch sequence is obtained.
It is also understood that the layered cross-section refers to the shape of the layered cross-section of each layer after the three-dimensional model is layered. I.e. the shape to be printed on each layer. And the height N of the layered cross-section may be the height of the layered lower surface of each layer, i.e., the height at which each layer will start printing. Which may also be referred to as the tangent plane height Z.
It should also be understood that for three-dimensional models such as sand tables, the contour of the layered section closer to the top is smaller along with the 3D printing process, and therefore the triangular patch intersecting the layered section is less and less. The operation efficiency is also faster and faster.
By the method, the triangular patches which are not intersected with the layered section are eliminated, and only the triangular patches which are intersected with the layered section are stored, so that the calculation efficiency of the profile of the layered section is gradually improved along with the gradual reduction of the triangular patches which are intersected with the layered section, and meanwhile, the layering efficiency of the three-dimensional model is further improved.
Hereinafter, the above-described method in the present exemplary embodiment will be described in more detail with reference to fig. 1 to 2.
In some embodiments, referring to what is shown in fig. 2, step S103 further comprises:
and respectively sequencing and marking according to the point heights of the highest point and the lowest point of the triangular patch in the three-dimensional model.
It should be understood that, specifically, sorting and ID identification are performed according to the Zmax value in the layering direction, when Zmax is the same and Zmin is arranged in front, the sorting result is stored in the array Ars1, and similarly, sorting and ID identification are also performed according to Zmin value and the sorting and identification result is stored in the array Ars 2. By respectively sequencing and marking the points of the highest point and the lowest point of the triangular patch, different data of the triangular patch can be respectively analyzed, and therefore processing such as deleting or storing can be more efficiently carried out.
In some embodiments, referring to fig. 2, step S104 further comprises:
storing the triangular patch which meets the following conditions: the height of the highest point is more than or equal to the height of the layered cross section, and the height of the lowest point is less than or equal to the height of the layered cross section.
It should be understood that, as can be seen from the characteristics of STL data, the triangular mesh with a small Zmin value is cut first, and the triangular mesh with a large Zmax is cut by the cutter, when the cutting plane height Z satisfies: when Zmin < Z < Zmax, the effective triangular patch is obtained; the set of triangular meshes between adjacent sets of panels or tangent planes is continuous and varies little. And sorting the STL file twice according to the two points to finally obtain a completely effective triangular patch sequence. The effective triangular patch can be more accurately maintained through the conditions.
In some embodiments, referring to fig. 2, step S104 further comprises:
and reordering and marking the stored triangular patches according to the point heights of the stored triangular patches, and establishing an adjacency relation.
It is to be understood that the STL file is derived by triangulating the three-dimensional model surface with a series of small triangular patches. The hierarchical slicing is performed by intersecting the small triangular patches with a section plane (generally, a section plane is a section plane in the height direction, and z is ci, i is 1,2, …, n) to form a closed polygon boundary formed by small broken lines. The rapid prototyping is to fill the plane figure, and the plane figure is overlapped layer by layer along the height direction to form a physical model finally. Triangular patch meshes are distributed in a scattered manner in an STL file, and only by organizing the meshes in a certain relation and then solving the intersection point of a section plane and the edge of the triangular mesh to form an ordered point set can the triangular patch meshes become meaningful plane boundaries. In a correct STL file, each edge of a triangle is shared by only two triangle meshes. If a pair of triangular meshes share an edge, they are said to be adjacent to each other. Thus, each triangle has and only 3 triangular meshes adjacent to it. Taking a cube as an example, each face of the cube is divided into 2 triangular patches, and 12 triangular patch grids are numbered as 0,1,2, … and 11, and the hierarchical slicing is to sequentially obtain the intersection points of the section planes and the edges of the triangular meshes according to the adjacency relation among the grids and form an ordered data sequence.
If T represents a triangular mesh, the adjacency between meshes may be represented by an undirected graph G:
abstractly represents G as:
G＝(T，{E})； (1)
t represents the set of triangular patches in the cube:
T＝T 0 ，T 1 ，T 2 ，…，T 11 ； (2)
e represents the set of adjacency for each triangular patch, represented as a pair of unordered pairs:
E＝{(T 0 ,T 1 ),(T 0 ,T 2 ),(T 0 ,T 11 ),(T 1 ,T 4 ),(T 1 ,T 8 ),(T 2 ,T 3 ),(T 2 ,T 10 ),(T 3 ,T 4 ),(T 3 ,T 7 ),(T 4 ,T 5 ),(T 5 ,T 7 ),(T 5 ,T 8 ),(T 6 ,T 7 ),(T 6 ,T 9 ),(T 6 ,T 10 ),(T 8 ,T 9 ),(T 9 ,T 11 ),(T 10 ,T 11 )} (3)
if the undirected graph is stored in array representation, the adjacency matrix of the graph is:
in the formula, element 1 represents that there is an adjacency between the triangular patches. Each row of the adjacency matrix has only 3 elements 1 and the rest 0, and is a symmetric matrix. When n is large, the amount of storage of the matrix will be prohibitively large. For this purpose, an adjacent vector is introduced, i.e. element 1 in each row of the matrix is modified to the corresponding column number, and becomes a 3-dimensional vector Adj [3], e.g. the first row is modified to [1,2,11], which indicates that triangle T0 is adjacent to triangles T1, T2 and T11, respectively. While the flag is introduced. The flag-1 indicates that the triangle has been cut, and the flag-0 indicates that the triangle has not been cut. The reconstructed STL file expresses the information of the triangular patch and the adjacency relationship between the meshes in the form:
Typede f struct triang le{
V1[3]；
V2[3]；
V3[3]；
n[3]；
adj [3 ]; // adjacency vector
Flag；
}triang le；
The random mesh can be represented as an undirected graph by establishing adjacency relations between triangular meshes, and then slicing the model in the height direction, and its mathematical essence is that a triangular patch is intersected by a section plane with z ci (i 1,2, …, n), and intersection points with the edges of the mesh are obtained, and the connection lines of all the intersection points of the layer form a closed polygon.
In some embodiments, referring to fig. 2, step S104 further comprises:
triangular patches with the highest point having a height less than the height of the hierarchical cross-section are deleted from all sorted sequences.
It should be understood that the sorting and ID identification are performed according to the value of the point height Zmax of the highest point of the triangular patch, and when Zmax is the same and Zmin is arranged in the front, the sorting result is stored in the array Ars 1. The triangular patches of Zmax < N in Ars1 are deleted, along with the corresponding patches in the other sequences (e.g., Ars 2). And irrelevant patches are removed, and the subsequent judgment speed is increased. And with the progress of layering, the layering height gradually increases, and with the increase of the triangular patches deleted in the front, the total quantity of the triangular patches to be compared and judged in the later stage is also less and less, so that the calculation efficiency of the layering section is gradually improved.
In some embodiments, referring to fig. 2, step S104 further comprises:
and aiming at the triangular patch with the lowest point and the height higher than the height of the layering section, performing additional caching after elimination, and acquiring the cached triangular patch before comparing the height of the next layering section.
It should be understood that sorting and ID identification are performed according to the size of Zmax values in the layering direction, when Zmax is the same and Zmin is arranged in front, sorting results are stored in the array Ars1, sorting and identification are performed according to Zmin values in the same manner, and the results are stored in the array Ars 2. The triangular patches of Zmin > N in Ars2 are cropped into Ars2_ s, while the corresponding patches in Ars1 are cropped into Ars1_ s. After the contour determination of the current slice section is completed, Ars1_ s and Ars2_ s are assigned to Ars1 and Ars2, respectively. And the new triangular patches in Ars1 and Ars2 are used to compare the height of the next slice. Therefore, when the triangular patch which cannot be used for the current layering is discharged, the triangular patches which are used for other layering are reserved, and the situation that the triangular patch which is used later is lost is avoided.
In some embodiments, referring to fig. 2, the method further comprises:
after the contour of the current hierarchical section is determined, the height of the next hierarchical section is obtained, the stored triangular patch and the cached triangular patch are obtained, the comparison process of the point height of the triangular patch and the height of the hierarchical section is repeated according to the height of the next hierarchical section, and the contour of the next hierarchical section is determined.
It should be understood that 3D printing starts from the bottom of the three-dimensional model and increases layer by layer to the top of the three-dimensional model. The next layered cross section thus refers to the layered cross section above the current layered cross section. That is to say the height of the layered cross-section is gradually increased.
Specifically, sorting and ID identification are carried out according to the Zmax values in the layering direction, when the Zmax values are the same and the Zmin values are arranged in front, sorting results are stored in an Array1, sorting is carried out according to the Zmin values in the same way, and sorting and identification results are stored in an Array 2. Screening the effective triangular patches of each layer according to the height N of the layered section:
the triangle patch of Zmax < N in Array1 is deleted, and the corresponding patch in Array2 is deleted.
② the triangle patch with Zmin > N in Array2 is cut into Array2_ s, and the corresponding patch in Array1 is cut into Array1_ s. The remaining triangular patches in Array1 or Array2 and the valid patches that completely intersect with layer N are placed in the Data Array.
Traversing the triangular surface patches by adopting a dichotomy, and classifying the surface patches according to the layer number;
assigning Array1_ s and Array2_ s to Array1 and Array2 respectively to loop (c) -until all cut planes find valid triangle patch sequences.
There is further provided in this example embodiment a method of three-dimensional printing, comprising: constructing a three-dimensional model; obtaining the outline of the layered section according to the method for determining the layered section of the three-dimensional model in any embodiment; and performing filling printing according to the outline of the layered section.
It should be understood that, in order to build an accurate three-dimensional model, a plurality of methods are adopted to jointly acquire data from actual surface data. The method specifically comprises the following steps: a digital elevation model DEM is extracted from the digital terrain map, a stereopair (aerial photo and space remote sensing photo) is processed in a photogrammetry mode to extract the DEM, and the DEM is generated from field digital terrain measurement records (digital elevation).
It is also understood that the outline of the cross-section of each slice is extracted and the fill scan printing is performed within the outer outline. The specific filling strategies comprise an x-direction filling mode and a y-direction filling mode, and the partitioning strategies comprise a triangular partition mode, a rectangular partition mode and a hexagonal partition mode. The partition strategy can be infinitely combined with the filling strategy or the partition strategy, and various partition filling forms are evolved.
The 3D color sand table prepared by the method combines post-processing technologies such as acoustics and optics, so that the sand table is vivid in effect and rich in details. Meanwhile, by utilizing Geographic Information (GIS), a three-dimensional data visualization technology and a virtual interaction technology, a coastal defense military network is used as a supporting environment, multiple data such as basic space data, deployment data and three-dimensional model data of the whole area are combined with the geographic information technology, a three-dimensional visualization digital sand table is constructed based on a unified platform and unified data standards, situation simulation and decision of a battlefield are realized, and basic technical support is provided for teaching, coastal defense management and control and decision.
Next, the above-described method in the present exemplary embodiment will be described in more detail with reference to fig. 3.
In some embodiments, referring to fig. 3, the step of building the three-dimensional model includes:
acquiring a digital elevation model image and a remote sensing image;
and superposing the orthographic remote sensing image on the basis of the elevation model image, and generating a three-dimensional model.
It will be appreciated that the orthographic remote sensing image is superimposed on the DEM to produce a three dimensional model. Because the remote sensing image inevitably has distortion, corresponding geometric correction processing is required before superposition. The remote sensing image and the DEM need to be registered to realize the correlation of space coordinates, the deformation of the image is calculated by a mathematical fitting method, then the geometric correction is carried out to realize the deformation correction of the image, and meanwhile, the chromatic aberration, the color saturation and the contrast of the image are adjusted to improve the image quality.
In some embodiments, referring to fig. 3, the step of constructing the three-dimensional model includes:
and carrying out color assignment on the three-dimensional model according to the remote sensing image.
It is to be understood that the registration of the remote sensing image with the DEM image is the basis for making the three-dimensional landscape map. The graph generated after the ground model processing is a three-dimensional curved surface representing the real relief, but has no characteristics of all elements of the ground surface required by the reality, so related textures are required to be added to carry out color assignment on the three-dimensional curved surface. And finally, selecting a proper waveband to carry out false color synthesis to generate a true color synthetic image of the orthometric vegetation, and constructing a final three-dimensional model.
Also provided in this example embodiment is a computer readable storage medium having a computer program stored thereon, which when executed by, for example, a processor, can implement the steps of the combined navigation method for a rotorcraft in any one of the above-described embodiments. In some possible embodiments, the various aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above-mentioned control method section of the present description, when said program product is run on the terminal device.
Referring to fig. 4, a program product 500 for implementing the above method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable storage medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In situations involving remote computing devices, the remote computing devices may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to external computing devices (e.g., through the internet using an internet service provider).
It is to be understood that the terms "central," "longitudinal," "lateral," "length," "width," "thickness," "upper," "lower," "front," "rear," "left," "right," "vertical," "horizontal," "top," "bottom," "inner," "outer," "clockwise," "counterclockwise," and the like in the foregoing description are used for indicating or indicating the orientation or positional relationship illustrated in the drawings, and are used merely for convenience in describing embodiments of the present invention and for simplifying the description, and do not indicate or imply that the device or element so referred to must have a particular orientation, be constructed and operated in a particular orientation, and therefore should not be construed as limiting the embodiments of the present invention.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the embodiments of the present invention, "a plurality" means two or more unless specifically limited otherwise.
In the embodiments of the present invention, unless otherwise explicitly specified or limited, the terms "mounted," "connected," "fixed," and the like are to be construed broadly, e.g., as being fixedly connected, detachably connected, or integrated; can be mechanically or electrically connected; either directly or indirectly through intervening media, either internally or in any other relationship. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
In embodiments of the present invention, unless expressly stated or limited otherwise, the recitation of a first feature "on" or "under" a second feature may include the recitation of the first and second features being in direct contact, and may also include the recitation of the first and second features not being in direct contact, but being in contact with another feature between them. Also, the first feature being "on," "above" and "over" the second feature includes the first feature being directly on and obliquely above the second feature, or merely indicating that the first feature is at a higher level than the second feature. "beneath," "under" and "beneath" a first feature includes the first feature being directly beneath and obliquely beneath the second feature, or simply indicating that the first feature is at a lesser elevation than the second feature.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples described in this specification can be combined and combined by those skilled in the art.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
Claims (10)
1. A method for determining a layered cross-section of a three-dimensional model, comprising:
acquiring data of a triangular mesh of the three-dimensional model;
determining the height of the current layering section;
sorting and marking according to the point heights of the triangular patches in the three-dimensional model;
comparing the point height of the triangular patch with the height of the layered cross section, and saving the triangular patch intersected with the layered cross section after excluding the triangular patch not intersected with the layered cross section according to the comparison result;
and calculating the intersection point of the reserved triangular patch and the plane where the layered section is located, and determining the contour of the current layered section.
2. The method of claim 1, wherein the step of ordering and labeling based on the point heights of the triangular patches in the three-dimensional model comprises:
and respectively sequencing and marking according to the point heights of the highest point and the lowest point of the triangular patch in the three-dimensional model.
3. The method of claim 1, wherein the step of storing the triangular patch intersecting the hierarchical cross section after excluding the triangular patch not intersecting the hierarchical cross section by comparing the point height of the triangular patch with the height of the hierarchical cross section according to the comparison result comprises:
storing the triangular patch which meets the following conditions: the height of the highest point is greater than or equal to the height of the layered cross section, and the height of the lowest point is less than or equal to the height of the layered cross section.
4. The method of claim 1, wherein the step of storing the triangular patch intersecting the hierarchical cross-section after excluding the triangular patch not intersecting the hierarchical cross-section by comparing the point height of the triangular patch and the height of the hierarchical cross-section according to the comparison result comprises:
and reordering and marking the stored triangular patches according to the point heights of the stored triangular patches, and establishing an adjacency relation.
5. The method according to any one of claims 1 to 4, wherein the step of storing the triangular patch intersecting the hierarchical cross-section after excluding the triangular patch not intersecting the hierarchical cross-section by comparing the point height of the triangular patch with the height of the hierarchical cross-section according to the comparison result comprises:
triangular patches with the highest point having a height less than the height of the hierarchical cross-section are deleted from all sorted sequences.
6. The method of claim 5, wherein the step of saving the triangular patch intersecting the hierarchical cross-section after excluding the triangular patch not intersecting the hierarchical cross-section by comparing the point height of the triangular patch with the height of the hierarchical cross-section according to the comparison result comprises:
and aiming at the triangular patch with the lowest point higher than the height of the layered section, performing additional caching after elimination, and acquiring the cached triangular patch before comparing the height of the next layered section.
7. The method of claim 6, further comprising:
and after the contour of the current hierarchical section is determined, obtaining the height of the next hierarchical section, obtaining the stored triangular patch and the cached triangular patch, repeating the comparison process of the point height of the triangular patch and the height of the hierarchical section according to the height of the next hierarchical section, and determining the contour of the next hierarchical section.
8. A method of three-dimensional printing, comprising:
constructing a three-dimensional model;
obtaining the outline of the layered cross section according to the method for determining the layered cross section of the three-dimensional model of any one of claims 1 to 7; and
and performing filling printing according to the outline of the layered section.
9. The method of claim 8, wherein the step of constructing a three-dimensional model comprises:
acquiring a digital elevation model image and a remote sensing image;
and superposing the orthographic remote sensing image on the basis of the elevation model image, and generating the three-dimensional model.
10. The method of claim 9, wherein the step of constructing a three-dimensional model comprises:
and carrying out color assignment on the three-dimensional model according to the remote sensing image.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210883677.9A CN115027060A (en) | 2022-07-26 | 2022-07-26 | Determination method of three-dimensional model layered section and three-dimensional printing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210883677.9A CN115027060A (en) | 2022-07-26 | 2022-07-26 | Determination method of three-dimensional model layered section and three-dimensional printing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115027060A true CN115027060A (en) | 2022-09-09 |
Family
ID=83130232
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210883677.9A Pending CN115027060A (en) | 2022-07-26 | 2022-07-26 | Determination method of three-dimensional model layered section and three-dimensional printing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115027060A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108724734A (en) * | 2018-05-23 | 2018-11-02 | 西安理工大学 | A kind of 3D printing pre-treatment hierarchical algorithm based on dense feature |
| CN113681901A (en) * | 2021-09-07 | 2021-11-23 | 中国人民解放军陆军边海防学院 | Sand table forming dynamic slicing method based on three-dimensional data driving |
-
2022
- 2022-07-26 CN CN202210883677.9A patent/CN115027060A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108724734A (en) * | 2018-05-23 | 2018-11-02 | 西安理工大学 | A kind of 3D printing pre-treatment hierarchical algorithm based on dense feature |
| CN113681901A (en) * | 2021-09-07 | 2021-11-23 | 中国人民解放军陆军边海防学院 | Sand table forming dynamic slicing method based on three-dimensional data driving |
Non-Patent Citations (2)
| Title |
|---|
| 王春香: "快速成型中基于MATLAB软件的STL模型的分层优化", 机床与液压, vol. 42, no. 21, 30 November 2014 (2014-11-30), pages 113 - 117 * |
| 谢存禧: "STL文件毗邻关系的建立与切片算法研究", 华南理工大学学报, vol. 28, no. 3, 31 March 2000 (2000-03-31), pages 33 - 38 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103761397B (en) | Three-dimensional model slice for surface exposure additive forming and projection plane generating method | |
| CN113706698A (en) | Live-action three-dimensional road reconstruction method and device, storage medium and electronic equipment | |
| KR20100136604A (en) | Real-time visualization system of 3 dimension terrain image | |
| CN109544683B (en) | Urban building group seismic response dynamic visualization method based on oblique photography data | |
| CN109934911B (en) | OpenGL-based three-dimensional modeling method for high-precision oblique photography of mobile terminal | |
| CN105427380A (en) | Three-dimensional map data processing method based on multiple detailed layers | |
| CN107170033A (en) | Smart city 3D live-action map systems based on laser radar technique | |
| CN105184250A (en) | Ground object classification method based on electric power corridor airborne LiDAR point cloud data | |
| JP2011501301A (en) | Geospatial modeling system and related methods using multiple sources of geographic information | |
| CN109544672A (en) | A kind of three-dimensional building model texture mapping method and device | |
| KR20140062831A (en) | Method for acquiring and processing a variety of three-dimensional data to product a precise wide-area scale model | |
| CN113012063B (en) | Dynamic point cloud repairing method and device and computer equipment | |
| CN106611438B (en) | Local area updating and map cutting method and device of three-dimensional simulation map | |
| CN112925865A (en) | 3D WebGIS prediction analysis method and system for mining area ground surface movement deformation | |
| TW200907856A (en) | Geospatial modeling system providing data thinning of geospatial data points and related methods | |
| CN113920275B (en) | Triangular mesh construction method and device, electronic equipment and readable storage medium | |
| CN114511546A (en) | Laser point cloud forest breast diameter obtaining method based on DBSCAN clustering and four quadrants | |
| CN112687007A (en) | LOD technology-based stereo grid map generation method | |
| CN115027060A (en) | Determination method of three-dimensional model layered section and three-dimensional printing method | |
| Agrawal et al. | Conversion of a GIS surface data directly to a 3D STL part for terrain modeling | |
| CN115713600A (en) | Method and device for generating digital elevation model of automatic driving scene | |
| Pacina et al. | Pre‐dam valley reconstruction based on archival spatial data sources: Methods, accuracy, and 3D printing possibilities | |
| CN114528305A (en) | Vector data updating range determining method and device, electronic equipment and storage medium | |
| CN106570934A (en) | Modeling method for spatial implicit function in large-scale scene | |
| CN113066157B (en) | CIM platform-based data hierarchical request rendering method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |