CN117456110A - Three-dimensional scene metamorphosis grid data lightweight processing method - Google Patents
Three-dimensional scene metamorphosis grid data lightweight processing method Download PDFInfo
- Publication number
- CN117456110A CN117456110A CN202311786098.3A CN202311786098A CN117456110A CN 117456110 A CN117456110 A CN 117456110A CN 202311786098 A CN202311786098 A CN 202311786098A CN 117456110 A CN117456110 A CN 117456110A
- Authority
- CN
- China
- Prior art keywords
- triangle
- triangular
- component
- dimensional scene
- metamorphosis
- 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.)
- Granted
Links
- 230000029052 metamorphosis Effects 0.000 title claims abstract description 24
- 238000003672 processing method Methods 0.000 title abstract description 9
- 238000000034 method Methods 0.000 claims abstract description 30
- 238000001514 detection method Methods 0.000 claims abstract description 27
- 230000015556 catabolic process Effects 0.000 claims abstract description 6
- 238000006731 degradation reaction Methods 0.000 claims abstract description 6
- 239000002699 waste material Substances 0.000 claims abstract description 4
- 238000010586 diagram Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 5
- 230000003111 delayed effect Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012952 Resampling Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
-
- 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
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Geometry (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Civil Engineering (AREA)
- Architecture (AREA)
- Software Systems (AREA)
- Computer Graphics (AREA)
- Structural Engineering (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Image Analysis (AREA)
Abstract
The invention discloses a three-dimensional scene metamorphosis grid data lightweight processing method, which comprises the steps of sequentially reading one triangle component in a triangle grid to be processed; acquiring all adjacent triangular components connected with the triangular components through vertexes, and constructing a triangular component set; performing long and narrow triangle and degradation triangle detection on triangle components in the triangle component set, and reading the next triangle component when the long and narrow triangle and the degradation triangle exist; otherwise, adopting an edge collapse geometric reduction algorithm to carry out light weight treatment to generate a light-weighted triangle member set; adding the light triangle component set into a triangle mesh to be processed, and marking all triangle components in the triangle component set as waste; and finally ending the flow when the light weight termination condition is reached. The method can solve the problem that the lightweight result has texture flaws caused by the deformed grid data, and improve the texture quality of the lightweight processing result of the three-dimensional scene.
Description
Technical Field
The invention relates to the technical field of three-dimensional scene light weight, in particular to a three-dimensional scene metamorphosis grid data light weight processing method.
Background
In 3D scene data (e.g., 3DMAX, etc.) output by BIM and 3D design or drawing software, due to the quality of the triangularization algorithm of the 3D model surface, a large number of triangles are output that are elongated and even degenerate into one line segment, which we call metamorphosis mesh data, as shown in fig. 1 (a large slope of a roof is separated into a plurality of elongated or degenerate triangles by a plurality of members of the facade). Such an metamorphic mesh would have a large number of textures, and in a lightweight algorithm, these textured elongated or degenerated triangles would be texture resampled, at which time a portion of the background color corresponding to the texture triangle would be output to the final texture as texture samples, resulting in the lightweight result forming a visible texture background color around the elongated or degenerated triangle, resulting in unacceptable flaws in the lightweight effect, as shown in fig. 2.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a three-dimensional scene metamorphosis grid data lightweight processing method, which is characterized in that a long and narrow triangle or a degraded triangle is detected to be constructed, and lightweight iteration is performed or the lightweight iteration is prevented from participating in the lightweight process, so that the problem that the lightweight result caused by metamorphosis grid data has texture defects is solved.
In order to achieve the aim of the invention, the invention adopts the following technical scheme:
a three-dimensional scene metamorphosis grid data lightweight processing method comprises the following steps:
s1, sequentially reading one triangular member in a triangular mesh to be processed;
s2, acquiring all adjacent triangular components connected with the triangular components through vertexes, and constructing a triangular component set;
s3, detecting long and narrow triangles and degraded triangles of the triangle components in the triangle component set, and returning to the step S1 if the long and narrow triangles and the degraded triangles exist; otherwise, executing the step S4;
s4, carrying out light weight treatment on all triangular components in the triangular component set by adopting an edge collapse geometric simplification algorithm to generate a light-weight triangular component set;
s5, adding the light triangle component set into the triangle mesh to be processed, and marking all triangle components in the triangle component set as waste;
s6, judging whether a light weight termination condition is met; if yes, ending the flow; otherwise, returning to the step S1.
Alternatively, the detecting of elongated and degraded triangles of the triangle members of the set of triangle members in step S3 comprises the steps of:
s31, determining the half perimeter of the triangular member according to the three side lengths of the triangular member;
s32, determining the square value of the area of the triangular member according to the three side lengths of the triangular member;
s33, determining the radius of an inscribed circle of the triangular member according to the half perimeter and the square area value of the triangular member;
s34, determining the radius of the circumscribed circle of the triangular member according to the three side lengths and the area square value of the triangular member;
s35, determining long and narrow triangle and degradation triangle detection indexes according to the inscribed circle radius and the circumscribed circle radius of the triangle component;
s36, detecting whether the triangular member is an elongated and degenerated triangle according to the elongated and degenerated triangle detection index.
Alternatively, the determination of the half perimeter of the triangular member according to the three side lengths of the triangular member in step S31 is specifically:
，
wherein,pis a half perimeter of the triangular member,a、b、cthree sides of the triangular component.
Alternatively, the area square value of the triangular member determined according to the three side lengths of the triangular member in step S32 is specifically:
，
wherein,sis the square value of the area of the triangular member,pis a half perimeter of the triangular member,a、b、cthree sides of the triangular component.
Alternatively, the determining the radius of the inscribed circle of the triangular member according to the half perimeter and the square area value of the triangular member in step S33 is specifically:
，
wherein,ris the radius of the inscribed circle of the triangular component,sis the square value of the area of the triangular member,pis half the perimeter of the triangular member.
Alternatively, the determining the radius of the circumcircle of the triangular member according to the three side lengths and the square value of the area in the step S34 is specifically:
，
wherein,Ris the radius of the circumscribed circle of the triangular component,sis the square value of the area of the triangular member,a、b、cthree sides of the triangular component.
Alternatively, the determining the long and narrow triangle and the degraded triangle detection index according to the inscribed circle radius and the circumscribed circle radius of the triangle member in step S35 is specifically:
，
wherein,triqis an index of detection of long and narrow and degraded triangles,ris the radius of the inscribed circle of the triangular component,Ris the radius of the circumscribed circle of the triangular component.
Alternatively, the detecting whether the triangle member is an elongated and degraded triangle based on the elongated and degraded triangle detection index in step S36 is specifically:
judging whether the detection indexes of the long and narrow and degraded triangles are smaller than a detection threshold value or not; if so, the triangular member is an elongated and degenerate triangle; otherwise the triangular member is not an elongated and degenerate triangle.
Alternatively, the detection threshold is set to 0.001.
Optionally, step S4 further includes:
and generating textures by adopting a texture remapping mode for all triangle components in the triangle component set after light weight, so as to obtain a new low-resolution texture set.
The invention has the following beneficial effects:
according to the invention, whether a long and narrow triangle or a degraded triangle exists is detected aiming at a triangle connected with a certain triangle and a vertex thereof in the light-weight process of three-dimensional scene data, so that the light-weight process of an abnormal grid is delayed or is directly kept unchanged, and the abnormal grid is delayed to a higher LOD level, thereby solving the problem that the light-weight result is textured and blemished due to the abnormal grid data, and improving the texture quality of the light-weight processing result of the three-dimensional scene.
Drawings
FIG. 1 is a diagram of metamorphosis grid data;
FIG. 2 is a schematic diagram of texture flaws in the lightweight results caused by metamorphosis of the grid data;
fig. 3 is a flow chart of a three-dimensional scene metamorphosis grid data lightweight processing method.
Detailed Description
The following description of the embodiments of the present invention is provided to facilitate understanding of the present invention by those skilled in the art, but it should be understood that the present invention is not limited to the scope of the embodiments, and all the inventions which make use of the inventive concept are protected by the spirit and scope of the present invention as defined and defined in the appended claims to those skilled in the art.
The technical route adopted by the invention is as follows: detecting a triangle member connected with a certain triangle member and a vertex thereof in the light weight process of BIM or 3D scene data, if an elongated or degenerated triangle is found, deferring the light weight process of participation of the triangle member until the triangle member connected with the triangle member and the vertex thereof changes in the light weight process to be in a form similar to an equilateral triangle, and allowing the triangle member connected with the triangle member and the vertex thereof to participate in the light weight process of the three-dimensional scene. Of course, the triangle member and the triangle member connected with the vertex thereof may not always be in a form similar to an equilateral triangle, and then the next round of light weight process is performed to perform an algorithm comprising simultaneous resampling of geometry and texture, the light weight result is output to a higher level LOD, and scheduling is performed when the distance is longer.
As shown in fig. 1, the embodiment of the invention provides a three-dimensional scene metamorphosis grid data lightweight processing method, which comprises the following steps S1 to S6:
s1, sequentially reading one triangular member in a triangular mesh to be processed;
in an optional embodiment of the present invention, according to the present embodiment, for a triangle mesh to be processed, a certain triangle member is sequentially traversed and read, and a subsequent lightweight iteration process is performed by using each triangle member as an iteration object.
S2, acquiring all adjacent triangular components connected with the triangular components through vertexes, and constructing a triangular component set;
in an alternative embodiment of the present invention, according to each vertex of the triangle member read in step S1, all the adjacent triangle members connected to each vertex are obtained; and constructing a triangle member set from the read triangle members and all neighboring triangle members.
S3, detecting long and narrow triangles and degraded triangles of the triangle components in the triangle component set, and returning to the step S1 if the long and narrow triangles and the degraded triangles exist; otherwise, executing the step S4;
in an alternative embodiment of the present invention, the present embodiment performs an elongated and degraded triangle detection on triangle members in a triangle member set, including the following steps S31 to S36:
s31, determining the half perimeter of the triangular member according to the three side lengths of the triangular member; the method comprises the following steps:
，
wherein,pis a half perimeter of the triangular member,a、b、cthree sides of the triangular component.
S32, determining the square value of the area of the triangular member according to the three side lengths of the triangular member; the method comprises the following steps:
，
wherein,sis the square value of the area of the triangular member,pis a half perimeter of the triangular member,a、b、cthree sides of the triangular component.
S33, determining the radius of an inscribed circle of the triangular member according to the half perimeter and the square area value of the triangular member; the method comprises the following steps:
，
wherein,ris the radius of the inscribed circle of the triangular component,sis the square value of the area of the triangular member,pis half the perimeter of the triangular member.
S34, determining the radius of the circumscribed circle of the triangular member according to the three side lengths and the area square value of the triangular member; the method comprises the following steps:
，
wherein,Ris the radius of the circumscribed circle of the triangular component,sis the square value of the area of the triangular member,a、b、cthree sides of the triangular component.
S35, determining long and narrow triangle and degradation triangle detection indexes according to the inscribed circle radius and the circumscribed circle radius of the triangle component; the method comprises the following steps:
，
wherein,triqis an index of detection of long and narrow and degraded triangles,ris the radius of the inscribed circle of the triangular component,Ris the radius of the circumscribed circle of the triangular component.triqThe value interval of (1) is [0,1 ]]I.e., when the triangle is an equilateral triangle,triq=1, and when the triangle degenerates into a line segment,triq=0, and when the triangle is an isosceles right triangle,triq≈0.82, just in interval [0,1 ]]Inside.
S36, detecting whether the triangular member is an elongated and degenerated triangle according to the elongated and degenerated triangle detection index, specifically:
judging whether the detection indexes of the long and narrow and degraded triangles are smaller than a detection threshold value or not; if so, the triangular member is an elongated and degenerate triangle; otherwise the triangular member is not an elongated and degenerate triangle.
The present embodiment detects the proximity of the triangular member to the equilateral triangle geometry by the elongated and degenerate triangle detection indicators. In the embodiment, the detection threshold is set to be 0.001, and the triangular component smaller than the detection threshold is unacceptably long and narrow or degenerated, so that the normal form of the triangular component can be better distinguished from the long and narrow and degenerated form, and the detection accuracy of the long and narrow and degenerated triangle is improved.
S4, carrying out light weight treatment on all triangular components in the triangular component set by adopting an edge collapse geometric simplification algorithm to generate a light-weight triangular component set;
in an alternative embodiment of the present invention, step S4 of the present embodiment further includes:
and generating textures for all triangle components in the lightweight triangle component set in a texture remapping mode to obtain a new low-resolution texture set, thereby completing the LOD production flow of the three-dimensional scene.
S5, adding the light triangle component set into the triangle mesh to be processed, and marking all triangle components in the triangle component set as waste;
s6, judging whether a light weight termination condition is met; if yes, ending the flow; otherwise, returning to the step S1.
According to the three-dimensional scene metamorphosis grid data lightweight processing method, the lightweight process of metamorphosis grids is delayed or directly kept unchanged, and the lightweight process is delayed to a higher LOD level, so that the problem that the lightweight result has texture flaws due to metamorphosis grid data is solved.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The principles and embodiments of the present invention have been described in detail with reference to specific examples, which are provided to facilitate understanding of the method and core ideas of the present invention; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present invention, the present description should not be construed as limiting the present invention in view of the above.
Those of ordinary skill in the art will recognize that the embodiments described herein are for the purpose of aiding the reader in understanding the principles of the present invention and should be understood that the scope of the invention is not limited to such specific statements and embodiments. Those of ordinary skill in the art can make various other specific modifications and combinations from the teachings of the present disclosure without departing from the spirit thereof, and such modifications and combinations remain within the scope of the present disclosure.
Claims (10)
1. The method for processing the deformed grid data of the three-dimensional scene in a light-weight manner is characterized by comprising the following steps of:
s1, sequentially reading one triangular member in a triangular mesh to be processed;
s2, acquiring all adjacent triangular components connected with the triangular components through vertexes, and constructing a triangular component set;
s3, detecting long and narrow triangles and degraded triangles of the triangle components in the triangle component set, and returning to the step S1 if the long and narrow triangles and the degraded triangles exist; otherwise, executing the step S4;
s4, carrying out light weight treatment on all triangular components in the triangular component set by adopting an edge collapse geometric simplification algorithm to generate a light-weight triangular component set;
s5, adding the light triangle component set into the triangle mesh to be processed, and marking all triangle components in the triangle component set as waste;
s6, judging whether a light weight termination condition is met; if yes, ending the flow; otherwise, returning to the step S1.
2. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 1, characterized in that the step S3 of detecting elongated and degraded triangles of triangle members in the triangle member set comprises the following steps:
s31, determining the half perimeter of the triangular member according to the three side lengths of the triangular member;
s32, determining the square value of the area of the triangular member according to the three side lengths of the triangular member;
s33, determining the radius of an inscribed circle of the triangular member according to the half perimeter and the square area value of the triangular member;
s34, determining the radius of the circumscribed circle of the triangular member according to the three side lengths and the area square value of the triangular member;
s35, determining long and narrow triangle and degradation triangle detection indexes according to the inscribed circle radius and the circumscribed circle radius of the triangle component;
s36, detecting whether the triangular member is an elongated and degenerated triangle according to the elongated and degenerated triangle detection index.
3. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 2, wherein in step S31, the determination of the half perimeter of the triangle member according to the three side lengths of the triangle member is specifically:
，
wherein,pis a half perimeter of the triangular member,a、b、cthree sides of the triangular component.
4. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 2, wherein in step S32, the area square value of the triangle member determined according to the three side lengths of the triangle member is specifically:
，
wherein,sis the square value of the area of the triangular member,pis a half perimeter of the triangular member,a、b、cthree sides of the triangular component.
5. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 2, wherein in step S33, the inscribed circle radius of the triangle member is determined according to the half perimeter and the square area value of the triangle member specifically:
，
wherein,ris the radius of the inscribed circle of the triangular component,sis the square value of the area of the triangular member,pis half the perimeter of the triangular member.
6. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 2, wherein in step S34, the radius of the circumscribed circle of the triangle member is determined according to the three side lengths and the square value of the area:
，
wherein,Ris the radius of the circumscribed circle of the triangular component,sis the square value of the area of the triangular member,a、b、cthree sides of the triangular component.
7. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 2, wherein in step S35, the determination of the long and narrow triangle and degradation triangle detection index according to the inscribed circle radius and the circumscribed circle radius of the triangle member is specifically:
，
wherein,triqis an index of detection of long and narrow and degraded triangles,ris the radius of the inscribed circle of the triangular component,Ris the radius of the circumscribed circle of the triangular component.
8. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 2, wherein in step S36, detecting whether the triangle member is an elongated and degraded triangle according to the elongated and degraded triangle detection index is specifically:
judging whether the detection indexes of the long and narrow and degraded triangles are smaller than a detection threshold value or not; if so, the triangular member is an elongated and degenerate triangle; otherwise the triangular member is not an elongated and degenerate triangle.
9. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 8, characterized in that the detection threshold is set to 0.001.
10. The method for lightweight processing of three-dimensional scene metamorphosis grid data according to claim 1, wherein step S4 further comprises:
and generating textures by adopting a texture remapping mode for all triangle components in the triangle component set after light weight, so as to obtain a new low-resolution texture set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311786098.3A CN117456110B (en) | 2023-12-25 | 2023-12-25 | Three-dimensional scene metamorphosis grid data lightweight processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311786098.3A CN117456110B (en) | 2023-12-25 | 2023-12-25 | Three-dimensional scene metamorphosis grid data lightweight processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117456110A true CN117456110A (en) | 2024-01-26 |
| CN117456110B CN117456110B (en) | 2024-03-19 |
Family
ID=89584085
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311786098.3A Active CN117456110B (en) | 2023-12-25 | 2023-12-25 | Three-dimensional scene metamorphosis grid data lightweight processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117456110B (en) |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050013287A (en) * | 2003-07-28 | 2005-02-04 | 학교법인연세대학교 | method for filtering of triangle strip in rendering system of view-dependency Level Of Detail based |
| JP2011086024A (en) * | 2009-10-14 | 2011-04-28 | Phifit Kk | Forming simulation system using numerical pattern, and recording medium |
| US20170186136A1 (en) * | 2015-12-28 | 2017-06-29 | Volkswagen Ag | System and methodologies for super sampling to enhance anti-aliasing in high resolution meshes |
| CN109872394A (en) * | 2019-01-10 | 2019-06-11 | 重庆大学 | Long-narrow triangular mesh grid optimization method based on least square method supporting vector machine |
| CN111161420A (en) * | 2019-12-30 | 2020-05-15 | 山东山大华天软件有限公司 | 3D printing-oriented rapid repairing method for shoemaking model |
| CN113989458A (en) * | 2021-11-03 | 2022-01-28 | 北京国网富达科技发展有限责任公司 | Power grid three-dimensional scene data rendering method and system |
| CN114417951A (en) * | 2021-11-26 | 2022-04-29 | 中国石油大学(华东) | Unsupervised machine learning-based automatic subdivision optimization method for ocean unstructured grid |
| CN114677473A (en) * | 2022-02-25 | 2022-06-28 | 河南中原动力智能制造有限公司 | Method, device and equipment for reconstructing three-dimensional model and storage medium |
| US20220414986A1 (en) * | 2021-06-23 | 2022-12-29 | Adobe Inc. | Segmenting three-dimensional meshes in graphical applications based on detection of elongated shapes |
| CN116051708A (en) * | 2023-01-30 | 2023-05-02 | 四川视慧智图空间信息技术有限公司 | Three-dimensional scene lightweight model rendering method, equipment, device and storage medium |
| CN116051759A (en) * | 2022-12-09 | 2023-05-02 | 广西壮族自治区自然资源遥感院 | Method for generating oblique photography LOD simplified model |
| CN116186819A (en) * | 2022-08-20 | 2023-05-30 | 苏州智在云数据科技有限公司 | BIM model lightweight processing method, device, equipment and storage medium |
| WO2023124842A1 (en) * | 2021-12-27 | 2023-07-06 | 奥格科技股份有限公司 | Lod-based bim model lightweight construction and display method |
| CN117173370A (en) * | 2023-11-03 | 2023-12-05 | 北京飞渡科技股份有限公司 | Method for maintaining object boundary in light weight process |
-
2023
- 2023-12-25 CN CN202311786098.3A patent/CN117456110B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050013287A (en) * | 2003-07-28 | 2005-02-04 | 학교법인연세대학교 | method for filtering of triangle strip in rendering system of view-dependency Level Of Detail based |
| JP2011086024A (en) * | 2009-10-14 | 2011-04-28 | Phifit Kk | Forming simulation system using numerical pattern, and recording medium |
| US20170186136A1 (en) * | 2015-12-28 | 2017-06-29 | Volkswagen Ag | System and methodologies for super sampling to enhance anti-aliasing in high resolution meshes |
| CN109872394A (en) * | 2019-01-10 | 2019-06-11 | 重庆大学 | Long-narrow triangular mesh grid optimization method based on least square method supporting vector machine |
| CN111161420A (en) * | 2019-12-30 | 2020-05-15 | 山东山大华天软件有限公司 | 3D printing-oriented rapid repairing method for shoemaking model |
| US20220414986A1 (en) * | 2021-06-23 | 2022-12-29 | Adobe Inc. | Segmenting three-dimensional meshes in graphical applications based on detection of elongated shapes |
| CN113989458A (en) * | 2021-11-03 | 2022-01-28 | 北京国网富达科技发展有限责任公司 | Power grid three-dimensional scene data rendering method and system |
| CN114417951A (en) * | 2021-11-26 | 2022-04-29 | 中国石油大学(华东) | Unsupervised machine learning-based automatic subdivision optimization method for ocean unstructured grid |
| WO2023124842A1 (en) * | 2021-12-27 | 2023-07-06 | 奥格科技股份有限公司 | Lod-based bim model lightweight construction and display method |
| CN114677473A (en) * | 2022-02-25 | 2022-06-28 | 河南中原动力智能制造有限公司 | Method, device and equipment for reconstructing three-dimensional model and storage medium |
| CN116186819A (en) * | 2022-08-20 | 2023-05-30 | 苏州智在云数据科技有限公司 | BIM model lightweight processing method, device, equipment and storage medium |
| CN116051759A (en) * | 2022-12-09 | 2023-05-02 | 广西壮族自治区自然资源遥感院 | Method for generating oblique photography LOD simplified model |
| CN116051708A (en) * | 2023-01-30 | 2023-05-02 | 四川视慧智图空间信息技术有限公司 | Three-dimensional scene lightweight model rendering method, equipment, device and storage medium |
| CN117173370A (en) * | 2023-11-03 | 2023-12-05 | 北京飞渡科技股份有限公司 | Method for maintaining object boundary in light weight process |
Non-Patent Citations (7)
| Title |
|---|
| 刘晓成;崔汉国;张星;王大宇;: "虚拟环境中多细节层次模型生成新算法", 微计算机信息, no. 09, 30 March 2006 (2006-03-30), pages 229 - 230 * |
| 操锋;张海兵;段高博;: "BIM模型轻量化问题研究", 中国管理信息化, no. 02, 15 January 2020 (2020-01-15), pages 81 - 82 * |
| 曾芬芳, 周琴, 姚煜: "基于边折叠的网格简化算法及其应用", 计算机应用, no. 01, 28 January 2002 (2002-01-28), pages 7 - 8 * |
| 滕书娟;: "一种保持视觉特征的LOD模型简化算法", 计算机工程与应用, no. 33, 21 November 2010 (2010-11-21), pages 164 - 168 * |
| 王群, 李爱平, 马淑梅: "局部网格狭长三角形的品质改善及实现", 同济大学学报(自然科学版), no. 11, 30 November 2004 (2004-11-30), pages 1508 - 1511 * |
| 胡海鹤;陈家新;: "基于三角形形态变化的网格模型简化算法", 系统仿真学报, no. 19, 5 October 2007 (2007-10-05), pages 4587 - 4590 * |
| 郭思怡;陈永锋;: "建筑运维阶段信息模型的轻量化方法", 图学学报, no. 01, 15 February 2018 (2018-02-15), pages 125 - 130 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117456110B (en) | 2024-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11410372B2 (en) | Artificial intelligence based virtual object aging | |
| CN109978901B (en) | Quick and accurate circular detection and circle center positioning method | |
| CN107767453B (en) | Building LIDAR point cloud reconstruction optimization method based on rule constraint | |
| CN107578472B (en) | Angle optimization method and device of three-dimensional surface triangular network model | |
| US10713844B2 (en) | Rendering based generation of occlusion culling models | |
| CN107025687B (en) | A kind of view-based access control model relies on the historical relic line chart method for drafting of Curvature Estimate | |
| CN103729846B (en) | LiDAR point cloud data edge detection method based on triangular irregular network | |
| CN110910308B (en) | Image processing method, device, equipment and medium | |
| CN110084894B (en) | Local amplification display method and device of three-dimensional model and electronic equipment | |
| CN113776452B (en) | Roundness measuring method and device for cylindrical barrel | |
| CN114998108B (en) | Vector data optimization processing method and system | |
| CN117173370B (en) | Method for maintaining object boundary in light weight process | |
| CN111508054B (en) | Terrain construction method, device and equipment | |
| CN109671154A (en) | The curved surface non-iterative gridding method again that triangle gridding indicates | |
| CN117456110B (en) | Three-dimensional scene metamorphosis grid data lightweight processing method | |
| CN115317916A (en) | Method and device for detecting overlapped objects in virtual scene and electronic equipment | |
| CN117011175A (en) | Mine three-dimensional model point cloud data combined filtering method and medium | |
| CN115758496A (en) | Viewpoint planning method and system for three-dimensional measurement of blade | |
| CN115937690A (en) | Slot line generation method and device, storage medium and terminal | |
| CN115187720A (en) | Method for optimizing terrain rendering based on digital terrain analysis | |
| CN110706351B (en) | Triangular mesh model generation method and device | |
| CN112907759B (en) | Splicing redundant point cloud removing method based on point cloud projection and point cloud growth | |
| CN111814679A (en) | FPGA-based realization algorithm for voxel-encoder and VFE of voxel 3D network | |
| CN111222504A (en) | Bullet hole target scoring method, device, equipment and medium | |
| CN107481314B (en) | Shadow volume optimization method based on KD tree |
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 |