Processing method for rapid rendering of three-dimensional graph

By scanning the reservoir data, formatting, coordinate conversion and local centralized processing, the problem of slow three-dimensional rendering of reservoir data is solved, and faster file processing and rendering effects are achieved.

CN119399338AInactive Publication Date: 2025-02-07ZHONGKE HUIZHI (BEIJING) TECH CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202411531556.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-30
Publication Date
2025-02-07
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

When the prior art renders reservoir data in three-dimensionally, the rendering speed is slow due to the variety of file sizes and types, which affects the user experience.

Method used

By scanning and formatting the file data, converting coordinate units into integers, and local centralized processing and occlusion judgments are performed, the rendering processing of grid units is optimized.

Benefits of technology

It significantly improves file processing speed, reduces data volume and format processing time, and improves user data loading speed and rendering effect.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119399338A_ABST
    Figure CN119399338A_ABST
Patent Text Reader

Abstract

The invention discloses a processing method for rapid rendering of a three-dimensional graph, and the method comprises the following steps: S1, carrying out scanning and format regularization processing on file data, then converting vertex information expressed by double precision and single precision into an integer in combination with a coordinate unit, and inputting the integer into a file again for expression; s2, carrying out local centralization processing on the coordinate values expressed in the file, and correcting a previous coordinate relative to a geographic center point into a coordinate relative to a center point of a file plate; s3, judging whether the surface of one grid unit in a certain direction is the same as the node of the unit associated with the corresponding surface, the method belongs to the technical field of file rendering, the converted file can be quickly loaded by a third playback engine, the content of the oil reservoir attribute is smoothly displayed, and a user data loading body is remarkably improved; by adopting the technology used by the invention, the file loading speed of the computer can be accelerated, the occupation of memory resources is reduced, and the file content can be displayed more quickly.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of file rendering, and in particular to a processing method for rapid rendering of three-dimensional graphics. Background Art

[0002] Currently, domestic research institutions and scientific research units widely use the ECLIPSE format to represent reservoir data. However, due to the large file sizes and the diverse file types involved in 3D rendering, rendering speeds are slow, impacting the user experience. Quickly displaying file content on a machine has become a major pain point for users of this format. Current reservoir data files use a corner grid format for spatial storage, characterized by eight vertices per grid cell. The computer then renders the geological representation based on the positions of these cells.

[0003] When using 3D visualization simulation or digital twins, the large amount of reservoir file data (usually several G or tens of G bytes) will cause the loading process to be slow, the user will have a long waiting time, and the experience will be poor. Summary of the Invention

[0004] To this end, the present invention provides a method for quickly rendering three-dimensional graphics to solve the above-mentioned problems in the prior art.

[0005] In order to achieve the above object, the present invention provides the following technical solutions:

[0006] A method for quickly rendering three-dimensional graphics includes the following steps:

[0007] S1: Scan the file data and format it, then convert the double-precision and single-precision vertex information into integers based on the coordinate units, and re-enter the data into the file for expression;

[0008] S2: Perform local centering on the coordinate values ​​expressed in the file, correcting the coordinates relative to the geographic center point to the coordinates relative to the center point of the file's plate;

[0009] S3: Determine whether the face of a grid cell in a certain direction is the same as the node of the cell associated with the corresponding face;

[0010] S4: If they are the same, it indicates that the surface is blocked by the corresponding surface, and the surface is marked as invisible, and the rendering processing of these units is ignored during rendering; otherwise, the surface is marked as visible and the rendering processing is performed.

[0011] Furthermore, the step S2 includes the following steps:

[0012] P1: Scan and process the coordinate information of all cells described in the reservoir file, and calculate the center coordinate point of each cell based on the rectangular space containing the cell;

[0013] P2: Compare the calculated center coordinate points and calculate the maximum and minimum center point positions;

[0014] P3: Calculate the average of the coordinates of the maximum and minimum midline points, and use the result as the center coordinate of the space expressed by the file;

[0015] P4: The coordinate information of the reservoir file is recalibrated, and the reference center node position is calculated and integerized.

[0016] Furthermore, the step S3 includes the following steps:

[0017] Q1: Loop through the six directions of each grid cell to determine whether there are adjacent cells in contact;

[0018] Q2: If there is an adjacent unit in a certain direction, it means that the direction is blocked by the adjacent unit;

[0019] Q3: Scan all cells and mark whether they are visible cells. Do not display invisible cells.

[0020] Q4: After marking, re-record the visible unit coordinate information to the file.

[0021] Furthermore, in Q2, when a unit has adjacent units in six directions, it means that the unit is invisible and not displayed.

[0022] Furthermore, the method further comprises the following steps:

[0023] S5: Hierarchical expression of unit content, rendering according to the layer structure;

[0024] S6: Each expression unit is divided into layers, and the rendering priority of each layer is set;

[0025] S7: The attribute content of each unit also marks the level it belongs to.

[0026] Furthermore, the step S6 includes the following steps:

[0027] N1: Triangulate the data expressed using corner point grids;

[0028] N2: Number and analyze the nodes of the triangulated plane to determine whether there are repeated nodes;

[0029] N3: Eliminate duplicate nodes and record the nodes that need to be rendered into memory;

[0030] N4: Traverse all nodes that need to be rendered. After the traversal is completed, they are displayed on the screen based on the display priority.

[0031] The present invention has the following advantages:

[0032] The files will be compressed significantly, and the data volume and format processing will lead to a rapid increase in processing speed;

[0033] The converted files can be quickly loaded by third-party engines, smoothly displaying reservoir attributes and significantly improving user data loading.

[0034] By adopting the technology used in the present invention, the speed of computer loading files can be accelerated, the occupation of memory resources can be reduced, and the file content can be displayed more quickly. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 This is an overall flow chart of a processing method for rapid rendering of three-dimensional graphics provided by the present invention.

[0036] Figure 2 A coordinate processing flow chart of a method for rapid rendering of three-dimensional graphics provided by the present invention.

[0037] Figure 3 The present invention provides a node rendering traversal flow chart of a method for rapidly rendering three-dimensional graphics. DETAILED DESCRIPTION

[0038] The following describes the implementation of the present invention using specific embodiments. Those skilled in the art will readily understand the other advantages and benefits of the present invention from the disclosure herein. Obviously, the embodiments described are only a portion of the present invention, not all of it. All other embodiments derived by persons of ordinary skill in the art based on the embodiments of the present invention without inventive effort are intended to fall within the scope of protection of the present invention.

[0039] Example 1

[0040] like Figures 1 to 3 As shown, a method for quickly rendering three-dimensional graphics in an embodiment of the first aspect of the present invention includes the following steps:

[0041] S1: Scan the file data and format it, then convert the double-precision and single-precision vertex information into integers based on the coordinate units, and re-enter the data into the file for expression;

[0042] S2: Perform local centering on the coordinate values ​​expressed in the file, correcting the coordinates relative to the geographic center point to the coordinates relative to the center point of the file's plate;

[0043] S3: Determine whether the face of a grid cell in a certain direction is the same as the node of the cell associated with the corresponding face;

[0044] S4: If they are the same, it indicates that the face is blocked by the corresponding face, and the face is marked as invisible, and the rendering of these units is ignored during rendering; otherwise, the face is marked as visible and rendered;

[0045] In the above embodiment, it should be noted that the data range of each grid cell is reduced to reduce the amount of computation. Furthermore, the content currently recorded using reservoir simulation software is typically expressed based on a coordinate system. In practical applications, meters are often used as the unit of measurement, while reservoir data is typically expressed as floating-point decimals. In a three-dimensional geological display, the position after the decimal point has little practical significance relative to the overall data. By converting the data to integers (primarily the coordinates in the latitude and longitude directions), subsequent storage and computational efficiency can be improved.

[0046] Example 2

[0047] like Figures 1 to 3 As shown, a method for quickly rendering three-dimensional graphics includes all the contents of Example 1. In addition, S2 includes the following steps:

[0048] P1: Scan and process the coordinate information of all cells described in the reservoir file, and calculate the center coordinate point of each cell based on the rectangular space containing the cell;

[0049] P2: Compare the calculated center coordinate points and calculate the maximum and minimum center point positions;

[0050] P3: Calculate the average of the coordinates of the maximum and minimum midline points, and use the result as the center coordinate of the space expressed by the file;

[0051] P4: The coordinate information of the reservoir file is recalibrated, and the reference center node position is calculated and integerized;

[0052] The technical effect achieved by the above embodiment is that the data represented by the reservoir file is typically subsurface simulation data. When the data is displayed on a computer screen, the top layer, facing the user, is the first layer to be viewed. Therefore, during the rendering process, the present invention adopts a rendering strategy that renders the parts of greatest interest to the user first, and then renders other details in parallel, sorted by weight values ​​within the analysis structure hierarchy.

[0053] Files are compressed significantly, and the amount of data and formatting result in a rapid increase in processing speed.

[0054] Example 3

[0055] like Figures 1 to 3As shown, a method for quickly rendering three-dimensional graphics includes all the contents of Example 1. In addition, S3 includes the following steps:

[0056] Q1: Loop through the six directions of each grid cell to determine whether there are adjacent cells in contact;

[0057] Q2: If there is an adjacent unit in a certain direction, it means that the direction is blocked by the adjacent unit;

[0058] Q3: Scan all cells and mark whether they are visible cells. Do not display invisible cells.

[0059] Q4: After marking, re-record the visible unit coordinate information to the file;

[0060] In the above embodiment, it should be noted that the overall information of the entire file includes the total number of units, the overall number of levels, level list information, and the unit list structure of each level, including the total number of units in each level and the unit information of the level.

[0061] Example 4

[0062] like Figures 1 to 3 As shown, a processing method for fast rendering of three-dimensional graphics includes all the contents of Example 3. In addition, in Q2, when a unit has adjacent units in six directions, it means that the unit is invisible and not displayed.

[0063] Example 5

[0064] like Figures 1 to 3 As shown, a method for quickly rendering three-dimensional graphics includes all the contents of Example 1, and in addition, S5: hierarchical expression of unit content, rendering according to the layer structure;

[0065] S6: Each expression unit is divided into layers, and the rendering priority of each layer is set;

[0066] S7: The attribute content of each unit also marks the level it belongs to;

[0067] In the above embodiments, it should be noted that the technology used in the present invention can speed up the computer's file loading, reduce the occupation of memory resources, and display file content more quickly.

[0068] Example 6

[0069] like Figures 1 to 3 As shown, a method for quickly rendering three-dimensional graphics includes all the contents of Example 5. In addition, S6 includes the following steps:

[0070] N1: Triangulate the data expressed using corner point grids;

[0071] N2: Number and analyze the nodes of the triangulated plane to determine whether there are repeated nodes;

[0072] N3: Eliminate duplicate nodes and record the nodes that need to be rendered into memory;

[0073] N4: Traverse all nodes that need to be rendered. After the traversal is completed, they are displayed on the screen according to the display priority.

[0074] In the above embodiment, it should be noted that the use of the technology adopted by the present invention will greatly accelerate the machine rendering speed and can provide timely feedback on changes in reservoir data content, which has a positive promotion significance in the application of digital twins;

[0075] The technical effect achieved by the above embodiment is: after loading the exported custom format file, the SDK interface is called to display on the screen using the technology described above, which is mainly used in digital twin projects related to oil fields.

Claims

1. A method for fast rendering of three-dimensional graphics, characterized in that: The steps include: S1: Scan the file data and format it, then convert the vertex information expressed in double precision and single precision into integers in combination with the coordinate units, and re-enter it into the file for expression; S2: Perform local centering processing on the coordinate values ​​expressed in the file, and correct the coordinates relative to the geographic center point to the coordinates relative to the center point of the file plate; S3: Determine whether the face of a grid cell in a certain direction is the same as the node of the cell associated with the corresponding face; S4: If they are the same, it indicates that the surface is blocked by the corresponding surface, and the surface is marked as invisible, and the rendering processing of these units is ignored during rendering; otherwise, the surface is marked as visible and the rendering processing is performed.

2. A method for fast rendering of three-dimensional graphics according to claim 1, characterized in that: The S2 includes the following steps: P1: Scan and process the coordinate information of all cells described in the reservoir file, and calculate the center coordinate point of each cell based on the rectangular space containing the cell; P2: Compare the calculated center coordinate points and calculate the maximum and minimum center point positions; P3: The average calculation is performed based on the coordinates of the maximum and minimum midline points, and the result is used as the center coordinate of the space expressed by the file; P4: The coordinate information of the reservoir file is recalibrated, and the reference center node position is calculated and integerized.

3. The method for fast rendering of three-dimensional graphics according to claim 1, characterized in that: The S3 includes the following steps: Q1: Loop through the six directions of each grid cell to determine whether there are adjacent cells in contact; Q2: If there is an adjacent unit in a certain direction, it means that the direction is blocked by the adjacent unit; Q3: Scan all cells and mark whether they are visible cells. Do not display invisible cells. Q4: After marking, re-record the visible unit coordinate information to the file.

4. A method for fast rendering of three-dimensional graphics according to claim 3, characterized in that: In Q2, when a unit has adjacent units in six directions, it means that the unit is invisible and not displayed.

5. The method for fast rendering of three-dimensional graphics according to claim 1, characterized in that: The following steps are also included: S5: hierarchical expression of unit content, rendering according to the layer structure; S6: Each expression unit is divided into layers, and the rendering priority of each layer is set; S7: The attribute content of each unit also marks the level to which it belongs.

6. A method for fast rendering of three-dimensional graphics according to claim 5, characterized in that: The S6 includes the following steps: N1: Triangulate the data expressed using corner point grids; N2: Number and analyze the nodes of the triangulated plane to determine whether there are repeated nodes; N3: Eliminate duplicate nodes and record the nodes that need to be rendered into memory; N4: Traverse all nodes that need to be rendered. After the traversal is completed, they are displayed on the screen according to the display priority.

Citation Information

Patent Citations

  • Finite volume method system and program storage device for linear elasticity involving coupled stress and flow in a reservoir simulator

    CN101278292A

  • Self-adaptive well pattern optimization method based on gradient algorithm

    CN102930345A

  • Corner point grid-based high-precision oil-gas migration simulation method

    CN106846470A

  • Flow unit numerical simulation method based on multi-scale mixed finite elements

    CN110263434A

  • Real-time segmentation and three-dimensional visualization method for angular point grid geologic model

    CN115908733A