CN111127615A - Data scheduling method and device of three-dimensional model and electronic equipment - Google Patents
Data scheduling method and device of three-dimensional model and electronic equipment Download PDFInfo
- Publication number
- CN111127615A CN111127615A CN201911370259.4A CN201911370259A CN111127615A CN 111127615 A CN111127615 A CN 111127615A CN 201911370259 A CN201911370259 A CN 201911370259A CN 111127615 A CN111127615 A CN 111127615A
- Authority
- CN
- China
- Prior art keywords
- model
- octree
- node
- scene
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- 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
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
Abstract
The invention is applicable to the technical field of data processing, and provides a data scheduling method and device of a three-dimensional model and electronic equipment. The method comprises the steps of determining a scene model to be displayed and a model file corresponding to the scene model according to the position information of a current viewpoint; the visibility judgment is carried out on all nodes in a scene model to be displayed through the combination of an octree structure and a KD tree structure and a view cone of a current viewpoint, visible nodes entering the view range of the view cone of the current viewpoint are marked, and the visible nodes are mounted to a detail level paging PageLOD; traversing the visible nodes mounted by the PageLOD, reading LOD models of different levels, carrying out LOD visibility judgment on the visible nodes mounted by the PageLOD, and storing data request information into a data request list according to a judgment result; and loading the relevant data of the corresponding visible node to the memory to wait for rendering according to the data request information in the data request list. The invention can reduce the data amount to be processed, thereby ensuring the high efficiency of data rendering.
Description
Technical Field
The invention belongs to the technical field of data processing, and particularly relates to a data scheduling method and device of a three-dimensional model and electronic equipment.
Background
The data volume of the three-dimensional model is large, particularly the data volume of the urban three-dimensional model can reach 100G bits, and obviously, the data volume cannot be realized if the data volume is directly read from a hard disk and written into a memory at one time. And the display quality of the three-dimensional model data not only depends on the majority of the read-in memory data quantity, but also depends on whether the scene object is efficiently drawn under a certain frame rate, and the three-dimensional model data can respond to the input of a user to carry out real-time smooth interaction. At present, three-dimensional model data is mainly managed and scheduled by a level of detail model (LOD) technique.
The LOD technology is a common large scene scheduling method, and is used for dividing the detail levels of scene display according to factors such as distance, speed and the like and performing level rendering, so that the data volume during scene rendering is effectively reduced, and the rendering efficiency is improved. The three-dimensional model data structure is grid-based, and there are mainly 3 ways to form the LOD model structure: a discrete LOD model; continuous LOD mode; a multi-resolution LOD model.
The discrete LOD model is loaded by selecting a proper model according to viewpoint change in a scene, and is discrete among layers, so that a more abrupt level conversion effect can occur in the viewpoint change process, and space storage is increased after data preprocessing, and pressure is removed for I/O operation of data reading. The continuous LOD model is a simplified model calculated according to the current conditions in the process of rendering the three-dimensional scene, so that the difference between the detail levels of the same region is small and the transition is smooth. However, this method has high computing power requirements and is difficult to ensure real-time rendering. The multi-resolution LOD model adopts a partitioning principle, and aims to solve the problems that large-scale data in a large scene cannot be completely stored in a memory and efficient rendering cannot be achieved even if the large-scale data is stored in the memory.
Therefore, an efficient scheduling method for three-dimensional model data is needed to ensure efficient rendering.
Disclosure of Invention
The embodiment of the invention provides a data scheduling method and device of a three-dimensional model and electronic equipment, and aims to solve the problems in the related art.
The embodiment of the present invention is implemented as follows, and in a first aspect, the embodiment of the present invention provides a data scheduling method for a three-dimensional model, including: determining a scene model to be displayed and a model file corresponding to the scene model according to the position information of the current viewpoint; the model file is cached in a mode that an octree structure is combined with a KD tree structure;
carrying out visibility judgment on all nodes in the scene model to be displayed by combining the octree structure with the KD tree structure and the view cone of the current viewpoint, marking visible nodes in the view range of the view cone of the current viewpoint, and mounting the visible nodes to a detail level paging PageLOD;
traversing visible nodes mounted by the pageLOD of the detail level pages, reading LOD models of different levels, performing LOD visibility judgment on the visible nodes mounted by the pageLOD, and storing data request information into a data request list according to a judgment result; the data request information is used for requesting related data of visible nodes corresponding to LOD models of different levels;
and loading relevant data of the corresponding visible node to a memory to wait for rendering according to the data request information in the data request list.
Further, before determining the scene model to be displayed and the model file corresponding to the scene model to be displayed according to the position information of the current viewpoint, the method further includes:
and based on the octree structure and the KD tree structure, carrying out scene segmentation on the three-dimensional city model to obtain a model file cached in a mode that the octree structure is combined with the KD tree structure.
Furthermore, the three-dimensional city model is subjected to scene based on the octree structure and the KD tree structure
The step of segmenting and obtaining the model file cached in the form that the octree structure is combined with the KD tree structure comprises the following steps:
calculating the bounding box of each building in the three-dimensional city model according to the range of the three-dimensional city model in the XYZ coordinate axis, and generating a scene bounding box according to the range of the bounding box of each building;
the scene bounding box is subjected to segmentation processing, and a model file cached in a mode that an octree structure is combined with a KD tree structure is obtained;
wherein the segmentation process comprises:
carrying out octree segmentation processing on the scene bounding box after the nth segmentation in an XYZ coordinate axis, and segmenting into 8 scene bounding boxes after the (n + 1) th segmentation; wherein n is a natural number;
the following processing is performed for each scene bounding box after the n +1 th division:
if the vertexes of the bounding boxes of the buildings in the segmented scene bounding boxes are all in one octree node, determining the octree node as the octree node where the building model is located; if the building model is not in the same octree node, determining the octree node where the central point of the bounding box of the building is located as the octree node where the building model is located;
judging whether the number of model fragments in the octree node is greater than a first preset threshold value, if so, determining the octree node as an octree leaf node, and performing KD tree division on the octree leaf node;
and if the value of the n is not greater than the first preset value, updating the value of the n, and surrounding the n-th segmented scene in the octree node which is greater than the first preset value to perform the segmentation again.
Furthermore, the traversing the visible nodes mounted by the PageLOD for the level of detail pages, reading LOD models of different levels, and performing LOD visibility judgment on the visible nodes mounted by the PageLOD includes:
traversing visible nodes mounted by the detail level pageLOD, determining the level of an LOD model corresponding to each visible node according to a formula L (d/△ L), and judging the LOD visibility of the visible nodes mounted by the pageLOD according to the level of the LOD model, wherein L is the level of the LOD, d is the distance between the visible nodes and a viewpoint, and △ L is the level distance.
Further, before the loading the relevant data of the corresponding visible node to the memory according to the data request information in the data request list to wait for rendering, the method further includes:
and deleting the relevant data of the visible nodes which are cached in the memory and do not enter the visual field range of the visual cone of the current viewpoint after the preset time limit.
In a second aspect, an embodiment of the present invention further provides a data scheduling apparatus for a three-dimensional model, including: the determining unit is used for determining a scene model to be displayed and a model file corresponding to the scene model according to the position information of the current viewpoint; the model file is cached in a mode that an octree structure is combined with a KD tree structure;
the processing unit is used for judging the visibility of all nodes in the scene model to be displayed by combining the octree structure with the KD tree structure and the view cone of the current viewpoint, marking visible nodes in the view range of the view cone entering the current viewpoint and mounting the visible nodes to the detail level paging PageLOD;
the processing unit is further used for traversing visible nodes mounted by the pageLOD with the detail level pages, reading LOD models of different levels, performing LOD visibility judgment on the visible nodes mounted by the pageLOD, and storing data request information into a data request list according to a judgment result; the data request information is used for requesting related data of visible nodes corresponding to LOD models of different levels;
and the loading unit is used for loading the relevant data of the corresponding visible node to the memory to be rendered according to the data request information in the data request list.
Still further, still include:
and the obtaining unit is used for carrying out scene segmentation on the three-dimensional city model based on the octree structure and the KD tree structure and obtaining the model file cached in a mode of combining the octree structure with the KD tree structure.
Further, the acquiring unit is specifically configured to calculate a bounding box of each building in the XYZ coordinate axes according to a three-dimensional city model range, and generate a scene bounding box according to a range of the bounding box of each building;
the scene bounding box is subjected to segmentation processing, and a model file cached in a mode that an octree structure is combined with a KD tree structure is obtained;
wherein the segmentation process comprises:
carrying out octree segmentation processing on the scene bounding box after the nth segmentation in an XYZ coordinate axis, and segmenting into 8 scene bounding boxes after the (n + 1) th segmentation; wherein n is a natural number;
the following processing is performed for each scene bounding box after the n +1 th division:
if the vertexes of the bounding boxes of the buildings in the segmented scene bounding boxes are all in one octree node, determining the octree node as the octree node where the building model is located; if the building model is not in the same octree node, determining the octree node where the central point of the bounding box of the building is located as the octree node where the building model is located;
judging whether the number of model fragments in the octree node is greater than a first preset threshold value, if so, determining the octree node as an octree leaf node, and performing KD tree division on the octree leaf node;
and if the value of the n is not greater than the first preset value, updating the value of the n, and surrounding the n-th segmented scene in the octree node which is greater than the first preset value to perform the segmentation again.
Further, the processing unit is specifically configured to traverse visible nodes mounted on the page of detail levels PageLOD, determine a level of an LOD model corresponding to each visible node according to a formula L ═ d/△ L, and perform LOD visibility judgment on the visible nodes mounted on the PageLOD according to the level of the LOD model, where L is the level of the LOD, d is a distance between the visible node and a viewpoint, and △ L is a level distance.
Still further, still include:
and the deleting unit is used for deleting the relevant data of the visible nodes which are cached in the memory and do not enter the visual cone visual field range of the current viewpoint after the preset time limit.
In a third aspect, an embodiment of the present invention further provides an electronic device, including a memory, on which a computer program is stored;
a processor for executing the computer program in the memory to implement the steps in the data scheduling method of the three-dimensional model according to the above embodiments.
Compared with the related art, the data scheduling method and device of the three-dimensional model and the electronic equipment have the following beneficial effects: determining a scene model to be displayed and a model file corresponding to the scene model to be displayed according to the position information of the current viewpoint, caching the model file in a mode that an octree structure is combined with a KD tree structure, carrying out visibility judgment on all nodes in the scene model to be displayed according to the octree structure, the KD tree structure and a view cone of the current viewpoint, marking visible nodes which enter the view cone range of the current viewpoint, and mounting the visible nodes to a detail level paging PageLOD; and traversing visible nodes mounted by the pageLOD with detail level pages, reading LOD models of different levels, carrying out LOD visibility judgment on the visible nodes mounted by the pageLOD, and storing data request information into a data request list according to a judgment result, so that related data of the corresponding visible nodes can be loaded to a memory to wait for rendering according to the data request information in the data request list. Therefore, the process only needs to perform corresponding data loading on the visible nodes, the data amount required to be processed can be reduced, after the visible nodes are determined, LOD visibility judgment needs to be further performed on each visible node, hierarchy display is achieved, namely, the finer nodes far away from the viewpoint are not displayed as far as possible, the nodes closer to the viewpoint are displayed as far as possible, the data amount required to be processed can be greatly reduced, the data amount of the memory loaded data can be reduced, and the high efficiency of data rendering is further guaranteed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
Fig. 1 is a schematic flow chart of a data scheduling method for a three-dimensional model according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of node visibility determination according to an embodiment of the present invention;
FIG. 3 is an exemplary diagram of a cropping plane for node visibility determination provided by an embodiment of the present invention;
FIG. 4 is a schematic flow chart of another method for scheduling data of a three-dimensional model according to an embodiment of the present invention;
FIG. 5 is an outgoing schematic diagram of a three-dimensional city model scene segmentation provided by an embodiment of the present invention;
FIG. 6 is a diagram illustrating an encoding of octree partitioning according to an embodiment of the present invention;
FIG. 7 is a flowchart illustrating another method for scheduling data of a three-dimensional model according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a data scheduling apparatus for a three-dimensional model according to an embodiment of the present invention;
FIG. 9 is a schematic structural diagram of an apparatus for scheduling data of another three-dimensional model according to an embodiment of the present invention;
FIG. 10 is a schematic structural diagram of a data scheduling apparatus for another three-dimensional model according to an embodiment of the present invention;
fig. 11 is a schematic structural diagram of another electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further 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.
In order to effectively explain embodiments of the present invention, the embodiments of the present application will be described in detail below with reference to the accompanying drawings.
The embodiment of the invention provides a data scheduling method of a three-dimensional model, as shown in fig. 1, comprising the following steps:
step S101, according to the position information of the current viewpoint, a scene model to be displayed and a model file corresponding to the scene model are determined.
The model file is cached in a mode that an octree structure is combined with a KD tree structure.
Specifically, in this embodiment, the viewpoint is a viewpoint when the user roams on the three-dimensional city model through the web client. The system is pre-stored with corresponding scene models at different viewpoints, each scene model corresponds to a model file, and each model file is cached in a mode that an octree structure is combined with a KD tree structure.
It should be noted that an octree is a tree-like data structure describing a three-dimensional space. Each node of the octree represents a cubic volume element, each node has eight children nodes, and the volume elements represented by the eight children nodes are added together to be equal to the volume of the parent node. The KD tree is a data structure for dividing data points in a k-dimensional space (such as two-dimensional (x, y), three-dimensional (x, y, z) and k-dimensional (x1, y, z.)), and is mainly applied to searching of multi-dimensional space key data (such as range searching and nearest neighbor searching). Essentially, the Kd-tree is a balanced binary tree. In the embodiment of the invention, the data of the model file is spatially divided by combining the octree structure with the KD tree structure, the data of the tree structure is cached, and the data in the form of combining the octree with the KD tree is read in the rendering stage, so that the pressure of reading the data by a memory can be greatly reduced.
And S102, performing visibility judgment on all nodes in the scene model to be displayed through the octree structure in combination with the KD tree structure and the view cone of the current viewpoint, marking visible nodes in the view range of the view cone of the current viewpoint, and mounting the visible nodes to the detail level paging PageLOD.
Specifically, the visual cone of the viewpoint in the embodiment of the invention refers to a visual cone range of a camera in a scene, and the visual cone range comprises 6 planes of an upper plane, a lower plane, a left plane, a right plane, a near plane and a far plane. The scenery inside the visual cone is visible, and the scenery outside the visual cone is not visible. In the step, the octree and the KD book are combined to divide the nodes to surround the box vertex position to screen the scene of the visual cone body, and the nodes in the visual range of the visual cone body are determined to be marked.
Furthermore, by combining the octree structure with the KD tree structure and the view cone of the current viewpoint, it is necessary to sequentially perform visibility judgment on each node in the scene model to be displayed, where, when performing visibility judgment on any one node, as shown in fig. 2, it may be determined by the following method:
and step S1021, according to the camera position, the direction vector between the camera and the target node and the distance between the near cutting surface and the far cutting surface, solving a view cone vertex set according to the principle of a similar triangle.
Wherein, the camera position is the viewpoint position. In this application, the camera is taken as the viewpoint for the user to view. The near cutting surface is a cutting surface which is perpendicular to the sight line of the camera and is firstly intersected with the scene model to be displayed. The far clipping plane is a clipping plane perpendicular to the line of sight of the camera and finally intersected with the scene model to be displayed, as shown in fig. 3.
And step S1022, calculating plane equations of the six outer surfaces of the view frustum by the following plane equations according to the principle of three-point coplanarity.
Ax + By + Cz + D is 0, wherein A, B, C and D represent constants of planar spatial features, and x, y, and z represent three-dimensional spatial coordinates.
Step S1023, judging the relation between the vertex of the target node bounding box and the 6 planes of the visual cone based on the judgment of the points in the plane and out of the plane, namely, the positive and negative values of the result obtained by cross multiplication of the vector formed by a certain point and the point on the plane and the normal vector of the plane.
The plane normal vector can be obtained by a plane equation.
Step S1024, if one of the vertexes of the target node bounding box is detected to be in all 6 planes, the target node is considered to be in the view frustum range, and marking is carried out.
It should be noted that, in step S102, after it is determined that the current node is within the view cone range, the visibility of the child nodes thereof needs to be further determined, so that the finer nodes farther from the viewpoint are not displayed as much as possible, and the nodes closer to the viewpoint are displayed as much as possible until all the nodes in the scene to be displayed are subjected to the visibility judgment.
After all visible nodes in the scene model to be displayed are determined, the visible nodes are mounted into the PageLOd.
Step S103, traversing the visible nodes mounted by the pageLOD with the detail level, reading LOD models with different levels, carrying out LOD visibility judgment on the visible nodes mounted by the pageLOD, and storing the data request information into a data request list according to the judgment result.
The data request information is used for requesting relevant data of visible nodes corresponding to LOD models of different levels.
Specifically, in order to reduce the data amount during rendering, because the distance between each visible node and the viewpoint is different in the scene model to be displayed, a node user closer to the viewpoint watches more carefully, some details need to be presented to the user, a node user farther from the viewpoint watches more roughly, and details do not need to be presented to the user, so that LOD visibility judgment needs to be performed on the visible nodes. Visible distances are preset for different levels of LOD models, and the visible distances at each level are different, so that the presented definition is different. In this way, the LOD models of different levels can be read, LOD visibility judgment is performed on the visible nodes mounted by the PageLOD, that is, which level of the LOD model each visible node is in is determined, and since the clarity required to be displayed by each level of the LOD model is different, the data required to be loaded during display is also different, so that a data request message requesting corresponding data can be generated according to the judgment result of the LOD visibility judgment of each visible node, and the data request message corresponding to each visible node is stored in the data request list.
That is to say, the LOD visibility judgment of the visible node mounted by the PageLOD is to judge the detail content closer to the viewpoint to be visible, that is to show the video detail content closer to the viewpoint to the user, and judge the detail content farther from the viewpoint to be invisible, so that the video detail content farther from the viewpoint can not be shown to the user, and the geometric complexity of the three-dimensional scene can be reduced by successively simplifying the surface detail of the video data to be displayed from near to far from the viewpoint.
Furthermore, traversing the visible nodes mounted by the pageLOD of the detail level pages, reading LOD models of different levels, and performing LOD visibility judgment on the visible nodes mounted by the pageLOD comprises the following steps:
and traversing the visible nodes mounted by the pageLOD of the detail level pages, determining the level of the LOD model corresponding to each visible node by a formula L (d/△ L), and judging the LOD visibility of the visible nodes mounted by the pageLOD according to the level of the LOD model.
Generally, △ L is obtained by dividing the side length of a scene bounding box by the number of LOD layers to be divided, and d is obtained by calculating the distance from a viewpoint to the center point of a model bounding box.
In the XYZ axes, a range of the three-dimensional city model is set as required, then the bounding box of each building is calculated according to the range of the three-dimensional city model in the XYZ axes, and the calculated range of the bounding box of each building is combined into the scene bounding box. And d is the distance between the center point distance of the model bounding box of the building and the viewpoint. Each building comprises a plurality of nodes, and when the LOD model level of the visible node is judged, the corresponding viewpoint distance d can be determined according to the distance of the center point of the model bounding box of the building where the visible node is located. The LOD model hierarchy for each visible node is not identical because the model bounding box of the building in which each visible node resides is not identical. After the level of the LOD model where each visible node is located is determined, the displayed detail content is different due to different visible distances of each level, and the LOD visibility of each visible node can be determined according to the level of the LOD model where each visible node is located. Therefore, according to the level of the LOD model where each visible node is located, the corresponding data request message can be generated and added to the data request list.
It should be noted that, the model lod is 3-5 layers, the lod simplification rate is from 0-100%, and the simplification rate is increased step by step. If the model precision is higher, the triangular surface is more, the lod level can be set more, and conversely, if the model is simpler, the triangular surface is less, the lod level can be set less. Typically the finer model reduction rate recommendation is set to 5 layers. The number of LOD layers is predetermined.
It should be noted that, in the present application, the visible nodes and invisible nodes in the to-be-displayed scene model within the 360-degree view range are determined by using the viewing pyramid in step 102, and then the visible nodes and invisible nodes of different levels are determined by using the distance between the visible nodes and the viewpoint in step 103.
The LOD model is a model which is provided with a plurality of levels, and the most fuzzy level needs to be subjected to contour fuzzy, texture fuzzy, data compression and other processing based on the original model.
And step S104, loading the relevant data of the corresponding visible node to a memory to wait for rendering according to the data request information in the data request list.
Specifically, when data is loaded, the relevant data of the corresponding visible node is loaded into the memory according to the data request information in the data request list, so as to perform rendering subsequently.
Therefore, the octree structure is combined with the KD tree structure and the view cone of the current viewpoint, visibility judgment is carried out on all nodes inside the scene model to be displayed to determine visible nodes, after the visible nodes are mounted to the PageLOD, LOD visibility judgment is further carried out on the visible nodes in the PageLOD, and corresponding data request information is added to the data request list according to the judgment result, so that data can be loaded into the memory according to the data request list, and corresponding rendering is carried out. The above process only needs to perform corresponding data loading on the visible nodes, the data amount required to be processed can be reduced, after the visible nodes are determined, LOD visibility judgment needs to be further performed on each visible node, hierarchy display is achieved, namely the nodes which are far away from the viewpoint and fine are not displayed as far as possible, the nodes which are close to the viewpoint are displayed as far as possible, the data amount required to be processed can be greatly reduced, the data amount of memory loaded data can be reduced, and the high efficiency of data rendering is further guaranteed.
Further, as shown in fig. 4, before the step S101, the method further includes:
and S201, carrying out scene segmentation on the three-dimensional city model based on the octree structure and the KD tree structure, and obtaining a model file cached in a mode that the octree structure is combined with the KD tree structure.
Specifically, the embodiment of the invention mainly performs three-dimensional display on the three-dimensional city model at the terminal, and before the display is performed according to the viewpoint, the three-dimensional city model needs to be subjected to corresponding scene segmentation processing, so that the required data information can be quickly found during the display. In the step, scene segmentation is carried out by using a method of combining the octree and the KD tree, rough segmentation is realized by using the octree firstly, a target area can be determined more quickly, accurate segmentation is realized by the KD tree, and accurate searching efficiency is higher by the KD tree, so that the aims of improving segmentation precision and simultaneously improving searching efficiency are achieved.
As shown in fig. 5, this step can be implemented by the following processes:
and step S2011, calculating the bounding box of each building in the three-dimensional city model according to the three-dimensional city model range in the XYZ coordinate axis, and generating the scene bounding box according to the range of the bounding box of each building.
Specifically, in the XYZ axes, a range of the three-dimensional city model is set according to a requirement, then the bounding box of each building is calculated according to the range of the three-dimensional city model in the XYZ axes, and the calculated range of the bounding box of each building is combined into the scene bounding box.
Further, the bounding box of each building can be calculated by the osg getBoundingbox method.
And step S2012, the scene bounding box is segmented, and a model file cached in a mode that an octree structure is combined with a KD tree structure is obtained.
Specifically, the scene bounding box needs to be segmented firstly in an XYZ coordinate axis, at this time, octree segmentation is carried out firstly, KD tree segmentation is carried out on leaf nodes of the octree, data of a tree structure is cached to a disk, and the data is a model file.
Wherein the segmentation process includes: the scene bounding box after the nth division is subjected to octree division processing in XYZ coordinate axes, and is divided into 8 scene bounding boxes after the (n + 1) th division. Wherein n is a natural number.
Further, when the scene bounding box is subjected to octree segmentation and the segmented scene is coded, the following method can be adopted: the location of the X, Y, Z axes and the origin O of the three-dimensional coordinate system in the scene is first determined. When the first-stage division determines each sub-partition code, 1 is added to each grid in the X-axis direction, 2 is added to each grid in the Y-axis direction, and 4 is added to each grid in the Z-axis direction from the origin O, as shown in fig. 6. Assuming that the code of the root node is 8, the code of the specified child node is represented by an n-bit 8-ary number after its parent node code, e.g., 80, 81, and n represents the number of octree splits. I.e., 80 for the first division and 800 for the second division. Suppose that the code of a certain node of the octree after the ith division is PiThen the code with its arbitrary position is: p is 8P1P2…Pi…Pn(1≤i≤n)。
The following processing is performed for each scene bounding box after the n +1 th division:
and if the vertices of the bounding boxes of the buildings in the segmented scene bounding boxes are all in one octree node, determining the octree node as the octree node where the building model is located. And if the node is not in the same octree node, determining the octree node where the center point of the bounding box of the building is located as the octree node where the building model is located.
And judging whether the number of model fragments in the octree nodes is greater than a first preset threshold value, if so, determining the octree nodes as octree leaf nodes, and performing KD tree division on the octree leaf nodes.
And if the value of the n is not greater than the first preset value, updating the value of the n, and surrounding the n-th segmented scene in the octree node which is greater than the first preset value to perform segmentation again.
It should be noted that the three-dimensional model is composed of a plurality of vertexes, various fragments are formed between the vertexes, that is, model fragments, and textures and materials can be pasted on the model fragments. When the three-dimensional model is built, the model fragments in the three-dimensional model are determined, the three-dimensional model is formed by the model fragments, therefore, the model fragments contained in each building model can be calculated, and the octree node contains at least one building model, so that the number of the model fragments contained in the octree node can be calculated by calculating the function of the model fragments.
That is, the scene bounding box after the nth division is subjected to octree division for the (n + 1) th time in the XYZ coordinate axis, and the scene bounding box after the nth division is divided into 8 scene bounding boxes after the (n + 1) th octree division. The building model in the scene bounding box after each (n + 1) th octree division needs to determine the corresponding octree node. Since the smallest data unit in the octree nodes is a single building model, it needs to determine whether 8 vertexes of each building bounding box are under the same octree node, and if all the vertexes are in the same octree node, the building model is added to the node, that is, the octree node is determined as the octree node where the building model is located. If the 8 vertexes of the building bounding box are not all in the same octree node, namely the condition of intersecting with a plurality of nodes exists, the building model is added into the node where the center point of the building model is located, namely the node where the center point of the building model is located is determined as the octree node where the building model is located.
After the n +1 th segmentation is completed, whether octree segmentation needs to be continued or not needs to be further determined, at this time, whether the number of fragments of the building model in the octree node is greater than a first preset threshold or not needs to be judged, if so, the octree node is determined as an octree leaf node, and KD tree segmentation is performed on the octree leaf node. And if the number of the building model in all the octree nodes is not more than the first preset threshold, continuing to perform octree segmentation, adding 1 to the value of n at the moment, namely updating the value of n to n +1, re-executing the segmentation processing steps until the number of the building model in all the octree nodes is more than the first preset threshold, namely that the octree nodes generate leaf nodes, and completing the octree segmentation. KD-tree partitioning may be performed for each leaf node.
It should be noted that, a threshold of the number of the three-dimensional data minimum organization form triangular patches in the octree node is preset according to requirements, that is, the threshold is a first preset threshold.
When n is 0, the scene bounding box after the 0 th segmentation is the un-segmented scene bounding box, that is, the scene bounding box generated in step S2011.
Further, the KD-tree partitioning of octree leaf nodes includes:
step a, when the scene bounding box is subjected to octree segmentation, encoding nodes of each segmented octree, wherein the nodes are Morton codes. And inquiring nodes with the same Morton code, and attributing node sets with the same Morton code to a three-dimensional array.
And b, traversing all point set arrays of different Morton codes, and respectively constructing corresponding k-d trees for the data in each array.
And c, respectively calculating the variance of all model data of the three-dimensional array on the X, Y, Z axis. If the difference is maximum above the x-axis, the split threshold is 0; the variance of the Y axis is the largest, the split threshold is 1, the variance of the Z axis is the largest, and the split threshold is 2. Where split is the number of axes in the direction perpendicular to the dividing hyperplane.
And D, determining a root node of the K-D tree, if the variance on the x axis is maximum, sorting the data according to the value on the x axis, and taking the point centered by the x coordinate value as the root node, wherein the split hyperplane is the plane which passes through the root node and is perpendicular to the split axis of 0 (x).
It should be noted that, if the variance on the y-axis or the z-axis is the largest, the method for determining the root node of the K-D tree may refer to the variance on the x-axis being the largest, and is not limited herein.
And e, repeating the steps on all the data of the two spaces divided by the dividing plane until the data cannot be divided by the dividing plane.
Therefore, through the steps, the octree and KD tree segmentation can be carried out on the scene model of the three-dimensional city model, the segmentation precision can be improved, the required data can be found directly according to the octree structure and the KD tree structure when the scheduling is carried out, and the rendering efficiency can be improved.
Further, before the step S104, as shown in fig. 7, the method further includes:
and S105, deleting the relevant data of the LOD model which is cached in the memory and does not enter the view range of the view point within the preset time limit.
Specifically, some data loaded in the memory can be deleted in the view range of the view cone which can not be viewed at the current viewpoint any more due to the change of the viewpoint. To avoid deleting data used at high frequencies, data associated with LOD models in the view field of the vertebral body that have not entered the viewpoint beyond a predetermined time period may be deleted. The preset time limit can be set according to the requirements of the user, and is not limited herein.
Furthermore, in the present invention, in order to speed up data processing, a paging multithreading mechanism may be adopted in the data scheduling process to implement simultaneous execution of multiple threads. The above steps S101 to S105 are implemented by two threads, for example. The two threads are divided into a main thread and a data processing thread. At this time, steps S101-S103 are performed by the main thread, and step S104 is performed by the data processing thread. That is, in step S103, the main thread stores the data request information requesting the relevant data of the visible node in the data request list, and the data processing thread executes step S104 without continuing to execute the following steps, and loads the corresponding data.
In step S105, after determining that the data related to the LOD model in the view range of the view cone does not enter the viewpoint after exceeding the preset time limit, the main thread may put the data into the discard list, and the data processing thread may periodically delete the data stored in the discard list. The main thread and the data processing thread are matched with each other to execute the steps, so that the memory occupancy can be searched, even if the invalid memory occupancy is eliminated, the memory occupancy is kept stable.
An embodiment of the present invention provides a data scheduling apparatus for a three-dimensional model, as shown in fig. 8, including:
the determining unit 301 is configured to determine a scene model to be displayed and a model file corresponding to the scene model according to the position information of the current viewpoint.
Wherein the model file is cached in a mode that an octree structure is combined with a KD tree structure.
And the processing unit 302 is configured to perform visibility judgment on all nodes in the scene model to be displayed through the octree structure in combination with the KD tree structure and the view cone of the current viewpoint, mark a visible node within the view range of the view cone entering the current viewpoint, and mount the visible node to the detail level paging PageLOD.
The processing unit 302 is further configured to traverse visible nodes mounted by the PageLOD with level of detail pages, read LOD models of different levels, perform LOD visibility judgment on the visible nodes mounted by the PageLOD, and store data request information into a data request list according to a judgment result.
The data request information is used for requesting relevant data of visible nodes corresponding to LOD models of different levels.
Specifically, the processing unit 302 is specifically configured to traverse visible nodes mounted on the page of detail level pages PageLOD, determine a level of an LOD model corresponding to each visible node according to a formula L ═ d/△ L, and perform LOD visibility judgment on the visible nodes mounted on the PageLOD according to the level of the LOD model, where L is the level of the LOD, d is a distance between the visible node and a viewpoint, and △ L is a level distance.
A loading unit 303, configured to load, according to the data request information in the data request list, the relevant data of the corresponding visible node to the memory to wait for rendering.
Further, as shown in fig. 9, the apparatus further includes: further comprising:
and the obtaining unit 304 is configured to perform scene segmentation on the three-dimensional city model based on the octree structure and the KD tree structure, and obtain a model file cached in a form that the octree structure is combined with the KD tree structure.
Specifically, the obtaining unit 304 is specifically configured to calculate, in XYZ coordinate axes, a bounding box of each building in the three-dimensional city model range, and generate a scene bounding box according to the range of the bounding box of each building; and carrying out segmentation processing on the scene bounding box to obtain a model file cached in a mode of combining an octree structure with a KD tree structure.
Wherein the segmentation process includes: the scene bounding box after the nth division is subjected to octree division processing in XYZ coordinate axes, and is divided into 8 scene bounding boxes after the (n + 1) th division. Wherein n is a natural number. The following processing is performed for each scene bounding box after the n +1 th division:
if the vertexes of the bounding boxes of the buildings in the segmented scene bounding boxes are all in one octree node, determining the octree node as the octree node where the building model is located; if the building model is not in the same octree node, determining the octree node where the central point of the bounding box of the building is located as the octree node where the building model is located; judging whether the number of model fragments in the octree node is greater than a first preset threshold value, if so, determining the octree node as an octree leaf node, and performing KD tree division on the octree leaf node; and if the value of the n is not greater than the first preset value, updating the value of the n, and surrounding the n-th segmented scene in the octree node which is greater than the first preset value to perform segmentation again.
Further, as shown in fig. 10, the apparatus further includes:
a deleting unit 305, configured to delete the data related to the LOD model that exceeds the preset time limit and does not enter the view range of the view cone of the current viewpoint and is cached in the memory.
The embodiment of the invention provides a data scheduling device of a three-dimensional model, which determines a scene model to be displayed and a model file corresponding to the scene model to be displayed according to the position information of a current viewpoint, wherein the model file is cached in a mode that an octree structure is combined with a KD tree structure, all nodes in the scene model to be displayed are subjected to visibility judgment through the octree structure, the KD tree structure and a view cone of the current viewpoint, visible nodes in the view field range of the view cone of the current viewpoint are marked, and the visible nodes are mounted to a detail level paging PageLOD; and traversing visible nodes mounted by the pageLOD with detail level pages, reading LOD models of different levels, carrying out LOD visibility judgment on the visible nodes mounted by the pageLOD, and storing data request information into a data request list according to a judgment result, so that related data of the corresponding visible nodes can be loaded to a memory to wait for rendering according to the data request information in the data request list. Therefore, the process only needs to perform corresponding data loading on the visible nodes, the data amount required to be processed can be reduced, after the visible nodes are determined, LOD visibility judgment needs to be further performed on each visible node, hierarchy display is achieved, namely, the finer nodes far away from the viewpoint are not displayed as far as possible, the nodes closer to the viewpoint are displayed as far as possible, the data amount required to be processed can be greatly reduced, the data amount of the memory loaded data can be reduced, and the high efficiency of data rendering is further guaranteed.
The disclosed embodiments also provide a computer readable storage medium, on which a computer program is stored, which when executed by a processor, implements the steps of the interaction method of the virtual robot.
An embodiment of the present disclosure further provides an electronic device, including:
a memory having a computer program stored thereon;
a processor for executing the computer program in the memory to implement the steps of the data scheduling method for the three-dimensional model.
Fig. 11 is a block diagram of the electronic device provided in the embodiment of the present disclosure. As shown in fig. 11, the electronic device 700 may include: a processor 701 and a memory 702. The electronic device 700 may also include one or more of a multimedia component 703, an input/output (I/O) interface 704, and a communication component 705.
The processor 701 is configured to control the overall operation of the electronic device 700, so as to complete all or part of the steps in the data scheduling method for the three-dimensional model. The memory 702 is used to store various types of data to support operation at the electronic device 700, such as instructions for any application or method operating on the electronic device 700 and application-related data, such as contact data, transmitted and received messages, pictures, audio, video, and the like. The Memory 702 may be implemented by any type of volatile or non-volatile Memory device or combination thereof, such as Static Random Access Memory (SRAM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Erasable Programmable Read-Only Memory (EPROM), Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk, or optical disk. The multimedia components 803 may include screen and audio components. Wherein the screen may be, for example, a touch screen and the audio component is used for outputting and/or inputting audio signals. For example, the audio component may include a microphone for receiving external audio signals. The received audio signal may further be stored in the memory 702 or transmitted through the communication component 705. The audio assembly also includes at least one speaker for outputting audio signals. The I/O interface 704 provides an interface between the processor 701 and other interface modules, such as a keyboard, mouse, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 705 is used for wired or wireless communication between the electronic device 700 and other devices. Wireless communication, such as Wi-Fi, bluetooth, Near Field Communication (NFC), 2G, 3G, or 4G, or a combination of one or more of them, so that the corresponding communication component 705 may include: Wi-Fi module, bluetooth module, NFC module.
In an exemplary embodiment, the electronic Device 700 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors, or other electronic components for performing the above-mentioned interaction method of the virtual robot.
The computer-readable storage medium provided by the embodiment of the present disclosure may be the memory 702 including program instructions, and the program instructions may be executed by the processor 701 of the electronic device 700 to complete the data scheduling method for the three-dimensional model.
The preferred embodiments of the present disclosure are described in detail with reference to the accompanying drawings, however, the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solution of the present disclosure within the technical idea of the present disclosure, and these simple modifications all belong to the protection scope of the present disclosure.
It should be noted that, in the foregoing embodiments, various features described in the above embodiments may be combined in any suitable manner, and in order to avoid unnecessary repetition, various combinations that are possible in the present disclosure are not described again.
In addition, any combination of various embodiments of the present disclosure may be made, and the same should be considered as the disclosure of the present disclosure, as long as it does not depart from the spirit of the present disclosure.
Claims (10)
1. A data scheduling method of a three-dimensional model is characterized by comprising the following steps:
determining a scene model to be displayed and a model file corresponding to the scene model according to the position information of the current viewpoint; the model file is cached in a mode that an octree structure is combined with a KD tree structure;
carrying out visibility judgment on all nodes in the scene model to be displayed by combining the octree structure with the KD tree structure and the view cone of the current viewpoint, marking visible nodes in the view range of the view cone of the current viewpoint, and mounting the visible nodes to a detail level paging PageLOD;
traversing visible nodes mounted by the pageLOD of the detail level pages, reading LOD models of different levels, performing LOD visibility judgment on the visible nodes mounted by the pageLOD, and storing data request information into a data request list according to a judgment result; the data request information is used for requesting related data of visible nodes corresponding to LOD models of different levels;
and loading relevant data of the corresponding visible node to a memory to wait for rendering according to the data request information in the data request list.
2. The method as claimed in claim 1, wherein before determining the scene model to be displayed and the corresponding model file thereof according to the position information of the current viewpoint, the method further comprises:
and based on the octree structure and the KD tree structure, carrying out scene segmentation on the three-dimensional city model to obtain a model file cached in a mode that the octree structure is combined with the KD tree structure.
3. The method according to claim 2, wherein the scene segmentation is performed on the three-dimensional city model based on the octree structure and the KD tree structure, and the obtaining of the model file cached in a form that the octree structure is combined with the KD tree structure comprises:
calculating the bounding box of each building in the three-dimensional city model according to the range of the three-dimensional city model in the XYZ coordinate axis, and generating a scene bounding box according to the range of the bounding box of each building;
the scene bounding box is subjected to segmentation processing, and a model file cached in a mode that an octree structure is combined with a KD tree structure is obtained;
wherein the segmentation process comprises:
carrying out octree segmentation processing on the scene bounding box after the nth segmentation in an XYZ coordinate axis, and segmenting into 8 scene bounding boxes after the (n + 1) th segmentation; wherein n is a natural number;
the following processing is performed for each scene bounding box after the n +1 th division:
if the vertexes of the bounding boxes of the buildings in the segmented scene bounding boxes are all in one octree node, determining the octree node as the octree node where the building model is located; if the building model is not in the same octree node, determining the octree node where the central point of the bounding box of the building is located as the octree node where the building model is located;
judging whether the number of model fragments in the octree node is greater than a first preset threshold value, if so, determining the octree node as an octree leaf node, and performing KD tree division on the octree leaf node;
and if the value of the n is not greater than the first preset value, updating the value of the n, and surrounding the n-th segmented scene in the octree node which is greater than the first preset value to perform the segmentation again.
4. The method of claim 1, wherein traversing visible nodes mounted by the level of detail paged PageLOD, reading LOD models of different levels, and performing LOD visibility determination on the visible nodes mounted by the PageLOD comprises:
traversing visible nodes mounted by the detail level pageLOD, determining the level of an LOD model corresponding to each visible node according to a formula L (d/△ L), and judging the LOD visibility of the visible nodes mounted by the pageLOD according to the level of the LOD model, wherein L is the level of the LOD, d is the distance between the visible nodes and a viewpoint, and △ L is the level distance.
5. The method according to any one of claims 1 to 4, wherein before the loading the relevant data of the corresponding visible node to the memory according to the data request information in the data request list to wait for rendering, the method further comprises:
and deleting the relevant data of the visible nodes which are cached in the memory and do not enter the visual field range of the visual cone of the current viewpoint after the preset time limit.
6. A data scheduling apparatus for a three-dimensional model, comprising:
the determining unit is used for determining a scene model to be displayed and a model file corresponding to the scene model according to the position information of the current viewpoint; the model file is cached in a mode that an octree structure is combined with a KD tree structure;
the processing unit is used for judging the visibility of all nodes in the scene model to be displayed by combining the octree structure with the KD tree structure and the view cone of the current viewpoint, marking visible nodes in the view range of the view cone entering the current viewpoint and mounting the visible nodes to the detail level paging PageLOD;
the processing unit is further used for traversing visible nodes mounted by the pageLOD with the detail level pages, reading LOD models of different levels, performing LOD visibility judgment on the visible nodes mounted by the pageLOD, and storing data request information into a data request list according to a judgment result; the data request information is used for requesting related data of visible nodes corresponding to LOD models of different levels;
and the loading unit is used for loading the relevant data of the corresponding visible node to the memory to be rendered according to the data request information in the data request list.
7. The apparatus of claim 6, further comprising:
and the obtaining unit is used for carrying out scene segmentation on the three-dimensional city model based on the octree structure and the KD tree structure and obtaining the model file cached in a mode of combining the octree structure with the KD tree structure.
8. The apparatus of claim 7,
the acquisition unit is specifically used for calculating the bounding box of each building in the three-dimensional city model range in an XYZ coordinate axis and generating a scene bounding box according to the range of the bounding box of each building;
the scene bounding box is subjected to segmentation processing, and a model file cached in a mode that an octree structure is combined with a KD tree structure is obtained;
wherein the segmentation process comprises:
carrying out octree segmentation processing on the scene bounding box after the nth segmentation in an XYZ coordinate axis, and segmenting into 8 scene bounding boxes after the (n + 1) th segmentation; wherein n is a natural number;
the following processing is performed for each scene bounding box after the n +1 th division:
if the vertexes of the bounding boxes of the buildings in the segmented scene bounding boxes are all in one octree node, determining the octree node as the octree node where the building model is located; if the building model is not in the same octree node, determining the octree node where the central point of the bounding box of the building is located as the octree node where the building model is located;
judging whether the number of model fragments in the octree node is greater than a first preset threshold value, if so, determining the octree node as an octree leaf node, and performing KD tree division on the octree leaf node;
and if the value of the n is not greater than the first preset value, updating the value of the n, and surrounding the n-th segmented scene in the octree node which is greater than the first preset value to perform the segmentation again.
9. The apparatus of any of claims 6-8, further comprising:
and the deleting unit is used for deleting the relevant data of the visible nodes which are cached in the memory and do not enter the visual cone visual field range of the current viewpoint after the preset time limit.
10. An electronic device, comprising:
a memory having a computer program stored thereon;
a processor for executing the computer program in the memory to carry out the steps of the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911370259.4A CN111127615A (en) | 2019-12-26 | 2019-12-26 | Data scheduling method and device of three-dimensional model and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911370259.4A CN111127615A (en) | 2019-12-26 | 2019-12-26 | Data scheduling method and device of three-dimensional model and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111127615A true CN111127615A (en) | 2020-05-08 |
Family
ID=70503322
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911370259.4A Pending CN111127615A (en) | 2019-12-26 | 2019-12-26 | Data scheduling method and device of three-dimensional model and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111127615A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111898276A (en) * | 2020-08-04 | 2020-11-06 | 中国南方电网有限责任公司 | Overhead line model processing method and device, computer equipment and medium |
| CN113656514A (en) * | 2021-08-12 | 2021-11-16 | 煤炭科学研究总院 | Visualization method and device for three-dimensional model of mine |
| CN114627221A (en) * | 2021-12-08 | 2022-06-14 | 北京蓝亚盒子科技有限公司 | Scene rendering method and device, runner and readable storage medium |
| CN116310135A (en) * | 2023-04-11 | 2023-06-23 | 广州市易鸿智能装备有限公司 | Curved surface display method and system based on multi-resolution LOD model |
| WO2023138469A1 (en) * | 2022-01-21 | 2023-07-27 | 北京字跳网络技术有限公司 | Image processing method and apparatus, device, and storage medium |
| CN116570925A (en) * | 2023-05-19 | 2023-08-11 | 韶关学院 | Resource management method based on AR development |
| CN116721187A (en) * | 2023-06-15 | 2023-09-08 | 广州极尚网络技术有限公司 | Animation dynamic loading and unloading method, device, equipment and medium based on scene cutting |
| CN116778129A (en) * | 2023-08-18 | 2023-09-19 | 煤炭科学研究总院有限公司 | Marking method and device for coal mine three-dimensional roadway page |
| CN117234451A (en) * | 2023-11-10 | 2023-12-15 | 北京睿呈时代信息科技有限公司 | Scene eliminating method for large scene rendering and corresponding device thereof |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104867174A (en) * | 2015-05-08 | 2015-08-26 | 腾讯科技（深圳）有限公司 | Three-dimensional map rendering and display method and system |
| CN105187794A (en) * | 2015-09-10 | 2015-12-23 | 刘朔 | Video monitoring system and massive-video scheduling method |
| CN105225230A (en) * | 2015-09-11 | 2016-01-06 | 浙江宇视科技有限公司 | A kind of method and device identifying foreground target object |
| CN110368693A (en) * | 2019-07-22 | 2019-10-25 | 珠海金山网络游戏科技有限公司 | A kind of MMO game element cutting method and its device based on multi-quadtree |
-
2019
- 2019-12-26 CN CN201911370259.4A patent/CN111127615A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104867174A (en) * | 2015-05-08 | 2015-08-26 | 腾讯科技（深圳）有限公司 | Three-dimensional map rendering and display method and system |
| CN105187794A (en) * | 2015-09-10 | 2015-12-23 | 刘朔 | Video monitoring system and massive-video scheduling method |
| CN105225230A (en) * | 2015-09-11 | 2016-01-06 | 浙江宇视科技有限公司 | A kind of method and device identifying foreground target object |
| CN110368693A (en) * | 2019-07-22 | 2019-10-25 | 珠海金山网络游戏科技有限公司 | A kind of MMO game element cutting method and its device based on multi-quadtree |
Non-Patent Citations (3)
| Title |
|---|
| 余飞;陈楚江;王丽园;: "海量激光雷达点云数据的多尺度可视化高效管理", no. 09 * |
| 李雷: "基于OGRE的海量三维模型动态调度技术的研究与实现", no. 2, pages 138 - 1936 * |
| 王育坚;廉腾飞;吴明明;高倩: "基于八叉树与KD树索引的点云配准方法", vol. 26, no. 26, pages 35 - 40 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111898276A (en) * | 2020-08-04 | 2020-11-06 | 中国南方电网有限责任公司 | Overhead line model processing method and device, computer equipment and medium |
| CN113656514A (en) * | 2021-08-12 | 2021-11-16 | 煤炭科学研究总院 | Visualization method and device for three-dimensional model of mine |
| CN114627221B (en) * | 2021-12-08 | 2023-11-10 | 北京蓝亚盒子科技有限公司 | Scene rendering method and device, operator and readable storage medium |
| CN114627221A (en) * | 2021-12-08 | 2022-06-14 | 北京蓝亚盒子科技有限公司 | Scene rendering method and device, runner and readable storage medium |
| WO2023138469A1 (en) * | 2022-01-21 | 2023-07-27 | 北京字跳网络技术有限公司 | Image processing method and apparatus, device, and storage medium |
| CN116310135B (en) * | 2023-04-11 | 2023-11-21 | 广州市易鸿智能装备有限公司 | Curved surface display method and system based on multi-resolution LOD model |
| CN116310135A (en) * | 2023-04-11 | 2023-06-23 | 广州市易鸿智能装备有限公司 | Curved surface display method and system based on multi-resolution LOD model |
| CN116570925A (en) * | 2023-05-19 | 2023-08-11 | 韶关学院 | Resource management method based on AR development |
| CN116721187A (en) * | 2023-06-15 | 2023-09-08 | 广州极尚网络技术有限公司 | Animation dynamic loading and unloading method, device, equipment and medium based on scene cutting |
| CN116721187B (en) * | 2023-06-15 | 2024-01-30 | 广州极尚网络技术有限公司 | Animation dynamic loading and unloading method, device, equipment and medium based on scene cutting |
| CN116778129A (en) * | 2023-08-18 | 2023-09-19 | 煤炭科学研究总院有限公司 | Marking method and device for coal mine three-dimensional roadway page |
| CN116778129B (en) * | 2023-08-18 | 2023-11-21 | 煤炭科学研究总院有限公司 | Marking method and device for coal mine three-dimensional roadway page |
| CN117234451A (en) * | 2023-11-10 | 2023-12-15 | 北京睿呈时代信息科技有限公司 | Scene eliminating method for large scene rendering and corresponding device thereof |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111127615A (en) | Data scheduling method and device of three-dimensional model and electronic equipment | |
| CN111127637A (en) | Data processing method and device of three-dimensional model and electronic equipment | |
| US11270497B2 (en) | Object loading method and apparatus, storage medium, and electronic device | |
| US7002571B2 (en) | Grid-based loose octree for spatial partitioning | |
| US8570322B2 (en) | Method, system, and computer program product for efficient ray tracing of micropolygon geometry | |
| CN112347546A (en) | BIM rendering method, device and computer-readable storage medium based on lightweight device | |
| CN110990516B (en) | Map data processing method, device and server | |
| US7138998B2 (en) | Multi-resolution spatial partitioning | |
| CN114820906A (en) | Image rendering method and device, electronic equipment and storage medium | |
| KR100959349B1 (en) | A method for accelerating terrain rendering based on quadtree using graphics processing unit | |
| CN113724401A (en) | Three-dimensional model cutting method and device, computer equipment and storage medium | |
| CN115222879A (en) | Model surface reduction processing method and device, electronic equipment and storage medium | |
| Chen et al. | An improved texture-related vertex clustering algorithm for model simplification | |
| Scholz et al. | Real‐time isosurface extraction with view‐dependent level of detail and applications | |
| JP2915363B2 (en) | Spatial search system | |
| Dyken et al. | Semi‐Uniform Adaptive Patch Tessellation | |
| CN112843700A (en) | Terrain image generation method and device, computer equipment and storage medium | |
| US20230351696A1 (en) | Data processing method and apparatus, device, computer-readable storage medium, and computer program product | |
| CN116310060B (en) | Method, device, equipment and storage medium for rendering data | |
| Danovaro et al. | Level-of-detail for data analysis and exploration: A historical overview and some new perspectives | |
| CN111275806A (en) | Parallelization real-time rendering system and method based on points | |
| Mateo et al. | Hierarchical, Dense and Dynamic 3D Reconstruction Based on VDB Data Structure for Robotic Manipulation Tasks | |
| KR20080044221A (en) | Treatment method for shaping of 3 dimension image using computer | |
| Lee et al. | Bimodal vertex splitting: Acceleration of quadtree triangulation for terrain rendering | |
| Sloup et al. | Optimizing Ray Tracing of Trimmed NURBS Surfaces on the GPU |
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 |