CN116051786B - Quick display method for standard grid three-dimensional model - Google Patents
Quick display method for standard grid three-dimensional model Download PDFInfo
- Publication number
- CN116051786B CN116051786B CN202310317368.XA CN202310317368A CN116051786B CN 116051786 B CN116051786 B CN 116051786B CN 202310317368 A CN202310317368 A CN 202310317368A CN 116051786 B CN116051786 B CN 116051786B
- Authority
- CN
- China
- Prior art keywords
- grid
- grids
- coordinates
- dimensional
- max
- 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
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/005—General purpose rendering architectures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/10—Geometric effects
- G06T15/40—Hidden part removal
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Graphics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- Image Generation (AREA)
Abstract
The invention relates to a standard grid three-dimensional model quick display method, which comprises the following steps: standard grid data are obtained; applying for a one-dimensional list of sufficient size; mapping all grids in the grid data with the established one-dimensional list subscript; setting a circulation condition; sequentially calculating indexes of the one-dimensional lists corresponding to each grid according to the circulation conditions, and obtaining attribute values of the grids through mapping; judging whether the attribute value of the current grid is valid or not; acquiring one-dimensional list indexes corresponding to adjacent grids connected with six faces of the current grid; judging whether effective values exist in grids adjacent to the six faces or not respectively; constructing a triangular net on the surface of the grid in the direction; creating indexes for the created 4 points; coloring the grid through a normal vector mapping relation; and rendering the constructed grid result. The invention can quickly construct the standard grid surface triangular net, and greatly improves the display efficiency of the grid model.
Description
Technical Field
The invention relates to a three-dimensional model modeling method, in particular to a standard grid three-dimensional model quick display method.
Background
Nuclear emergency aviation monitoring is an important technical means which is not replaced by nuclear accident emergency monitoring. In the face of multi-source heterogeneous and massive complex environment data in nuclear accident emergency rescue, a three-dimensional visual platform is constructed, the visual and visual display of the nuclear emergency rescue rapid aviation monitoring data is realized, and the method has important significance in improving the nuclear emergency aviation monitoring capability. And realizing the efficient reconstruction, rapid loading and real-time display of the three-dimensional object model is a key technology for realizing a three-dimensional visualization platform.
In three-dimensional model reconstruction, the two most common formats used to represent three-dimensional models are mesh and point clouds. The model expressed by the grid is called as a three-dimensional grid model, and the model is more convenient for three-dimensional rendering, augmented reality space sensing, three-dimensional shielding collision calculation and model storage. With the increase of the complexity of the visualized objects and the increase of the precision requirements, the data volume of the three-dimensional model is greatly increased, and the large-area grid processing is a great challenge for the visualization of the model and the running memory of a computer. Therefore, the optimization, face reduction, layering and other processes of the grid are important for the display and storage of the three-dimensional grid model.
At present, many experts and scholars have made many researches on the aspects of three-dimensional model construction and visualization, such as Sun Xiaopeng and the like, realizing the construction of a three-dimensional scene based on Cesium, guo Jianxiong and the like, researching the simplification and visualization of a Web three-dimensional complex model, le Shihua and the like, and realizing the scene simulation of a power station based on Cesium. However, many existing methods still have the problems of low three-dimensional model display efficiency, large memory occupation and the like.
Disclosure of Invention
The invention aims to provide a standard grid three-dimensional model quick display method, which aims to solve the problems of low display efficiency and large memory occupation of the existing three-dimensional grid model.
The invention is realized in the following way: a standard grid three-dimensional model quick display method comprises the following steps.
a. Standard grid data is acquired.
b. A one-dimensional list is applied.
c. Mapping the coordinates IJK of all grids in the grid data with the established one-dimensional list subscript, and recording the attribute value of the grid at the corresponding position in the one-dimensional list.
d. The cycle conditions were set so that the coordinates IJK of the grid were tripled and the cycle range of I, J, K was from 0 to its span.
e. And sequentially calculating indexes of the one-dimensional list corresponding to each grid according to the circulation condition, and obtaining the attribute value of the grid through mapping.
f. Judging whether the attribute value of the current grid is valid, if so, performing the next operation, and if not, skipping the grid.
g. And acquiring a one-dimensional list index corresponding to the adjacent grid connected with the six-directional faces of the current grid.
h. And respectively judging whether the grids adjacent to the surfaces in six directions have effective values, if the grids adjacent to the surfaces in a certain direction have effective values, skipping the direction, and if the grids adjacent to the surfaces in a certain direction have no effective values, performing the next step.
i. Coordinates, attribute values, and normal vector values of 4 points are created on the face of the grid in the direction, and a triangle network is composed of the 4 points.
j. An index is created for the 4 points created.
k. The mesh is colored by a normal vector mapping relationship.
And I, rendering the constructed grid result.
In step b, the size of the one-dimensional list space is not smaller than (I max -I min +1）×（J max -J min +1）×（K max -K min +1）。
In step d, I, J, K has a cycle range of I: [0,I ] max -I min ]，J：[0，J max -J min ]，K：[0，K max -K min ]。
In step h, it is first determined whether the coordinates I, J, K of the grid are smaller than 0 or larger than their own span after adding and subtracting 1, respectively, and then it is determined whether there is an attribute value at a position in the corresponding one-dimensional list.
In step i, one coordinate value in the grid coordinate I, J, K is added by 0.5 or subtracted by 0.5 to obtain a plane in the direction, and the other two coordinate values are respectively ±0.5 on the plane to obtain 4 points.
In step i, the normal vector values of the six faces are represented by enumeration type values, wherein the normal vector values are 0,1,2,3,4 and 5.
In step j, the index of 4 points on the first surface is 0,1,2,0,2,3, and each time 4 points on one surface are newly created, 4 is added to the index of 4 points on the previous surface.
In step k, the normal vector mapping relationship is: the colors rgb values 0, 128, 255 correspond to-1, 0,1 of the normal vector, respectively.
According to the invention, the standard grid surface triangular net can be quickly constructed, the grid surface to be displayed is quickly and accurately found by dimension reduction of the grid data IJK, the triangular net is constructed by utilizing the spatial position relation, whether a certain surface of a certain grid can be seen or not is judged, if so, the net construction operation is executed, otherwise, the operation is directly skipped, so that the triangular net which cannot be seen in the grid model is removed, and the display efficiency of the grid model is greatly improved.
Meanwhile, in the implementation process of the method, a special normal vector storage mode is adopted, enumeration type values are adopted to represent the normal vectors of six faces, and the normal vectors are corresponding to colors, so that the memory space is greatly saved.
Drawings
Fig. 1 is a flow chart of the present invention.
FIG. 2 is an exemplary diagram of the present invention after rendering of a three-dimensional model.
Detailed Description
As shown in FIG. 1, the invention relates to a standard grid three-dimensional model quick display method, which comprises the steps of grid data preparation, grid model construction, grid coloring, data display and the like. The specific steps are as follows.
a. And determining the origin coordinates, the grid size, the coordinates IJK of each grid and the attribute value of each grid of the grid data to be processed, thereby obtaining standard grid data.
b. The data structure used for transmitting the grid data is determined so as to reduce the data volume as much as possible on the premise of ensuring the data integrity. The data format adopted by the invention is that a large three-dimensional array is constructed from the minimum value to the maximum value of I, J, K, the corresponding attribute value of each position is stored, the data is represented by 0, and then the three-dimensional array is unfolded into a one-dimensional list.
So in a specific operation a one-dimensional list of sufficient size is applied. The size of the one-dimensional list space is not smaller than (I) max -I min +1）×（J max -J min +1）×（K max -K min +1）。
Such as 4 points (1, 0), (2, 3), (1, 2, 3), (4, 5, 1). It is known that if I has a minimum value of 1, a maximum value of 4,J has a minimum value of 1, a maximum value of 5,K has a minimum value of 0, and a maximum value of 3, a matrix of (4-1+1) × (5-1+1) × (3-0+1) is created in which 80 values can be stored, and the space size of the one-dimensional list obtained after expansion is 80, where only four positions have values. And can pass through: and (I-1) multiplied by 5 multiplied by 4+ (J-1) multiplied by 4+ (K-0) calculating to obtain the corresponding position of each point in the one-dimensional array.
c. Mapping the coordinates IJK of all grids in the grid data with the established one-dimensional list subscript, and recording the attribute value of the grid at the corresponding position in the one-dimensional list.
The process of calculating the corresponding position of each point in the one-dimensional array through (I-1) multiplied by 5 multiplied by 4+ (J-1) multiplied by 4+ (K-0) is the process of mapping the grid coordinate IJK and the one-dimensional list subscript, and after determining the position of each grid coordinate in the one-dimensional list, the attribute value of the grid is recorded at the corresponding position of the one-dimensional list.
d. And setting a circulation condition to enable the coordinates IJK of the grids to be in triple circulation, wherein the circulation range of I, J, K is from 0 to the span of the grids, so that all grids can be ensured to be traversed.
Specifically, the cycle range of I, J, K is I: [0,I ] max -I min ]，J：[0，J max -J min ]，K：[0，K max -K min ]。
e. And sequentially calculating indexes of the one-dimensional list corresponding to each grid according to the circulation condition, and obtaining the attribute value of the grid through mapping.
The mapping in this step is the same as in step c.
f. Judging whether the attribute value of the current grid is valid, if so, performing the next operation, and if not, skipping the grid.
And if the valid value exists, the existence of the grid is indicated, the position of the grid is judged later, and if the valid value does not exist, the existence of the grid is indicated, and the follow-up operation is not needed.
If one grid exists, judging the position of the grid, judging whether the adjacent grid exists or not, if the adjacent grid exists in a certain direction, indicating that the grid is not a surface grid of the three-dimensional model in the certain direction, and if the adjacent grid does not exist in the certain direction, the grid is a surface grid of the three-dimensional model, and the grid needs to be displayed in the certain direction.
g. And acquiring a one-dimensional list index corresponding to the adjacent grid connected with the six-directional faces of the current grid.
The coordinates of adjacent grids connected with the six-direction faces of the current grid are obtained by respectively +/-1 of the coordinates IJK of the current grid, and then the corresponding one-dimensional list index is obtained through calculation in the mode.
h. And respectively judging whether the grids adjacent to the surfaces in six directions have effective values, if the grids adjacent to the surfaces in a certain direction have effective values, skipping the direction, and if the grids adjacent to the surfaces in a certain direction have no effective values, performing the next step.
It is first determined whether the coordinates I, J, K of the grid are smaller than 0 or larger than their own span after adding and subtracting 1, respectively, and then whether there is an attribute value at a position in the corresponding one-dimensional list.
After adding 1 or subtracting 1 to one of the grid coordinates IJK, obtaining grids adjacent to the direction, if the range is exceeded (less than 0 or greater than the span of the grid coordinates IJK), indicating that the adjacent grids do not exist, wherein the current grid is a surface grid of the three-dimensional model in the direction; or even if the range is not exceeded, the corresponding position of the adjacent grid in the one-dimensional list does not have an attribute value (the corresponding position of the one-dimensional list stores a value of 0), and the adjacent grid does not exist, so that the current grid is a surface grid of the three-dimensional model in the direction.
i. Coordinates, attribute values, and normal vector values of 4 points are created on the face of the grid in the direction, and a triangle network is composed of the 4 points.
After determining that the current grid is a surface grid in the direction, the surface of the direction needs to be displayed, so that a triangular mesh is constructed on the surface of the direction, specifically, one coordinate value in grid coordinates I, J, K is added with 0.5 or subtracted with 0.5 to obtain the surface of the direction, and the other two coordinate values are respectively +/-0.5 to obtain 4 points on the surface. The 4 points form two triangular meshes.
For example, when the grid obtained after the K of the grid coordinate IJK is increased by 1 has no effective value, the +k direction surface of the grid is the surface to be displayed, k+0.5 is the surface, two triangular meshes are constructed on the surface, and the first point of the four newly-built points is: i+0.5, J+0.5, K+0.5; the second point is: i-0.5, J+0.5, K+0.5; the third point is: i-0.5, J-0.5, K+0.5; the fourth point is: i+0.5, J-0.5, K+0.5.
The newly created attribute values of the 4 points are the attribute values in the one-dimensional list corresponding to the current grid coordinates. The normal vectors are stored in an index mode, the enumeration type value represents the normal vectors of six faces, indexes 0,1,2,3,4 and 5 respectively correspond to the normal vectors of six faces, for example, index 0 corresponds to normal vectors 0,0 and 1, index 1 corresponds to normal vectors 0,1 and 0 and the like. This only requires the labels 0,1,2,3,4,5 to be able to be processed into normal vectors on a specific surface at rendering time.
j. An index is created for the 4 points created.
The 4 points on each face require 6 indexes corresponding thereto. The index of 4 points on the first surface is 0,1,2,0,2,3, and every time 4 points on one surface are newly created, 4 points on the previous surface are added on the index of 4 points. The index of the 4 points on the second surface is 0+4×1,1+4×1,2+4×1,0+4×1,2+4×1,3+4×1. The index of 4 points on the third surface is 0+4×2,1+4×2,2+4×2,0+4×2,2+4×2,3+4×2.
k. The mesh is colored by a normal vector mapping relationship.
The normal vector mapping relation is as follows: the colors rgb values 0, 128, 255 correspond to-1, 0,1 of the normal vector, respectively. If a face normal vector is 0,1, the color rgb values are 128, 128, 255.
After the mapping relation between the normal vector and the color is established, the normal vector of the surface can be obtained by calculating the color rgb value in the color, and the color range of the color in the color is 0-1, so that the color rgb values are normalized, the color rgb values are 0, 128 and 255, 0,0.5,1.0 are respectively normalized, and the normal vector is obtained by 2 Xrgb-1 after the color rgb is obtained by subscript in the color. If a plane normal vector is 0,1, the color rgb value is 128, 128, 255, and in the shader, we get the color by index 0, the value is 0.5,1.0, and the normal vector 0,1 is obtained by 2× (0.5, 1.0) -1.0.
And I, rendering the constructed grid result.
The result may be rendered using a Cesium front end or the like, resulting in an effect diagram, as shown in FIG. 2.
According to the invention, the standard grid surface triangular net can be quickly constructed, the grid surface to be displayed is quickly and accurately found by dimension reduction of the grid data IJK, the triangular net is constructed by utilizing the spatial position relation, whether a certain surface of a certain grid can be seen or not is judged, if so, the net construction operation is executed, otherwise, the operation is directly skipped, so that the triangular net which cannot be seen in the grid model is removed, and the display efficiency of the grid model is greatly improved.
The method has the following unique advantages:
1. and the dimension of the grid data is reduced, and the three-dimensional array is unfolded to be a one-dimensional list, so that the processing speed is improved.
2. Each grid is processed separately, and the grids to be displayed are screened rapidly.
3. And the model coordinate system is used for constructing the network, so that the model construction efficiency is improved.
4. Only the surface triangular net is obtained, so that the display performance is greatly improved.
5. And the special normal vector storage mode saves the memory space.
Claims (7)
1. A standard grid three-dimensional model rapid display method is characterized by comprising the following steps:
a. standard grid data are obtained;
b. applying for a one-dimensional list;
c. mapping the coordinates IJK of all grids in the grid data with the established one-dimensional list subscript, and recording the attribute value of the grid at the corresponding position in the one-dimensional list;
d. setting a circulation condition to enable the coordinates IJK of the grid to be in triple circulation, wherein the circulation range of I, J, K is from 0 to the span thereof;
e. sequentially calculating indexes of the one-dimensional lists corresponding to each grid according to the circulation conditions, and obtaining attribute values of the grids through mapping;
f. judging whether the attribute value of the current grid is valid or not, if the attribute value is valid, performing the next operation, and if the attribute value is not valid, skipping the grid;
g. acquiring a one-dimensional list index corresponding to an adjacent grid connected with the six-directional surfaces of the current grid;
h. respectively judging whether grids adjacent to the surfaces in six directions have effective values, if the grids adjacent to the surfaces in a certain direction have the effective values, skipping the direction, and if the grids adjacent to the surfaces in a certain direction have no effective values, performing the next step;
i. creating coordinates, attribute values and normal vector values of 4 points on the surface of the grid in the direction, adding 0.5 or subtracting 0.5 to one coordinate value in the grid coordinates I, J, K to obtain the surface in the direction, and respectively +/-0.5 to obtain 4 points on the surface to form a triangular network by the other two coordinate values;
j. creating indexes for the created 4 points;
k. coloring the grid through a normal vector mapping relation;
and I, rendering the constructed grid result.
2. The method according to claim 1, wherein in the step b, the size of the one-dimensional list space is not smaller than (I max -I min +1）×（J max -J min +1）×（K max -K min +1), wherein I max For the maximum of coordinates I in all grids, I min For the minimum value of the coordinates I in all grids, J max For the maximum of coordinates J in all grids, J min For the minimum value of the coordinates J in all grids, K max For the maximum value of the coordinates K in all grids, K min Is the minimum of the coordinates K in all grids.
3. The method for rapidly displaying a standard three-dimensional grid model according to claim 1, wherein in the step d, the cycle range of I, J, K is I: [0,I ] max -I min ]，J：[0，J max -J min ]，K：[0，K max -K min ]Wherein I max For the maximum of coordinates I in all grids, I min For the minimum value of the coordinates I in all grids, J max For the maximum of coordinates J in all grids, J min For the minimum value of the coordinates J in all grids, K max For the maximum value of the coordinates K in all grids, K min Is the minimum of the coordinates K in all grids.
4. The method according to claim 1, wherein in step h, it is first determined whether the coordinates I, J, K of the grid are smaller than 0 or larger than their own span after adding and subtracting 1, respectively, and then determining whether the attribute value exists at the position in the corresponding one-dimensional list.
5. The method for rapidly displaying a standard three-dimensional grid model according to claim 1, wherein in the step i, enumeration type values are adopted to represent normal vector values of six faces, and the normal vector values are 0,1,2,3,4 and 5.
6. The method of claim 1, wherein in step j, the index of 4 points on the first surface is 0,1,2,0,2,3, and each time 4 points on one surface are newly created, 4 is added to the index of 4 points on the previous surface.
7. The method for rapidly displaying a standard three-dimensional grid model according to claim 1, wherein in the step k, the normal vector mapping relationship is: the colors rgb values 0, 128, 255 correspond to-1, 0,1 of the normal vector, respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310317368.XA CN116051786B (en) | 2023-03-29 | 2023-03-29 | Quick display method for standard grid three-dimensional model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310317368.XA CN116051786B (en) | 2023-03-29 | 2023-03-29 | Quick display method for standard grid three-dimensional model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116051786A CN116051786A (en) | 2023-05-02 |
| CN116051786B true CN116051786B (en) | 2023-06-02 |
Family
ID=86116661
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310317368.XA Active CN116051786B (en) | 2023-03-29 | 2023-03-29 | Quick display method for standard grid three-dimensional model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116051786B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116384207B (en) * | 2023-05-17 | 2023-12-05 | 核工业航测遥感中心 | Attribute value fusion rendering method based on wind field flow track and flow texture |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109472802A (en) * | 2018-11-26 | 2019-03-15 | 东南大学 | A kind of surface grid model construction method constrained certainly based on edge feature |
| CN110660121A (en) * | 2019-08-22 | 2020-01-07 | 稿定（厦门）科技有限公司 | Three-dimensional font rendering method, medium, device and apparatus |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5945996A (en) * | 1996-10-16 | 1999-08-31 | Real-Time Geometry Corporation | System and method for rapidly generating an optimal mesh model of a 3D object or surface |
| CN1758164A (en) * | 2005-10-28 | 2006-04-12 | 西北工业大学 | Construction method of rod knife space scanning body based on compression body mould |
| CN102625126B (en) * | 2012-03-22 | 2014-10-15 | 北京工业大学 | Prediction-based three-dimensional mesh coding method |
| CN103810756B (en) * | 2014-01-17 | 2016-08-17 | 浙江大学 | The method for drafting of self adaptive Loop subdivision curved surface based on irregular area |
| CN111161411B (en) * | 2020-04-08 | 2020-07-14 | 速度时空信息科技股份有限公司 | OctreeImage-based three-dimensional building model L OD method |
| CN112365601A (en) * | 2020-11-19 | 2021-02-12 | 连云港市拓普科技发展有限公司 | Structured light three-dimensional point cloud reconstruction method based on feature point information |
| CN112634387B (en) * | 2020-11-30 | 2022-02-01 | 江南大学 | Construction method and application of color fiber four-dimensional color mixing space grid model and grid point array color matrix |
| CN115017773A (en) * | 2022-06-17 | 2022-09-06 | 中国铁建重工集团股份有限公司 | Dimension reduction method of three-dimensional grid model, electronic equipment and medium |
| CN115774913A (en) * | 2022-12-29 | 2023-03-10 | 中北大学 | Casting modeling simulation grid subdivision method based on surface grid projection |
-
2023
- 2023-03-29 CN CN202310317368.XA patent/CN116051786B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109472802A (en) * | 2018-11-26 | 2019-03-15 | 东南大学 | A kind of surface grid model construction method constrained certainly based on edge feature |
| CN110660121A (en) * | 2019-08-22 | 2020-01-07 | 稿定（厦门）科技有限公司 | Three-dimensional font rendering method, medium, device and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116051786A (en) | 2023-05-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110516303A (en) | Bridge construction management method for visualizing and device based on lightweight BIM | |
| CN116051786B (en) | Quick display method for standard grid three-dimensional model | |
| US7327363B2 (en) | Image processing apparatus, and computer program | |
| CN105761303A (en) | Creation Of Bounding Boxes On 3d Modeled Assembly | |
| US11544898B2 (en) | Method, computer device and storage medium for real-time urban scene reconstruction | |
| CN105760570A (en) | Viewpoint selection in the redering of a set of objects | |
| CN113688545A (en) | Visualization method and system for finite element post-processing result and data processing terminal | |
| CN110163972B (en) | OpenGL-based three-dimensional finite element model and response cloud image display method | |
| CN103886120A (en) | Lightweighting visualization method for digital mockups of large products | |
| CN116664776A (en) | Three-dimensional visual editing system based on digital twin | |
| CN111737844A (en) | Web 3D-based three-dimensional building model editing system and workflow | |
| Li et al. | A sweep and translate algorithm for computing voxelized 3D Minkowski sums on the GPU | |
| US7388584B2 (en) | Method and program for determining insides and outsides of boundaries | |
| CN112818450A (en) | BIM (building information modeling) model organization method based on block index | |
| US9536343B2 (en) | Three-dimensional image generation apparatus and three-dimensional image generation method | |
| CN109684656B (en) | Assembly constraint inheritance method based on SolidWorks | |
| CN104112017A (en) | Method of realizing script model exporting based on 3D MAX (Three-dimensional Studio Max) | |
| CN116310753A (en) | Vectorized skeleton extraction method and system for outdoor scene point cloud data | |
| CN112848312B (en) | Method and device for detecting three-dimensional model object, computer equipment and storage medium | |
| CN115294283A (en) | Digital twin factory construction method, device, equipment and storage medium | |
| US20030117394A1 (en) | Simulator having video generating function and simulation method including video generating step | |
| Ma et al. | Research on 3D Digital Modeling of Power Grid and the Practical Key Technologies based on GIM | |
| CN113449354A (en) | IPDE-based ship product three-dimensional model data visualization construction method | |
| JPH0136152B2 (en) | ||
| US6903740B1 (en) | Volumetric-based method and system for visualizing datasets |
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 |