CN107491481B - LOD model searching method and system, method for establishing LOD model database and computer-readable storage medium - Google Patents
LOD model searching method and system, method for establishing LOD model database and computer-readable storage medium Download PDFInfo
- Publication number
- CN107491481B CN107491481B CN201710557911.8A CN201710557911A CN107491481B CN 107491481 B CN107491481 B CN 107491481B CN 201710557911 A CN201710557911 A CN 201710557911A CN 107491481 B CN107491481 B CN 107491481B
- Authority
- CN
- China
- Prior art keywords
- model
- parameters
- simplified
- searched
- vertex
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
Abstract
The invention relates to the technical field of 3D, in particular to an LOD model searching method and system, a method for establishing an LOD model database and a computer-readable storage medium. The LOD model searching method comprises the following steps: inputting a model to be searched; obtaining vertex parameters of a model to be searched, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure; simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, wherein the ordering rule of the simplified parameters of the simplified model to be searched after the simplified processing is consistent with the ordering rule of the simplified parameters of the model in the database; comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database; and outputting the search result. The LOD model searching method and system, the method for establishing the LOD model database and the computer readable storage medium greatly reduce the data amount to be processed, accelerate the running speed of the computer and improve the searching efficiency.
Description
[ technical field ] A method for producing a semiconductor device
The invention relates to the technical field of 3D, in particular to an LOD model searching method and system, a method for establishing an LOD model database and a computer-readable storage medium.
[ background of the invention ]
At present, 3D models are more and more widely applied, and industrial product design, virtual reality, 3D games, movie animation and the like widely use the 3D models. And a large number of 3D models are generated and propagated every day, there is an urgent need for retrieving 3D models.
However, since the 3D models are stored in large amounts and are generally calculated in megabytes, the amount of computer operation calculation is too large when searching for a 3D model, which results in a slow search speed and a low search efficiency. However, this problem has become a critical issue to be solved urgently in the field of 3D technology.
[ summary of the invention ]
Aiming at the problem of low search efficiency of the existing 3D model search, the invention provides an LOD model search method and system, a method for establishing an LOD model database and a computer-readable storage medium.
The invention provides a LOD model searching method, which is used for searching matched models from a database, wherein each model in the database has simplified parameters representing the characteristics of the model, and the LOD model searching method comprises the following steps:
inputting a model to be searched;
obtaining vertex parameters of a model to be searched, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the simplified parameters of the simplified model to be searched after the simplified processing to be consistent with the ordering rule of the simplified parameters of the model in the database;
comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database; and
outputting a search result;
the simplification treatment specifically comprises the following steps 1:
acquiring vertex parameters on the outer surface of the model to be searched;
selecting 6 vertexes corresponding to 4 triangles on the outer surface of the model corresponding to the vertex parameters, wherein the 4 triangles comprise 1 central triangle and 3 edge triangles, and the 3 edge triangles are respectively shared with 3 sides of the central triangle;
deleting three vertexes corresponding to the central triangle;
repeating the steps until the number of the vertexes is reduced to a threshold value, wherein the simplified parameters representing the model characteristics at least comprise vertex coordinates of the threshold vertexes; or
The simplified processing comprises the following steps of 2:
acquiring a vertex three-dimensional coordinate on the outer surface of the model to be searched and a topological structure parameter corresponding to the vertex;
acquiring three-dimensional coordinates of 6 vertexes and topological structure parameters corresponding to the vertexes; no other vertexes exist in an area formed by connecting the 6 vertexes in sequence;
deleting three nonadjacent vertexes in the 6 vertexes; the area of a triangle formed by sequentially connecting the three nonadjacent vertexes is minimum;
and repeating the steps until the number of the vertexes is reduced to the threshold value, wherein the simplified parameters representing the model characteristics at least comprise vertex coordinates of the threshold number of the vertexes.
Preferably, the simplified processing further includes the following steps before deleting three vertices corresponding to the central triangle:
calculating the included angle of the normal lines of the central triangle and any edge triangle, and continuing the next step if the included angle is smaller than a threshold value; if the included angle is larger than the threshold value, other four triangles are reselected.
Preferably, the comparison of the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database comprises the steps of:
step S1: calculating offset, comparing at least two vertex coordinates in the simplified parameters of the model to be searched with at least two vertex coordinates in the simplified parameters of the stored model in the database, and obtaining at least two offsets;
step S2: judging the similarity of the offsets, calculating the similarity of at least two offsets, comparing whether the similarity is greater than a threshold value, continuing to the next step S3 if the similarity is greater than the threshold value, and comparing the next model or finishing the searching action if the similarity is less than the threshold value;
step S3: correcting the simplified parameters of the model to be searched according to the offset to obtain standardized simplified parameters of the model to be searched;
step S4: and comparing the standardized simplified parameters of the model to be searched with the simplified parameters of the model stored in the database, and judging whether the model stored in the database is matched with the model to be searched according to the similarity of the standardized simplified parameters and the simplified parameters of the model stored in the database.
Preferably, the LOD model search method further includes the following steps before the model to be searched is subjected to the simplification processing:
and processing the model to be searched according to a preset scale.
The present invention also provides an LOD model search system for searching for a matching model from a database, each model in the database having simplified parameters representing characteristics of the model, the LOD model search system comprising:
the input module is used for inputting a model to be searched;
the acquisition module is used for acquiring vertex parameters of the model to be searched, and the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
the processing module is used for simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the simplified parameters of the simplified model to be searched to be consistent with the ordering rule of the simplified parameters of the model in the database;
the comparison module is used for comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database;
the output module is used for outputting the search result;
the simplified process includes step 1 or step 2 as described above.
Preferably, the LOD model search system further includes a storage module, and the storage module is configured to transmit the simplified model to be searched and the simplified parameters thereof to the database for storage after completing the LOD model search.
The invention also provides a method for establishing the LOD model database, which comprises the following steps:
inputting a model;
obtaining vertex parameters of the model, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
simplifying the vertex parameters of the model to obtain simplified parameters of the model, wherein the simplified models follow the same ordering rule;
storing the simplified model and the simplified parameters thereof to form a database;
the simplified process includes step 1 or step 2 as described above.
The present invention also provides a computer-readable storage medium for storing a computer program for performing a LOD model search, the computer program executing the steps of:
inputting a model to be searched;
obtaining vertex parameters of a model to be searched, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the simplified parameters of the simplified model to be searched after the simplified processing to be consistent with the ordering rule of the simplified parameters of the model in the database;
comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database; and
outputting a search result;
the simplified process includes step 1 or step 2 as described above.
Compared with the prior art, the LOD model searching method reduces the number of the vertexes, compares the three-dimensional coordinates of the remaining vertexes serving as the feature data with the model stored in the database, greatly reduces the data volume needing to be processed, accelerates the running speed of a computer and improves the searching efficiency.
Compared with the prior art, the LOD model searching system greatly reduces the data volume needing to be processed, accelerates the running speed of a computer and improves the searching efficiency.
Compared with the prior art, the method for establishing the LOD model database establishes a system convenient for searching the LOD model, so that the method is more convenient for users to use and has high searching efficiency.
[ description of the drawings ]
Fig. 1 is a flowchart illustrating a method for searching for an LOD model according to a first embodiment of the present invention.
FIG. 2 is a flowchart illustrating simplified processing of vertex parameters of a model to be searched according to a first embodiment of the present invention.
FIG. 3 is a flowchart illustrating a variation of the simplified processing of vertex parameters of the model to be searched according to the first embodiment of the present invention.
FIG. 4 is a diagram illustrating a calculation process for reducing the number of vertices according to the first embodiment of the present invention.
FIG. 5 is a further diagram illustrating the calculation process for reducing the number of vertices according to the first embodiment of the invention.
FIG. 6 is a schematic flowchart of comparing simplified parameters of a model to be searched with simplified parameters of a model stored in a database according to a first embodiment of the present invention.
Fig. 7 is a schematic block diagram of the LOD model search system connected to the database according to the second embodiment of the present invention.
Fig. 8 is a flowchart illustrating a method for building a LOD model database according to a third embodiment of the present invention.
[ detailed description ] embodiments
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, a first embodiment of the present invention discloses an LOD (Levels of Detail) model searching method for searching matched models from a database, where each model in the database has simplified parameters representing features of the model and the simplified parameters of the models are arranged in a consistent rule, and the LOD model searching method includes the following steps:
step S1: inputting a model to be searched;
step S2: obtaining vertex parameters of a model to be searched, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
step S3: simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the simplified parameters of the simplified model to be searched after the simplified processing to be consistent with the ordering rule of the simplified parameters of the model in the database;
step S4: comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database; and
step S5: and outputting the search result.
Preferably, the LOD model search method further includes step S6:
step S6: and storing the simplified model to be searched and the simplified parameters thereof into the database, thereby continuously expanding the number of the models stored in the database.
Preferably, the LOD model searching method further includes, before the simplification process is performed on the vertex parameters of the model to be searched, step S20:
step S20: processing the model to be searched according to a preset scale, and reducing the model to be searched when the scale of the input model to be searched is larger than the preset scale; when the scale of the model to be searched is smaller than the preset scale, amplifying the model to be searched; and when the scale of the model to be searched is consistent with the preset scale, the model to be searched is not processed. The scale is consistent with the scale of the model stored in the database.
In step S1, the structure of the input model to be searched is specifically: and establishing a three-dimensional coordinate system by taking a certain point of the model to be searched as an origin and determining a plurality of vertexes. The vertices may be arranged on the inner and outer surface of the model to be searched or on the outer surface of a volume effectively containing the model to be searched. The topological structure formed by the mutual connection of the multiple vertexes surrounds the volume of the model to be searched, and every three adjacent vertexes are connected to form a plurality of triangles.
Referring to fig. 2, the step S3 specifically includes the following steps:
step S31: acquiring vertex parameters on the outer surface of the model to be searched;
step S32: selecting 6 vertexes corresponding to 4 triangles on the outer surface of the model corresponding to the vertex parameters, wherein the 4 triangles comprise 1 central triangle and 3 edge triangles, and the 3 edge triangles are respectively shared with 3 sides of the central triangle;
step S33: deleting three vertexes corresponding to the central triangle;
step S34: and repeating the steps until the number of the vertexes is reduced to the threshold value, wherein the simplified parameters representing the model characteristics at least comprise vertex coordinates of the threshold number of the vertexes.
Preferably, the step S3 further includes, between the step S32 and the step S33, a step S320:
step S320: and calculating the included angle between the normal lines of the center triangle and any one of the edge triangles, continuing to the next step S33 if the included angle is smaller than the threshold value, and re-executing the step S32 to select other four triangles if the included angle is larger than the threshold value.
Referring to fig. 3, as a variation, the step S3 may further include the following steps:
step S31': acquiring a vertex three-dimensional coordinate on the outer surface of the model to be searched and a topological structure parameter corresponding to the vertex;
step S32': acquiring three-dimensional coordinates of 6 vertexes and topological structure parameters corresponding to the vertexes; no other vertexes exist in an area formed by connecting the 6 vertexes in sequence;
step S33': deleting three nonadjacent vertexes in the 6 vertexes; the area of a triangle formed by sequentially connecting the three nonadjacent vertexes is minimum;
step S34': and repeating the steps until the number of the vertexes is reduced to the threshold value, wherein the simplified parameters representing the model characteristics at least comprise vertex coordinates of the threshold number of the vertexes.
Referring to fig. 4 and fig. 5, the specific process of simplifying the vertex parameters of the model to be searched to obtain the simplified parameters of the model to be searched includes: obtaining vertex parameters on the outer surface of the model to be searched, and selecting 4 triangles A, B, C, D on the outer surface of the model to be searched, wherein A is used as a central triangle, B, C, D is used as an edge triangle, the triangle A is composed of vertices P1, P2 and P3, the triangle B is composed of vertices P1, P2 and P4, the triangle C is composed of vertices P2, P3 and P5, and the triangle D is composed of vertices P1, P3 and P6. The four triangles A, B, C, D form a hexagon, three inner edges P1P2, P1P3 and P2P3 of the hexagon are removed, namely three vertexes P1, P2 and P3 of the initial triangle A are removed, automatic correction is carried out on the graph, namely the remaining three vertexes P4, P5 and P6 are sequentially connected by straight lines to form an optimized triangle, so that the number of the triangles is reduced from four to one, and the number of the vertexes is reduced from six to three. And repeating the steps until the number of the vertexes is reduced to the threshold value, wherein the simplified parameters representing the model characteristics at least comprise vertex coordinates of the threshold vertexes. In step S3, the threshold represents a value that the computer can smoothly run the calculation without causing too much data processing amount due to too many vertices, thereby affecting the running speed of the computer. The threshold value is set depending on the running speed of the computer, so that in the invention, the threshold value is preferably 16-32, and more preferably 16, namely when the number of vertexes is reduced to 16, the running speed of the computer is not influenced, the topological structure of the model to be searched is ignored, and only the volume effectively surrounding the model to be searched is considered.
Referring to fig. 6, the step S4 specifically includes the following steps:
step S41: calculating offset, comparing at least two vertex coordinates in the simplified parameters of the model to be searched with at least two vertex coordinates in the simplified parameters of the stored model in the database, and obtaining at least two offsets;
step S42: judging the similarity of the offsets, calculating the similarity of at least two offsets, comparing whether the similarity is greater than a threshold value, continuing to the next step S43 if the similarity is greater than the threshold value, and comparing the next model or finishing the searching action if the similarity is less than the threshold value;
step S43: correcting the simplified parameters of the model to be searched according to the offset to obtain standardized simplified parameters of the model to be searched;
step S44: comparing the standardized simplified parameters of the model to be searched with the simplified parameters of the model stored in the database, judging whether the model stored in the database is matched with the model to be searched according to the similarity of the standardized simplified parameters and the simplified parameters of the model stored in the database, if the similarity is greater than a threshold value, judging that the model is matched with the model to be searched, and if the similarity is less than the threshold value, judging that the model is not matched with the model to be searched.
In step S41, the models to be searched may be compared with the models stored in the database one by one, or the models to be searched may be compared with all the models stored in the database at the same time. It can be understood that at least three vertex coordinates of the model to be searched and at least three vertex coordinates of the model stored in the database may be correspondingly compared at the same time. Preferably, the selected at least two vertices include a first vertex of the model to be searched, wherein the first vertex is generally selected as a vertex that is farthest or closest or most featured from a center point of the model, so as to facilitate vertex ordering of the model.
In step S43, the offset amount according to which the correction is made may be any one of at least two offset amounts, or an average of at least two offset amounts.
Preferably, the method for determining the similarity between the model to be searched and the model stored in the database in step S44 is as follows: and comparing all the vertexes of the model to be searched with all the vertexes of the model in the database, calculating the variance and the mean value of all the offsets, if the variance of all the offsets is smaller than the threshold value, and the mean value is also smaller than the threshold value, judging that the model in the database is matched with the model to be searched, and otherwise, judging that the model is not matched with the model to be searched. It can be understood that all the vertexes of the model to be searched can be randomly extracted or a plurality of vertexes can be extracted according to a certain rule to be compared with the corresponding vertexes of the model in the database, so that the comparison speed is increased, and the searching efficiency is improved.
The simplified parameters of the model to be searched are compared with the simplified parameters of the stored model in the database one by one as an example for explanation: the first vertex of the model to be searched has coordinates (X1, Y1, Z1), the second vertex has coordinates (X2, Y2, Z2), the first vertex of the model stored in the database has coordinates (X3, Y3, Z3), and the second vertex has coordinates (X4, Y4, Z4). Respectively calculating the offsets of the first vertex of the model to be searched and the first vertex of the model stored in the database in the X, Y, Z direction, namely, an X1, an Y1 and an akaz 1, wherein the akax 1 is X1-X3, the akay 1 is Y1-Y3, and the akaz 1 is Z1-Z3; the second vertex of the model to be searched and the second vertex of the model stored in the database are respectively offset in the direction X, Y, Z by X2, Y2 and boaka Z2, where boaka X2-X2-X4, boaka Y2-Y2-Y4 and boaka Z2-Z2-Z4. The | boakax 1-boakax 2| was compared to a preset threshold boakax 0. If | akax 1-akax 2| akax 0, then the model stored in the database is determined to be out of match, and the next model alignment is performed or the search is completed. If | akax 1-akax 2| < akax 0, then the model stored in the database is determined to match initially; the offsets applied to the coordinates of all the vertices of the model to be searched can be either zaxa 1, zada Y1 and zada Z1, but also zada X2, zada Y2 and zada Z2, or (zada X1+ zada X2)/2, (zada Y1+ zada Y2)/2, (zada 1+ zada Z2)/2. Comparing the three-dimensional coordinates of the model to be searched after all vertexes of the model are shifted with the model stored in the database, calculating to obtain the similarity between the model to be searched and the model stored in the database, and judging that the model stored in the database is matched with the model to be searched when the similarity exceeds a threshold value; and when the similarity is smaller than the threshold value, judging that the model stored in the database is not matched with the model to be searched, and comparing the next model or finishing the search.
In the present invention, the consistency between the ordering rule of the simplified parameters of the model to be searched and the ordering rule of the simplified parameters of the stored model in the database means that: the rule of selecting the first vertex of the model to be searched is consistent with that of selecting the first vertex of the model stored in the database, namely, the vertex which is farthest or closest to the center point of the model is used as the first vertex, so that the first vertex is used as the starting point, the vertex distribution is set according to the same rule by the two vertexes, and the vertex distribution can be set sequentially in a clockwise direction or a counterclockwise direction or can be set sequentially according to a certain graph.
In the invention, the matching of the model to be searched and the stored model in the database means that the vertex topological structures of the two are approximate.
Referring to fig. 7, a second embodiment of the present invention further provides an LOD model search system, which includes:
the input module is used for inputting a model to be searched;
the acquisition module is used for acquiring vertex parameters of the model to be searched, and the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
the processing module is used for simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the simplified parameters of the simplified model to be searched to be consistent with the ordering rule of the simplified parameters of the model in the database;
the comparison module is used for comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database;
and the output module is used for outputting the search result.
The input module is connected with the acquisition module, the acquisition module is connected with the processing module, the processing module is connected with the comparison module, the output module is connected with the comparison module, and the output module and the comparison module are used for being connected with a database. The method comprises the steps that an input module inputs a model to be searched, an acquisition module acquires vertex parameters of the model to be searched, a processing module simplifies the vertex parameters of the model to be searched to acquire simplified parameters of the model to be searched, a comparison module compares the simplified parameters of the model to be searched with the simplified parameters of models stored in a database, when the comparison module compares that the model stored in the database is matched with the model to be searched, the comparison module feeds back information of the matched model to an output module, and the output module correspondingly calls the matched model from the database according to the feedback information to serve as a search result to be output; when the comparison module compares that the model stored in the database is not matched with the model to be searched, the comparison module feeds back the comparison result to the output module, the output module outputs corresponding information, and the output module outputs similar information such as 'similar model not retrieved' or 'similar model not matched'.
Preferably, the LOD model search system further includes a storage module, the storage module is connected to the processing module and the database, and the storage module transmits the simplified model to be searched and the simplified parameters thereof to the database for storage after completing the LOD model search.
Preferably, before all models in the LOD model search system are stored, the processing module performs simplification processing on all models and then stores the models in the database, and the simplified parameters of all models after simplification processing all follow the same sorting rule.
Referring to fig. 8, a third embodiment of the present invention further provides a method for building an LOD model database, where the method for building an LOD model database includes the following steps:
step S61: inputting a model;
step S62: obtaining vertex parameters of the model, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
step S63: simplifying the vertex parameters of the model to obtain simplified parameters of the model, wherein the simplified models follow the same ordering rule;
step S64: and storing the simplified processed model and the simplified parameters thereof to form a database.
The present invention also provides a computer-readable storage medium for storing a computer program for LOD model search, the computer program being configured to search a database for a matching model, each model in the database having simplified parameters representing features of the model, and the simplified parameters of the models being arranged in a uniform order, the computer program, when run on a computer, performing the steps of:
step S1: inputting a model to be searched;
step S2: obtaining vertex parameters of a model to be searched, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
step S3: simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the vertex of the model to be searched after the simplification processing to be consistent with the ordering rule of the vertex of the model in the database;
step S4: comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database;
step S5: and outputting the search result.
The general form of computer readable media includes: floppy disk (floppy disk), flexible disk (flexible disk), hard disk, magnetic tape, any other magnetic medium, CD-ROM, any other optical medium, punch cards (punchcards), paper tape (paper tape), any other physical medium with patterns of holes, Random Access Memory (RAM), Programmable Read Only Memory (PROM), Erasable Programmable Read Only Memory (EPROM), FLASH erasable programmable read only memory (FLASH-EPROM), any other memory chip or cartridge (cartridge), or any other medium from which a computer can read. The instructions may further be transmitted or received by a transmission medium. The term "transmission medium" may include any tangible or intangible medium that is operable to store, encode, or carry instructions for execution by the machine, and includes digital or analog communications signals or other intangible medium to facilitate communication of such instructions. Transmission media include coaxial cables, copper wire and fiber optics, including the wires that comprise a bus for transmitting a computer data signal.
Compared with the prior art, the LOD model searching method reduces the number of the vertexes, compares the three-dimensional coordinates of the remaining vertexes serving as the feature data with the model stored in the database, greatly reduces the data volume needing to be processed, accelerates the running speed of a computer and improves the searching efficiency.
Compared with the prior art, the LOD model searching system greatly reduces the data volume needing to be processed, accelerates the running speed of a computer and improves the searching efficiency.
Compared with the prior art, the method for establishing the LOD model database establishes a system convenient for searching the LOD model, so that the method is more convenient for users to use and has high searching efficiency.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit of the present invention are intended to be included within the scope of the present invention.
Claims (8)
1. A method for searching for a matched model from a database, each model in the database having simplified parameters representing characteristics of the model, the method comprising the steps of:
inputting a model to be searched;
obtaining vertex parameters of a model to be searched, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the simplified parameters of the simplified model to be searched after the simplified processing to be consistent with the ordering rule of the simplified parameters of the model in the database;
comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database; and
outputting a search result;
the simplification treatment specifically comprises the following steps 1:
acquiring vertex parameters on the outer surface of the model to be searched;
selecting 6 vertexes corresponding to 4 triangles on the outer surface of the model corresponding to the vertex parameters, wherein the 4 triangles comprise 1 central triangle and 3 edge triangles, and the 3 edge triangles are respectively shared with 3 sides of the central triangle;
deleting three vertexes corresponding to the central triangle;
repeating the steps until the number of the vertexes is reduced to a threshold value, wherein the simplified parameters representing the model characteristics at least comprise vertex coordinates of the threshold vertexes; or
The simplified processing comprises the following steps of 2:
acquiring a vertex three-dimensional coordinate on the outer surface of the model to be searched and a topological structure parameter corresponding to the vertex;
acquiring three-dimensional coordinates of 6 vertexes and topological structure parameters corresponding to the vertexes; no other vertexes exist in an area formed by connecting the 6 vertexes in sequence;
deleting three nonadjacent vertexes in the 6 vertexes; the area of a triangle formed by sequentially connecting the three nonadjacent vertexes is minimum;
and repeating the steps until the number of the vertexes is reduced to the threshold value, wherein the simplified parameters representing the model characteristics at least comprise vertex coordinates of the threshold number of the vertexes.
2. The LOD model searching method of claim 1, wherein: the simplified processing further comprises the following steps before deleting the three vertices corresponding to the central triangle:
calculating the included angle of the normal lines of the central triangle and any edge triangle, and continuing the next step if the included angle is smaller than a threshold value; if the included angle is larger than the threshold value, other four triangles are reselected.
3. The LOD model searching method of claim 1, wherein: comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database comprises the steps of:
step S1: calculating offset, comparing at least two vertex coordinates in the simplified parameters of the model to be searched with at least two vertex coordinates in the simplified parameters of the stored model in the database, and obtaining at least two offsets;
step S2: judging the similarity of the offsets, calculating the similarity of at least two offsets, comparing whether the similarity is greater than a threshold value, continuing to the next step S3 if the similarity is greater than the threshold value, and comparing the next model or finishing the searching action if the similarity is less than the threshold value;
step S3: correcting the simplified parameters of the model to be searched according to the offset to obtain standardized simplified parameters of the model to be searched;
step S4: and comparing the standardized simplified parameters of the model to be searched with the simplified parameters of the model stored in the database, and judging whether the model stored in the database is matched with the model to be searched according to the similarity of the standardized simplified parameters and the simplified parameters of the model stored in the database.
4. The LOD model searching method of claim 1, wherein: the LOD model searching method further comprises the following steps before the model to be searched is simplified:
and processing the model to be searched according to a preset scale.
5. An LOD model search system for searching for matching models from a database, each model in the database having reduced parameters representing characteristics of the model, the LOD model search system comprising: the LOD model search system includes:
the input module is used for inputting a model to be searched;
the acquisition module is used for acquiring vertex parameters of the model to be searched, and the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
the processing module is used for simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the simplified parameters of the simplified model to be searched to be consistent with the ordering rule of the simplified parameters of the model in the database;
the comparison module is used for comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database;
the output module is used for outputting the search result;
the simplified process comprises step 1 or step 2 as described in claim 1.
6. The LOD model search system of claim 5, wherein: the LOD model searching system further comprises a storage module, wherein the storage module is used for transmitting the simplified model to be searched and the simplified parameters thereof to the database for storage after the LOD model searching is completed.
7. A method for building an LOD model database, characterized by: the method for establishing the LOD model database comprises the following steps:
inputting a model;
obtaining vertex parameters of the model, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
simplifying the vertex parameters of the model to obtain simplified parameters of the model, wherein the simplified models follow the same ordering rule;
storing the simplified model and the simplified parameters thereof to form a database;
the simplified process comprises step 1 or step 2 as described in claim 1.
8. A computer-readable storage medium for storing a computer program for performing a LOD model search, characterized in that: the computer program executes the following steps under the operation of a computer:
inputting a model to be searched;
obtaining vertex parameters of a model to be searched, wherein the vertex parameters at least comprise vertex coordinates and a vertex topological structure;
simplifying the vertex parameters of the model to be searched to obtain simplified parameters of the model to be searched, and enabling the ordering rule of the simplified parameters of the simplified model to be searched after the simplified processing to be consistent with the ordering rule of the simplified parameters of the model in the database;
comparing the simplified parameters of the model to be searched with the simplified parameters of the model stored in the database; and
outputting a search result;
the simplified process comprises step 1 or step 2 as described in claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710557911.8A CN107491481B (en) | 2017-07-10 | 2017-07-10 | LOD model searching method and system, method for establishing LOD model database and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710557911.8A CN107491481B (en) | 2017-07-10 | 2017-07-10 | LOD model searching method and system, method for establishing LOD model database and computer-readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107491481A CN107491481A (en) | 2017-12-19 |
| CN107491481B true CN107491481B (en) | 2020-08-18 |
Family
ID=60644422
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710557911.8A Active CN107491481B (en) | 2017-07-10 | 2017-07-10 | LOD model searching method and system, method for establishing LOD model database and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107491481B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110211227B (en) * | 2019-04-30 | 2023-06-09 | 深圳市思为软件技术有限公司 | Three-dimensional scene data processing method and device and terminal equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101030222A (en) * | 2007-03-22 | 2007-09-05 | 华为技术有限公司 | Model searching device and method |
| CN101308579A (en) * | 2008-05-12 | 2008-11-19 | 中山大学 | Adaptive simplifying method for three-dimensional animation model |
| CN101382934A (en) * | 2007-09-06 | 2009-03-11 | 华为技术有限公司 | Search method for multimedia model, apparatus and system |
| CN101458714A (en) * | 2008-12-30 | 2009-06-17 | 清华大学 | Three-dimensional model search method based on precision geodesic |
| CN103268634A (en) * | 2012-02-24 | 2013-08-28 | 苏州蓝海彤翔系统科技有限公司 | Quick parallel self-adaptive simplification method based on vertex clustering for out-of-core model |
| CN103714577A (en) * | 2014-01-23 | 2014-04-09 | 焦点科技股份有限公司 | Three-dimensional model simplification method suitable for model with textures |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010176347A (en) * | 2009-01-29 | 2010-08-12 | Fujitsu Ltd | Shortest path retrieval method and device |
-
2017
- 2017-07-10 CN CN201710557911.8A patent/CN107491481B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101030222A (en) * | 2007-03-22 | 2007-09-05 | 华为技术有限公司 | Model searching device and method |
| CN101382934A (en) * | 2007-09-06 | 2009-03-11 | 华为技术有限公司 | Search method for multimedia model, apparatus and system |
| CN101308579A (en) * | 2008-05-12 | 2008-11-19 | 中山大学 | Adaptive simplifying method for three-dimensional animation model |
| CN101458714A (en) * | 2008-12-30 | 2009-06-17 | 清华大学 | Three-dimensional model search method based on precision geodesic |
| CN103268634A (en) * | 2012-02-24 | 2013-08-28 | 苏州蓝海彤翔系统科技有限公司 | Quick parallel self-adaptive simplification method based on vertex clustering for out-of-core model |
| CN103714577A (en) * | 2014-01-23 | 2014-04-09 | 焦点科技股份有限公司 | Three-dimensional model simplification method suitable for model with textures |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107491481A (en) | 2017-12-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114186632B (en) | Method, device, equipment and storage medium for training key point detection model | |
| US11309087B2 (en) | Method for the computation of voronoi diagrams | |
| CN111921202B (en) | Data processing method, device and equipment for virtual scene and readable storage medium | |
| CN111710035B (en) | Face reconstruction method, device, computer equipment and storage medium | |
| KR20220125712A (en) | Image processing method, text recognition method and device | |
| CN115018992B (en) | Method and device for generating hair style model, electronic equipment and storage medium | |
| CN112989482B (en) | BIM model data generation method and device and building method and device | |
| CN115375823B (en) | Three-dimensional virtual clothing generation method, device, equipment and storage medium | |
| CN115330940A (en) | Three-dimensional reconstruction method, device, equipment and medium | |
| CN114792355B (en) | Virtual image generation method and device, electronic equipment and storage medium | |
| CN115222879A (en) | Model surface reduction processing method and device, electronic equipment and storage medium | |
| CN107491481B (en) | LOD model searching method and system, method for establishing LOD model database and computer-readable storage medium | |
| CN113962845B (en) | Image processing method, image processing apparatus, electronic device, and storage medium | |
| CN116188917B (en) | Defect data generation model training method, defect data generation method and device | |
| CN113127697A (en) | Method and system for optimizing graph layout, electronic device and readable storage medium | |
| CN110838167B (en) | Model rendering method, device and storage medium | |
| CN115131192B (en) | Data processing method, device and equipment based on graphic pipeline and storage medium | |
| CN111339973A (en) | Object identification method, device, equipment and storage medium | |
| EP4086853A2 (en) | Method and apparatus for generating object model, electronic device and storage medium | |
| CN116229116A (en) | Process multiplexing processing method and system based on similar parts and electronic equipment | |
| CN114723796A (en) | Three-dimensional point cloud generation method and device and electronic equipment | |
| EP3809314A1 (en) | 3d object detection from calibrated 2d images background | |
| JP2010152863A (en) | System and method for extracting boundary node, and program | |
| CN112991451B (en) | Image recognition method, related device and computer program product | |
| CN112652036B (en) | Road data processing method, device, equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |