CN107730583B - Three-dimensional scene-based terrain tile data dynamic scheduling method and device - Google Patents
Three-dimensional scene-based terrain tile data dynamic scheduling method and device Download PDFInfo
- Publication number
- CN107730583B CN107730583B CN201711013323.4A CN201711013323A CN107730583B CN 107730583 B CN107730583 B CN 107730583B CN 201711013323 A CN201711013323 A CN 201711013323A CN 107730583 B CN107730583 B CN 107730583B
- Authority
- CN
- China
- Prior art keywords
- tile data
- node
- tile
- data
- current node
- 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/05—Geographic models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
Abstract
The invention discloses a three-dimensional scene-based terrain tile data dynamic scheduling method, which comprises the following steps: firstly, cutting terrain data according to a quadtree mechanism to generate tile data, and storing the cut tile data in a server; the method comprises the steps of constructing a quadtree structure in real time according to the distance between a tile center point and a viewpoint, realizing scheduling and displaying of terrain tile data, and when data scheduling is carried out on the constructed quadtree, if the current tile data does not need to be displayed, only the nodes exist, the data in the nodes are released, and only the data in the nodes needing to be displayed exist, so that according to the scheduling method, the terrain data do not need to be completely analyzed to a memory, and only the data needing to be displayed can be analyzed and loaded, so that the consumption of the memory is reduced; the invention also discloses a device and equipment for dynamically scheduling terrain tile data based on the three-dimensional scene and a computer readable storage medium, and the technical effects can be realized.
Description
Technical Field
The invention relates to the technical field of terrain data scheduling, in particular to a method, a device and equipment for dynamically scheduling terrain tile data based on a three-dimensional scene and a computer-readable storage medium.
Background
At present, the traditional three-dimensional scene is used for drawing terrain data by analyzing the terrain data once and loading all the terrain data into a memory for displaying, but because the size of the memory is limited, when the terrain data is massive data, not only is a long time required for analyzing the data needed, but also the memory cannot store a large amount of analyzed data.
Therefore, how to schedule massive terrain data in a three-dimensional scene is a problem which needs to be solved at present.
Disclosure of Invention
The invention aims to provide a method, a device and equipment for dynamically scheduling terrain tile data based on a three-dimensional scene and a computer-readable storage medium.
In order to achieve the above purpose, the embodiment of the present invention provides the following technical solutions:
a terrain tile data dynamic scheduling method based on a three-dimensional scene comprises the following steps:
s1, taking a node corresponding to the top-level tile data of the tile data as a root node of a quadtree structure, and adding the root node into a list, wherein the tile data is generated after cutting the terrain data according to a quadtree mechanism;
s2, selecting a current node from the list, and judging whether the current node meets a forward traversal condition;
s3, when the current node meets the forward traversal condition, determining the minimum distance between the center point of the next layer of four-tile data of the current node and the viewpoint;
s4, judging whether the minimum distance is smaller than the reference distance of the next layer of tile data; if yes, go to S5;
and S5, performing forward traversal, taking four nodes corresponding to four pieces of tile data of the next layer of the current node as child nodes of the current node, loading the tile data corresponding to each child node, deleting the tile data of the current node, adding the four child nodes to the list to replace the current node in the list, and continuing to execute the S2.
If it is determined in S2 that the current node does not satisfy the forward traversal condition, or if it is determined in S4 that the minimum distance is not less than the reference distance of the next layer of tile data, the method for dynamically scheduling terrain tile data further includes:
s6, performing reverse traversal, and judging whether a current node has a father node; if yes, executing S7, and if not, executing S2;
s7, determining the minimum distance between the central points of the four child nodes of the father node of the current node and the viewpoint, and judging whether the minimum distance is smaller than the reference distance of the tile data of the current layer; if yes, executing S8, otherwise executing S9;
s8, judging whether the current node is loaded with the corresponding tile data; if not, executing S2 after loading the tile data of the current node; if yes, go directly to S2;
s9, judging whether the parent node of the current node is loaded with the corresponding tile data; if not, executing S10 after loading the tile data of the parent node; if yes, go directly to S10;
s10, adding the parent node of the current node into the list to replace the child nodes of the parent node in the list, and continuing to execute S2.
Wherein, the step of judging whether the current node satisfies the forward traversal condition in S2 includes:
and if the bounding box of the current node is intersected with the visual scene and the current level of the current node is greater than zero, judging that the current node meets a forward traversal condition, and otherwise, judging that the current node meets a reverse traversal condition.
Before executing S1, the method further includes:
determining the size of the tile of each layer of tile data by utilizing the level information of the tile data and the bounding box information of the terrain data;
establishing a coordinate system of tile data; the coordinate system comprises row and column coordinate values of each layer of tile data;
and determining the reference distance according to the bounding box information of the topographic data and the maximum level information.
Wherein, the determining the minimum distance between the central point of the four-tile data of the next layer of the current node and the viewpoint comprises:
determining coordinate values of four tile data of a next layer of the current node according to the coordinate system of the tile data;
determining bounding box information of each tile data of a next layer by using the coordinate value of each tile data of the next layer, the bounding box information of the terrain data and the tile size of the tile data of the next layer;
and determining the distance between the center point and the viewpoint of each piece of tile data of the next layer according to the bounding box information of each piece of tile data of the next layer, and screening out the minimum distance from the distance between the center point and the viewpoint of each piece of tile data of the next layer.
Wherein, judging whether the minimum distance is less than the reference distance of the next layer of tile data includes:
and determining the reference distance of the next layer of tile data according to the level information of the next layer of tile data and the reference distance.
A terrain tile data dynamic scheduling device based on a three-dimensional scene comprises:
the list initialization module is used for taking a node corresponding to top-level tile data of the tile data as a root node of a quadtree structure, adding the root node into a list, and cutting the terrain data according to a quadtree mechanism to generate the tile data;
the first judgment module is used for selecting a current node from the list and judging whether the current node meets a forward traversal condition;
the minimum distance determining module is used for determining the minimum distance between the center point of the next layer of four-tile data of the current node and the viewpoint when the current node meets the forward traversal condition;
the second judgment module is used for judging whether the minimum distance is smaller than the reference distance of the next layer of tile data;
and the forward traversing module is used for taking four nodes corresponding to four pieces of tile data of a next layer of the current node as child nodes of the current node when the minimum distance is smaller than the reference distance of the tile data of the next layer, loading the tile data corresponding to each child node, deleting the tile data of the current node, adding the four child nodes to the list to replace the current node in the list, and continuously triggering the first judging module.
If the first judging module judges that the current node does not satisfy the forward traversal condition, or the second judging module judges that the minimum distance is not less than the reference distance of the next layer of tile data, the device for dynamically scheduling terrain tile data further comprises a reverse traversal module, wherein the reverse traversal module comprises:
the first judging unit is used for judging whether a current node has a father node or not; if no father node exists, triggering a first judgment module;
the minimum distance determining unit is used for determining the minimum distance between the central points of four child nodes of the father node of the current node and the viewpoint when the father node exists in the current node;
a second judging unit, configured to judge whether the minimum distance is smaller than a reference distance of tile data of a current layer;
a third judging unit, configured to judge whether the current node has loaded the corresponding tile data when the minimum distance is smaller than the reference distance of the tile data of the current layer; if the first judgment module is loaded, triggering the first judgment module;
the first loading unit is used for triggering the first judgment module after the tile data of the current node is loaded when the corresponding tile data is not loaded by the current node;
a fourth judging unit, configured to judge whether a parent node of the current node has loaded corresponding tile data when the minimum distance is not less than the reference distance of the tile data of the current layer; if the loading is finished, triggering a list updating unit;
the second loading unit is used for loading the tile data of the parent node when the parent node of the current node does not load the corresponding tile data, and triggering the list updating unit;
and the list updating unit is used for adding the parent node of the current node into the list so as to replace the child nodes of the parent node in the list and trigger the first judging module.
A terrain tile data dynamic scheduling device based on a three-dimensional scene comprises:
a memory for storing a computer program;
and the processor is used for realizing the steps of the terrain tile data dynamic scheduling method when the computer program is executed.
A computer readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the above-mentioned method for dynamically scheduling terrain tile data.
According to the scheme, the method for dynamically scheduling the terrain tile data based on the three-dimensional scene, provided by the embodiment of the invention, comprises the following steps: firstly, cutting terrain data according to a quadtree mechanism to generate tile data, and storing the cut tile data in a server; the method comprises the steps of constructing a quadtree structure in real time according to the distance between a tile center point and a viewpoint, realizing scheduling and displaying of terrain tile data, and when data scheduling is carried out on the constructed quadtree, if the current tile data does not need to be displayed, only the nodes exist, the data in the nodes are released, and only the data in the nodes needing to be displayed exist, so that based on the scheduling method, the terrain data do not need to be completely analyzed to a memory, and only the data needing to be displayed can be analyzed and loaded, thereby reducing the consumption of the memory; the invention also discloses a device and equipment for dynamically scheduling terrain tile data based on the three-dimensional scene and a computer readable storage medium, and the technical effects can be realized.
Drawings
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, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flow chart of a method for dynamically scheduling terrain tile data based on a three-dimensional scene, disclosed by an embodiment of the invention;
fig. 2 is a schematic flow chart of another terrain tile data dynamic scheduling method based on a three-dimensional scene, disclosed in the embodiment of the present invention;
FIG. 3 is a schematic diagram of a tile coordinate system according to an embodiment of the present invention;
FIG. 4a is a schematic diagram of a current tile according to the disclosure of the present invention;
FIG. 4b is a schematic diagram of a tile next to the current tile according to the disclosure of the present invention;
fig. 5 is a schematic structural diagram of a device for dynamically scheduling terrain tile data based on a three-dimensional scene, disclosed in an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the invention discloses a method, a device and equipment for dynamically scheduling terrain tile data based on a three-dimensional scene and a computer readable storage medium.
Referring to fig. 1, a method for dynamically scheduling terrain tile data based on a three-dimensional scene provided by an embodiment of the present invention includes:
s1, taking a node corresponding to the top-level tile data of the tile data as a root node of a quadtree structure, and adding the root node into a list, wherein the tile data is generated after cutting the terrain data according to a quadtree mechanism;
specifically, the terrain tile data described in this embodiment is generated after the terrain tile data is cut in a quadtree manner, and only after the terrain tile data is cut into a quadtree form, the quadtree structure can be subsequently used to construct the quadtree structure of the tile data, so that the terrain tile data can be scheduled and displayed. When the current node is selected from the list, if all the tile nodes in the same level in the list are the tile nodes in the same level, sequentially selecting each tile node as the current node according to a preset sequence, if the tile nodes in different levels exist, firstly using the tile node in the same level as the current node selected last time as the current node, and selecting the current node according to the preset sequence after all the nodes in the list are in the same level.
S2, selecting a current node from the list, and judging whether the current node meets a forward traversal condition;
it should be noted that, the determining whether the current node satisfies the forward traversal condition in this scheme may specifically include: and if the bounding box of the current node is intersected with the visual scene and the current level of the current node is greater than zero, judging that the current node meets a forward traversal condition, and otherwise, judging that the current node meets a reverse traversal condition.
Specifically, the scheme judges whether the forward traversal is needed or not, and judges whether the following two conditions are met or not, wherein the first condition is that whether the current scene body is intersected with the tile nodes in the list or not; specifically, the view volume is a regular pyramid, and the principle of determining whether the view volume intersects with a tile in the tile list is implemented by determining whether the view volume intersects with a tile bounding box (cube box). And secondly, whether the hierarchy of the current node is larger than 0 or not, if an intersection exists and the hierarchy is larger than 0, performing forward traversal, and if not, performing reverse traversal.
It can be understood that the data precision is lower when the hierarchical number of the tile data is larger, and the tile data is smaller when the hierarchical number is larger; before scheduling, the tile data of the lowest precision layer needs to be initialized, so that a root node of the quadtree is constructed, and the root node is stored in a list, namely the initial current node in the list is the root node; of course, various lists may be set in the present solution to store different types of nodes, and the present solution is not limited in particular.
S3, when the current node meets the forward traversal condition, determining the minimum distance between the center point of the next layer of four-tile data of the current node and the viewpoint;
s4, judging whether the minimum distance is smaller than the reference distance of the next layer of tile data; if yes, go to S5;
and S5, performing forward traversal, taking four nodes corresponding to four pieces of tile data of the next layer of the current node as child nodes of the current node, loading the tile data corresponding to each child node, deleting the tile data of the current node, adding the four child nodes to the list to replace the current node in the list, and continuing to execute the S2.
Specifically, if the minimum distance of the current node is not less than the reference distance of the next-layer tile data, it may be determined whether there are four child nodes of the current node in the list, and if not, four child nodes are created and data is loaded, and a parent-child relationship between the current node and the four child nodes is established; if four child nodes exist but the tile data is not loaded, the data is loaded, and if the data loading fails, the next scheduling is returned.
It should be noted that in S5, four child nodes are added to the list to replace the current node in the list, i.e., after S5 is executed, the current list does not exist in the list, only four newly added child nodes exist, and when S2 is continuously executed, the current node is selected from the four child nodes in the list, and the subsequent steps are continuously executed.
Therefore, according to the terrain tile data dynamic scheduling method based on the three-dimensional scene, provided by the embodiment of the invention, terrain data is firstly cut according to a quadtree mechanism to generate tile data; the method comprises the steps of constructing a quadtree structure in real time according to the distance between a tile center point and a viewpoint, realizing scheduling and displaying of terrain tile data, and when constructing the quadtree for data scheduling, if the current tile data does not need to be displayed, only the nodes exist, the data in the nodes are released, and only the data in the nodes needing to be displayed exist.
Referring to fig. 2, a method for dynamically scheduling terrain tile data based on a three-dimensional scene provided by an embodiment of the present invention includes:
s1, taking a node corresponding to the top-level tile data of the tile data as a root node of a quadtree structure, and adding the root node into a list, wherein the tile data is generated after cutting the terrain data according to a quadtree mechanism;
before the present solution executes S1, if parameters corresponding to the tile data, such as size and accuracy of each layer of tile data, are not initialized, the tile size of each layer of tile data needs to be determined by using the level information of the tile data and the bounding box information of the terrain data; establishing a coordinate system of tile data; the coordinate system comprises row and column coordinate values of each layer of tile data; and determining the reference distance according to the bounding box information of the topographic data and the maximum level information.
Specifically, the initialization work has four important steps, namely the calculation of the tile precision and the tile size of each layer, the establishment of a tile coordinate system, the determination of a reference distance and the construction of an initialization list.
1. Calculation of per-layer tile precision and tile size
During initialization, the cut data with several layers, the bounding box information of the maximum level and the tile data precision of the maximum level can be obtained through the cut tile data. The tile precision of each layer can be calculated according to the hierarchy and the maximum hierarchy tile precision information, and the tile size of each layer can be calculated according to the hierarchy and the terrain data bounding box information.
The specific calculation method is as follows:
the maximum level of the terrain data is MaxLevel, the minimum level is 0, the data precision of the maximum level is the lowest, the precision is MaxRes (the smaller the numerical value is, the higher the precision is, and the numerical values are positive numbers), the tile data precision of the 0 layer is the highest, and the calculation formula from the 0 layer to the MaxLevel data precision is as follows:
ResLevel＝Max Re s/2MaxLevel-Level(ii) a Where Level is the hierarchy of tiles, ResLevelThe data precision of the tile of the first Level layer.
Bounding box information of terrain data: XMin (minimum value in the X direction of the topographic data), XMax (maximum value in the X direction of the topographic data), YMin (minimum value in the Y direction of the topographic data), and YMax (maximum value in the Y direction of the topographic data). When the tiles are cut, the size of the top-level MaxLevel tile is specified as follows: TileSize ═ Max (XMax-XMin, YMax-YMin), which means that tile size TileSize is the maximum length of the terrain bounding box in X and Y directions.
The tile size of each layer is: TileSizeLevel＝TileSize/2MaxLevel-LevelWherein TilesizeLevelThe tile size of the first Level.
2. Determination of tile coordinate system
A tile coordinate system, in which the upper left corner is used as an origin (this origin corresponds to (XMin, YMax) coordinates of a terrain), the number of columns increases from left to right (columns start from 0), and the number of rows increases from top to bottom (rows start from 0), as shown in fig. 3; the establishment of the tile coordinate system can definitely know the hierarchic row of the parent node, the hierarchic row of the adjacent node and the hierarchic row of the child node of each node, thereby establishing a relationship among the nodes.
3. Determination of a reference distance
The reference distance in the scheme is used for judging whether forward traversal or reverse traversal is needed currently or not by reference when forward traversal and reverse traversal are performed. The calculation of the reference distance of the fiducial is determined by the following formula:
BaseDistance＝4.5*((XMax-XMin)/2MaxLevel)。
4. construction of lists
Specifically, in this embodiment, 5 lists are created, which are respectively an initialization list InitList, a current list CurList, an update list UpdateList, a deletion list DelList, and a temporary list TemList, and these lists are also stored with a vector < GroupNode > (the GroupNode indicates a pointer of a tile node, in which geometric information and texture information of tile data and layer column row information are stored). The initialization list InitList is established when initialization is performed, the current tile data node with the lowest precision is stored in the list, initialization is completed, and the node is the root node.
Before executing the scheme, an initialization list InitList needs to be given to a current list CurList, the current list CurList is given to an update list UpdateList, and the current list CurList is given to a temporary list TemList; clearing a deletion list DelList; thus, when scheduling is performed, current data needs to be acquired from the temporary list TemList, each tile node in the temporary list TemList is traversed (including forward and backward traversal), the UpdateList is updated according to the updated node, the node needing to be deleted is added into the deleted list DelList, after the nodes in the temporary list TemList are scheduled, the UpdateList needs to be assigned to the current list CurList for exchange, the UpdateList is changed into a new current list CurList, the UpdateList is assigned to the temporary list TemList, and therefore the temporary list TemList is updated, and next scheduling is performed.
And traversing the deletion list DelList, deleting the data (the geometric information and the texture information of the tile data) in the GroupNode node in the deletion list DelList, and reserving the nodes (the nodes are part of dynamically constructing the quadtree and cannot be deleted).
S2, selecting a current node from the list, and judging whether the current node meets a forward traversal condition; if yes, executing S3, otherwise executing S6;
s3, determining the minimum distance between the center point of the next layer of four-tile data of the current node and the viewpoint;
wherein, the determining the minimum distance between the central point of the four-tile data of the next layer of the current node and the viewpoint comprises:
determining coordinate values of four tile data of a next layer of the current node according to the coordinate system of the tile data; determining bounding box information of each tile data of a next layer by using the coordinate value of each tile data of the next layer, the bounding box information of the terrain data and the tile size of the tile data of the next layer;
and determining the distance between the center point and the viewpoint of each piece of tile data of the next layer according to the bounding box information of each piece of tile data of the next layer, and screening out the minimum distance from the distance between the center point and the viewpoint of each piece of tile data of the next layer.
Specifically, in this embodiment, if the current node satisfies the forward traversal condition, the minimum distance between the center point of the bounding box of four tiles at the next layer of the current tile node and the viewpoint eye (x, y, z) is calculated. The next four tiles of the current tile can be obtained through a calculation formula, and the specific calculation mode is as follows:
assuming that the layer column rows of the current tile are CurLevel, CurCol, CulRow, respectively, the calculation formula of the four tile column rows of the next layer (CurLevel-1) and the current tile column row is:
behavior of the first tile: row 2 × CulRow, column: coll 2 × CulCol;
behavior of the second tile: row 2 × CulRow, column: 2 × CulCol + 1;
behavior of the third tile: row 2 × CulRow +1, column: coll 2 × CulCol;
behavior of the fourth tile: row 2 × CulRow +1, column: 2 × CulCol + 1;
the four tiles and the relationship to the current tile are shown in fig. 4a and 4 b.
The bounding box calculation formula for each tile (layer CurLevel-1, column Col, Row) is as follows:
TXMin＝XMin+TileSize CurLevel-1*Col，
TXMax＝XMin+TileSize CurLevel-1*(Col+1)，
TYMin＝YMax-TileSize CurLevel-1*(Row+1)，
TYMax＝YMax-TileSize CurLevel-1row, wherein TXMin, TXMax, TYMin, and TYMax are the X-direction minimum value, the X-direction maximum value, the Y-direction minimum value, and the Y-direction maximum value of the bounding box of each tile (layer: CurLevel-1, column: Col, Row), respectively, the distances between the four tiles and the viewpoint are calculated, and the minimum value MinDis is taken.
S4, judging whether the minimum distance is smaller than the reference distance of the next layer of tile data; if yes, go to S5; if not, go to S6;
wherein, judging whether the minimum distance is less than the reference distance of the next layer of tile data includes: and determining the reference distance of the next layer of tile data according to the level information of the next layer of tile data and the reference distance.
Specifically, in this scheme, the relationship between the reference distance of the next tile data and the reference distance BaseDistance is loaddistance ═ BaseDistance ×.2CurLevel-1And comparing the relationship between MinDis and LoadDis, if MinDis is smaller than LoadDis, performing forward traversal, and otherwise, performing reverse traversal.
S5, performing forward traversal, taking four nodes corresponding to four pieces of tile data of a next layer of the current node as child nodes of the current node, loading the tile data corresponding to each child node, deleting the tile data of the current node, adding the four child nodes to the list to replace the current node in the list, and continuing to execute the S2;
specifically, if the forward traversal is performed, whether four child nodes of the current node already exist is judged, if the four child nodes do not exist, a group node (the group node refers to a pointer of a tile node, and geometric information, texture information and layer column row information of tile data are stored in the pointer) node is created to load data, and a parent-child relationship (one parent and four children) is established; if four child nodes already exist but the data (the geometric information and the texture information of the tile data) is not loaded, the data is loaded, and if the data loading fails, the next scheduling is returned.
After the data of the four child nodes are loaded, whether the four current child nodes exist is searched from the update list UpdateList, and if the four current child nodes do not exist, the four current child nodes are added into the update list UpdateList. Finding from the update list UpdateList whether the current node already exists, if so, removing this node from the update list and adding it to the delete list DelList, so that when traversing the delete list, the tile data of the nodes in the delete list are deleted.
S6, performing reverse traversal, and judging whether a current node has a father node; if yes, executing S7, and if not, executing S2;
s7, determining the minimum distance between the central points of the four child nodes of the father node of the current node and the viewpoint, and judging whether the minimum distance is smaller than the reference distance of the tile data of the current layer; if yes, executing S8, otherwise executing S9;
specifically, if the parent node of the current node exists, the minimum distance minid between the bounding box center points of the four child tile nodes of the parent node of the current tile node and the viewpoint eye (x, y, z) needs to be calculated, and then the minimum distance minid is calculated. And comparing the relationship between the minimum distance MinDis and a reference distance LoadDis of the tile data of the current layer, wherein the LoadDis is BaseDistance 2CurLevel。
S8, judging whether the current node is loaded with the corresponding tile data; if not, executing S2 after loading the tile data of the current node; if yes, go directly to S2;
specifically, if it is determined that the parent node of the current node does not exist, it is determined whether tile data (geometric information and texture information of the tile data) of the current node is loaded, and if not, the tile data of the current node is loaded, so that the situation that the tile data of the node is not loaded is prevented, the accuracy of the tile data on the quadtree structure is further increased, and then the process returns.
S9, judging whether the parent node of the current node is loaded with the corresponding tile data; if not, executing S10 after loading the tile data of the parent node; if yes, go directly to S10;
similarly, if the minimum distance is smaller than the reference distance of the tile data of the current layer, whether the tile data (geometric information and texture information of the tile data) of the parent node is loaded or not is judged, and if the tile data is not loaded, the tile data of the parent node is loaded, so that the condition that the tile data of the node is not loaded is prevented, and the accurate determination of the tile data on the quadtree structure is further increased.
S10, adding the parent node of the current node into the list to replace the child nodes of the parent node in the list, and continuing to execute S2.
Specifically, if the minimum distance is smaller than the reference distance of the tile data of the current layer, it is determined whether the parent node is in the update list UpdateList, and if not, the parent node is added to the update list UpdateList; then, whether the four child nodes of the parent node of the current node are in the update list UpdateList is sequentially judged, if yes, the node is removed from the update list and added into the deletion list DelList, and it should be noted that if four child nodes of the parent node are in the update list UpdateList, the four child nodes of the four child nodes are also added into the deletion list DelList. Therefore, the terrain tile data are scheduled in real time, so that data stored by tile nodes in the memory are reduced, and dynamic display of massive terrain data in a three-dimensional scene is realized. And, since the created quad-tree is fine data at the near and coarse data at the far, the memory consumption is greatly reduced as a whole.
The embodiment provides a specific method for dynamically scheduling terrain tile data based on a three-dimensional scene, so as to explain the scheme, which specifically includes the following steps:
one, data source
Terrain data bounding box:
XMin＝70403.594，XMax＝104115.631，YMin＝62958.352，YMax＝100016.620；
maximum level of terrain tile data: 3;
maximum level tile data precision of terrain tile data: 4.
second, rule and calculation mode for initializing root node
1. Calculation of per-layer tile precision and tile size
Tile precision for layer 3: res3 ═ 4; tile size TileSize3 ═ 37058.268;
tile precision for layer 2: res2 ═ 2; tile size TileSize2 ═ 18529.134;
tile precision for layer 1: res1 ═ 1; tile size TileSize1 ═ 9264.567;
tile precision for layer 0: res0 ═ 0.5; tile size TileSize0 ═ 4632.2835;
2. determination of tile coordinate system
Tile row and column values for layer 3: row 0, column 0
Tile row and column values for layer 2: rows 0-1, columns 0-1
Tile row and column values for layer 1: rows 0-3, columns 0-3
Tile row and column values for layer 0: rows 0-7 and columns 0-7
3. Determination of a reference distance
BaseDistance＝18963.02。
4. Initialization list construction
Only the tile (labeled Level-Col-Row) 3-0-0 node in the initialization list
Third, dynamic scheduling of tile data
Assume current viewpoint coordinates of 87259.6171875, 81487.484375, 74116.53125; the distance of the far section of the viewing volume is 78234.992, the distance of the near section is 1, the angle of the viewing volume is 35 °, and the aspect ratio of the frustum is 1.8679678.
1. Scheduling for the first time:
there are 3-0-0 nodes in the current list CurList, 3-0-0 nodes in the update list UpdateList, 3-0-0 nodes in the temporary list TemList, and the delete list DelList is empty.
Traversing 3-0-0 in the TemList:
intersecting with the view volume, wherein the current level is 3 and is greater than 0, performing forward traversal, the first tile is 2-0-0, and the bounding box is:
TXmin＝70403.594，
TXMax is 88932.734, TYMin is 81487.484, TYMax is 100016.62; the distance between the center point of the bounding box and the viewpoint is 75078.109.
The second tile is 2-0-1, and the bounding box is:
TXmin＝70403.594，
TXMax is 88932.734, TYMin is 62958.352, TYMax is 81487.484; the distance between the center point of the bounding box and the viewpoint is 75078.109.
The third tile is 2-1-0, and the bounding box is:
TXmin＝88932.734，
TXMax＝107461.87,TYMin＝81487.484,TYMax＝100016.62；
the distance between the center point of the bounding box and the viewpoint is 75489.906.
The fourth tile is 2-1-1, and the bounding box is:
TXmin＝88932.734，
TXMax is 107461.87, TYMin is 62958.352, TYMax is 81487.484; the distance between the center point of the bounding box and the viewpoint is 75489.906.
Minimum MinDis 75078.109; LoadDis ═ 75852.078; MinDis < LoadDis, performing forward traversal, creating 4 child nodes, and loading data of four child nodes. Adding four child tile nodes to the update list, removing the current tile node from the update list and adding the current tile node to the delete list, and exchanging the update list and the current list, then:
the update list UpdateList comprises 2-0-0, 2-0-1, 2-1-0 and 2-1-1; the temporary list TemList comprises 2-0-0, 2-0-1, 2-1-0 and 2-1-1; the current list CurList comprises 2-0-0, 2-0-1, 2-1-0 and 2-1-1; and deleting 3-0-0 in the DelList, deleting the tile data information of 3-0-0 in the DelList, and leaving the DelList to be empty after deletion.
2. And (3) scheduling for the second time:
2.1, traversing 2-0-0 in the temporary list TemList:
intersecting with the view volume, wherein the current level is 2 and is greater than 0, performing forward traversal, the first tile is 1-0-0, and the bounding box is:
TXmin＝70403.594，
TXMax is 79668.164, TYMin is 90752.055, TYMax is 100016.62; the distance between the center point of the bounding box and the viewpoint is 76392.422;
the second tile is 1-0-1, and the bounding box is:
TXmin＝70403.594，
TXMax is 79668.164, TYMin is 81487.484, TYMax is 90752.055; the distance between the center point of the bounding box and the viewpoint is 75260.469;
the third tile is 1-1-0, and the bounding box is:
TXmin＝79668.164，
TXMax＝88932.734,TYMin＝90752.055,TYMax＝100016.62；
the distance between the center point of the bounding box and the viewpoint is 75466.148;
the fourth tile is 1-1-1, and the bounding box is:
TXmin＝79668.164，
TXMax is 88932.734, TYMin is 81487.484, TYMax is 90752.055; the distance between the center point of the bounding box and the viewpoint is 74320.086;
minimum MinDis 74320.086; LoadDis ═ 37926.039; MinDis > LoadDis, reverse traversal is carried out, a father node is judged to exist, and the distances from the central points to the viewpoints of four child node tile bounding boxes of the father node are calculated respectively as follows:
2-0-0: 75078.109, respectively; 2-0-1: 75078.109, respectively; 2-1-0: 75489.906, respectively; 2-1-1: 75489.906, min dis 75078.109, load dis 75852.078, min dis < load dis, to prevent the data of the current node from being unloaded, it needs to check whether the current node has loaded data, if not, the data is loaded and then returns.
2.2, traversing 2-0-1 in the TemList:
intersecting with the view volume, wherein the current level is 2 and is larger than 0, performing forward traversal, the first tile is 1-0-2, and the bounding box is:
TXmin＝70403.594，
TXMax is 79668.164, TYMin is 72222.914, TYMax is 81487.484; the distance between the center point of the bounding box and the viewpoint is 75260.469;
the second tile is 1-0-3, and the bounding box is:
TXmin＝70403.594，
TXMax is 79668.164, TYMin is 62958.352, TYMax is 72222.914; the distance between the center point of the bounding box and the viewpoint is 76392.422;
the third tile is 1-1-2, and the bounding box is:
TXmin＝79668.164，
TXMax＝88932.734,TYMin＝72222.914,TYMax＝81487.484；
the distance between the center point of the bounding box and the viewpoint is 74320.086;
the fourth tile is 1-1-3, and the bounding box is:
TXmin＝79668.164，
TXMax is 88932.734, TYMin is 62958.352, TYMax is 72222.914; the distance between the center point of the bounding box and the viewpoint is 75446.148;
minimum MinDis 74320.086; LoadDis ═ 37926.039; MinDis > LoadDis, reverse traversal is carried out, a father node is judged to exist, and the distances from the central points to the viewpoints of four child node tile bounding boxes of the father node are calculated respectively as follows:
2-0-0: 75078.109, respectively; 2-0-1: 75078.109, respectively; 2-1-0: 75489.906, respectively; 2-1-1: 75489.906, min dis 75078.109, load dis 75852.078, min dis < load dis, to prevent the data of the current node from being unloaded, it needs to check whether the current node has loaded data, if not, the data is loaded and then returns.
2.3, traversing 2-1-0 in the TemList:
intersecting with the view volume, wherein the current level is 2 and is larger than 0, performing forward traversal, the first tile is 1-2-0, and the bounding box is:
TXmin＝88932.734，
TXMax is 98197.297, TYMin is 90752.055, TYMax is 100016.62; the distance between the center point of the bounding box and the viewpoint is 75671.266;
the second tile is 1-2-1, and the bounding box is:
TXmin＝88932.734，
TXMax is 98197.297, TYMin is 81487.484, TYMax is 90752.055; the distance between the center point of the bounding box and the viewpoint is 74528.359;
the third tile is 1-3-0, and the bounding box is:
TXmin＝98197.297，
TXMax＝107461.87,TYMin＝90752.055,TYMax＝100016.62；
the distance between the center point of the bounding box and the viewpoint is 76998.742;
the fourth tile is 1-3-1, and the bounding box is:
TXmin＝98197.297，
TXMax＝107461.87,TYMin＝81487.484,TYMax＝90752.055；
the distance between the center point of the bounding box and the viewpoint is 75875.836;
minimum MinDis 74528.359; LoadDis ═ 37926.039; MinDis > LoadDis, reverse traversal is carried out, a father node is judged to exist, and the distances from the central points to the viewpoints of four child node tile bounding boxes of the father node are calculated respectively as follows:
2-0-0: 75078.109, respectively; 2-0-1: 75078.109, respectively; 2-1-0: 75489.906, respectively; 2-1-1: 75489.906, min dis 75078.109, load dis 75852.078, min dis < load dis, to prevent the data of the current node from being unloaded, it needs to check whether the current node has loaded data, if not, the data is loaded and then returns.
2.4, traversing 2-1-1 in the TemList:
intersecting with the view volume, wherein the current level is 2 and is larger than 0, performing forward traversal, the first tile is 1-2-2, and the bounding box is:
TXmin＝88932.734，
TXMax is 98197.297, TYMin is 72222.914, TYMax is 81487.484; the distance between the center point of the bounding box and the viewpoint is 74528.359;
the second tile is 1-2-3, and the bounding box is:
TXmin＝88932.734，
TXMax is 98197.297, TYMin is 62958.352, TYMax is 72222.914; the distance between the center point of the bounding box and the viewpoint is 75671.266;
the third tile is 1-3-2, and the bounding box is:
TXmin＝98197.297，
TXMax＝107461.87,TYMin＝72222.914,TYMax＝81487.484；
the distance between the center point of the bounding box and the viewpoint is 75875.836;
the fourth tile is 1-3-3, and the bounding box is:
TXmin＝98197.297，
TXMax＝107461.87,TYMin＝62958.352,TYMax＝72222.914；
the distance between the center point of the bounding box and the viewpoint is 76998.742;
minimum MinDis 74528.359; LoadDis ═ 37926.039; MinDis > LoadDis, reverse traversal is carried out, a father node is judged to exist, and the distances from the central points to the viewpoints of four child node tile bounding boxes of the father node are calculated respectively as follows:
2-0-0: 75078.109, respectively; 2-0-1: 75078.109, respectively; 2-1-0: 75489.906, respectively; 2-1-1: 75489.906, min dis 75078.109, load dis 75852.078, min dis < load dis, to prevent the data of the current node from being unloaded, it needs to check whether the current node has loaded data, if not, the data is loaded and then returns.
And exchanging the updated list and the current list, wherein the current list CurList comprises 2-0-0, 2-0-1, 2-1-0 and 2-1-1. The delete list DelList is empty. Since the viewpoint is not changed, the current list CurList has 2-0-0, 2-0-1, 2-1-0, 2-1-1 nodes, and so the second scheduling operation is repeated.
In the following, the dynamic scheduling apparatus for terrain tile data provided by the embodiment of the present invention is introduced, and the dynamic scheduling apparatus for terrain tile data described below and the dynamic scheduling method for terrain tile data described above may refer to each other.
Referring to fig. 5, an apparatus for dynamically scheduling terrain tile data based on a three-dimensional scene provided in an embodiment of the present invention includes:
the list initialization module 100 is configured to use a node corresponding to top-level tile data of the tile data as a root node of a quadtree structure, and add the root node into a list, where the tile data is generated by cutting terrain data according to a quadtree mechanism;
a first judging module 200, configured to select a current node from the list, and judge whether the current node meets a forward traversal condition;
the minimum distance determining module 300 is configured to determine a minimum distance between a center point and a viewpoint of four tile data in a next layer of the current node when the current node meets the forward traversal condition;
a second judging module 400, configured to judge whether the minimum distance is smaller than a reference distance of the next tile data;
and the forward traversal module 500 is configured to, when the minimum distance is smaller than the reference distance of the next-layer tile data, take four nodes corresponding to four tile data of a next layer of the current node as child nodes of the current node, load the tile data corresponding to each child node, delete the tile data of the current node, add the four child nodes to the list, replace the current node in the list, and continue to trigger the first determination module.
Based on the above technical solution, if the first determining module determines that the current node does not satisfy the forward traversal condition, or the second determining module determines that the minimum distance is not less than the reference distance of the next layer of tile data, the device for dynamically scheduling terrain tile data further includes a backward traversal module, and the backward traversal module includes:
the first judging unit is used for judging whether a current node has a father node or not; if no father node exists, triggering a first judgment module;
the minimum distance determining unit is used for determining the minimum distance between the central points of four child nodes of the father node of the current node and the viewpoint when the father node exists in the current node;
a second judging unit, configured to judge whether the minimum distance is smaller than a reference distance of tile data of a current layer;
a third judging unit, configured to judge whether the current node has loaded the corresponding tile data when the minimum distance is smaller than the reference distance of the tile data of the current layer; if the first judgment module is loaded, triggering the first judgment module;
the first loading unit is used for triggering the first judgment module after the tile data of the current node is loaded when the corresponding tile data is not loaded by the current node;
a fourth judging unit, configured to judge whether a parent node of the current node has loaded corresponding tile data when the minimum distance is not less than the reference distance of the tile data of the current layer; if the loading is finished, triggering a list updating unit;
the second loading unit is used for loading the tile data of the parent node when the parent node of the current node does not load the corresponding tile data, and triggering the list updating unit;
and the list updating unit is used for adding the parent node of the current node into the list so as to replace the child nodes of the parent node in the list and trigger the first judging module.
The terrain tile data dynamic scheduling device based on the three-dimensional scene comprises a memory and a processor, wherein the memory comprises:
a memory for storing a computer program;
a processor for implementing the steps of the method for dynamically scheduling terrain tile data according to the above embodiments when executing the computer program.
Similarly, the embodiment of the present invention also provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the method for dynamically scheduling terrain tile data according to the embodiment.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (8)
1. A terrain tile data dynamic scheduling method based on a three-dimensional scene is characterized by comprising the following steps:
s1, taking a node corresponding to the top-level tile data of the tile data as a root node of a quadtree structure, and adding the root node into a list, wherein the tile data is generated after cutting the terrain data according to a quadtree mechanism;
s2, selecting a current node from the list, and judging whether the current node meets a forward traversal condition;
s3, when the current node meets the forward traversal condition, determining the minimum distance between the center point of the next layer of four-tile data of the current node and the viewpoint;
s4, judging whether the minimum distance is smaller than the reference distance of the next layer of tile data; if yes, go to S5;
s5, performing forward traversal, taking four nodes corresponding to four pieces of tile data of a next layer of the current node as child nodes of the current node, loading the tile data corresponding to each child node, deleting the tile data of the current node, adding the four child nodes to the list to replace the current node in the list, and continuing to execute the S2;
if it is determined in S2 that the current node does not satisfy the forward traversal condition, or if it is determined in S4 that the minimum distance is not less than the reference distance of the next layer of tile data, the method for dynamically scheduling terrain tile data further includes:
s6, performing reverse traversal, and judging whether a current node has a father node; if yes, executing S7, and if not, executing S2;
s7, determining the minimum distance between the central points of the four child nodes of the father node of the current node and the viewpoint, and judging whether the minimum distance is smaller than the reference distance of the tile data of the current layer; if yes, executing S8, otherwise executing S9;
s8, judging whether the current node is loaded with the corresponding tile data; if not, executing S2 after loading the tile data of the current node; if yes, go directly to S2;
s9, judging whether the parent node of the current node is loaded with the corresponding tile data; if not, executing S10 after loading the tile data of the parent node; if yes, go directly to S10;
s10, adding the parent node of the current node into the list to replace the child nodes of the parent node in the list, and continuing to execute S2.
2. The method for dynamically scheduling terrain tile data according to claim 1, wherein the determining whether the current node satisfies the forward traversal condition in S2 includes:
and if the bounding box of the current node is intersected with the visual scene and the current level of the current node is greater than zero, judging that the current node meets a forward traversal condition, and otherwise, judging that the current node meets a reverse traversal condition.
3. The method for dynamically scheduling terrain tile data according to claim 1 or 2, wherein before executing S1, the method further comprises:
determining the size of the tile of each layer of tile data by utilizing the level information of the tile data and the bounding box information of the terrain data;
establishing a coordinate system of tile data; the coordinate system comprises row and column coordinate values of each layer of tile data;
and determining the reference distance according to the bounding box information of the topographic data and the maximum level information.
4. The method for dynamically scheduling terrain tile data according to claim 3, wherein the determining the minimum distance between the center point and the viewpoint of the next layer of four tile data of the current node comprises:
determining coordinate values of four tile data of a next layer of the current node according to the coordinate system of the tile data;
determining bounding box information of each tile data of a next layer by using the coordinate value of each tile data of the next layer, the bounding box information of the terrain data and the tile size of the tile data of the next layer;
and determining the distance between the center point and the viewpoint of each piece of tile data of the next layer according to the bounding box information of each piece of tile data of the next layer, and screening out the minimum distance from the distance between the center point and the viewpoint of each piece of tile data of the next layer.
5. The method of claim 3, wherein determining whether the minimum distance is less than a reference distance of the next layer of tile data comprises:
and determining the reference distance of the next layer of tile data according to the level information of the next layer of tile data and the reference distance.
6. A terrain tile data dynamic scheduling device based on a three-dimensional scene is characterized by comprising:
the list initialization module is used for taking a node corresponding to top-level tile data of the tile data as a root node of a quadtree structure, adding the root node into a list, and cutting the terrain data according to a quadtree mechanism to generate the tile data;
the first judgment module is used for selecting a current node from the list and judging whether the current node meets a forward traversal condition;
the minimum distance determining module is used for determining the minimum distance between the center point of the next layer of four-tile data of the current node and the viewpoint when the current node meets the forward traversal condition;
the second judgment module is used for judging whether the minimum distance is smaller than the reference distance of the next layer of tile data;
the forward traversing module is used for taking four nodes corresponding to four tile data of a next layer of the current node as child nodes of the current node when the minimum distance is smaller than the reference distance of the tile data of the next layer, loading the tile data corresponding to each child node, deleting the tile data of the current node, adding the four child nodes to the list to replace the current node in the list, and continuously triggering the first judging module;
if the first judging module judges that the current node does not satisfy the forward traversal condition, or the second judging module judges that the minimum distance is not less than the reference distance of the next layer of tile data, the device for dynamically scheduling terrain tile data further comprises a reverse traversal module, wherein the reverse traversal module comprises:
the first judging unit is used for judging whether a current node has a father node or not; if no father node exists, triggering a first judgment module;
the minimum distance determining unit is used for determining the minimum distance between the central points of four child nodes of the father node of the current node and the viewpoint when the father node exists in the current node;
a second judging unit, configured to judge whether the minimum distance is smaller than a reference distance of tile data of a current layer;
a third judging unit, configured to judge whether the current node has loaded the corresponding tile data when the minimum distance is smaller than the reference distance of the tile data of the current layer; if the first judgment module is loaded, triggering the first judgment module;
the first loading unit is used for triggering the first judgment module after the tile data of the current node is loaded when the corresponding tile data is not loaded by the current node;
a fourth judging unit, configured to judge whether a parent node of the current node has loaded corresponding tile data when the minimum distance is not less than the reference distance of the tile data of the current layer; if the loading is finished, triggering a list updating unit;
the second loading unit is used for loading the tile data of the parent node when the parent node of the current node does not load the corresponding tile data, and triggering the list updating unit;
and the list updating unit is used for adding the parent node of the current node into the list so as to replace the child nodes of the parent node in the list and trigger the first judging module.
7. A terrain tile data dynamic scheduling device based on a three-dimensional scene is characterized by comprising:
a memory for storing a computer program;
a processor for implementing the steps of the method for dynamic scheduling of terrain tile data according to any of claims 1 to 5 when executing the computer program.
8. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method for dynamic scheduling of terrain tile data according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711013323.4A CN107730583B (en) | 2017-10-26 | 2017-10-26 | Three-dimensional scene-based terrain tile data dynamic scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711013323.4A CN107730583B (en) | 2017-10-26 | 2017-10-26 | Three-dimensional scene-based terrain tile data dynamic scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107730583A CN107730583A (en) | 2018-02-23 |
| CN107730583B true CN107730583B (en) | 2021-02-26 |
Family
ID=61212818
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711013323.4A Active CN107730583B (en) | 2017-10-26 | 2017-10-26 | Three-dimensional scene-based terrain tile data dynamic scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107730583B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108363808B (en) * | 2018-03-07 | 2020-08-11 | 浙江科澜信息技术有限公司 | Method, device, equipment and storage medium for dynamically scheduling and displaying mass data |
| CN109584366B (en) * | 2018-12-10 | 2023-05-16 | 浙江科澜信息技术有限公司 | Terrain rendering method, device, equipment and readable storage medium |
| CN110647541A (en) * | 2019-09-26 | 2020-01-03 | 武汉市珞珈俊德地信科技有限公司 | Efficient adaptive three-dimensional model tile production method |
| CN111105492B (en) * | 2019-12-18 | 2020-11-17 | 四川大学 | Rapid scheduling method for tile elevation data in terrain smoothing process |
| CN113506378B (en) * | 2021-07-29 | 2023-03-17 | 和舆图（北京）科技有限公司 | Method for dynamically loading three-dimensional model on MR (magnetic resonance) equipment |
| CN117237543B (en) * | 2023-11-10 | 2024-02-20 | 中科星图智慧科技安徽有限公司 | Front-end Web multi-source heterogeneous three-dimensional model and three-dimensional terrain fusion method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102117288A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | Method and device used for searching modeling data in three-dimensional modeling |
| CN102117500A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | Three-dimensional modeling method and system |
| US20140324914A1 (en) * | 2011-11-25 | 2014-10-30 | Thomson Licensing | Position coding based on spatial tree with duplicate points |
| CN106204719A (en) * | 2016-06-30 | 2016-12-07 | 西安电子科技大学 | Magnanimity model real-time scheduling method in three-dimensional scenic based on two-dimensional neighbourhood retrieval |
| CN106600684A (en) * | 2016-11-29 | 2017-04-26 | 浙江科澜信息技术有限公司 | Oblique model organization construction method |
-
2017
- 2017-10-26 CN CN201711013323.4A patent/CN107730583B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102117288A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | Method and device used for searching modeling data in three-dimensional modeling |
| CN102117500A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | Three-dimensional modeling method and system |
| US20140324914A1 (en) * | 2011-11-25 | 2014-10-30 | Thomson Licensing | Position coding based on spatial tree with duplicate points |
| CN106204719A (en) * | 2016-06-30 | 2016-12-07 | 西安电子科技大学 | Magnanimity model real-time scheduling method in three-dimensional scenic based on two-dimensional neighbourhood retrieval |
| CN106600684A (en) * | 2016-11-29 | 2017-04-26 | 浙江科澜信息技术有限公司 | Oblique model organization construction method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107730583A (en) | 2018-02-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107730583B (en) | Three-dimensional scene-based terrain tile data dynamic scheduling method and device | |
| CN108470374B (en) | Mass point cloud data processing method and device | |
| CN110443893B (en) | Large-scale building scene rendering acceleration method, system, device and storage medium | |
| US10504253B2 (en) | Conservative cell and portal graph generation | |
| CN106683167A (en) | Automatic modeling approach for high precision model of complex building | |
| JP2021520579A (en) | Object loading methods and devices, storage media, electronic devices, and computer programs | |
| CN108211354A (en) | The generation method and device of virtual resource in 3D scene of game | |
| CN103970518B (en) | A kind of the 3D rendering method and device of window logic | |
| CN104504760B (en) | The method and system of real-time update 3-D view | |
| CN110276820B (en) | GIS model optimization method and system based on LOD organization and scheduling method | |
| CN106296779A (en) | A kind of threedimensional model rendering indication method and system | |
| CN105389850A (en) | Novel visibility generation method for large-scale three-dimensional scene | |
| CN107918957A (en) | A kind of three-dimensional building model simplifying method of holding structure and textural characteristics | |
| WO2015093073A1 (en) | Simulation device | |
| KR102096196B1 (en) | How to configure model objects, servers, and systems | |
| US9454554B1 (en) | View dependent query of multi-resolution clustered 3D dataset | |
| CN114596423A (en) | Model rendering method and device based on virtual scene gridding and computer equipment | |
| CN103631261A (en) | Information processing method and apparatus | |
| CN109064546A (en) | A kind of landform image data fast dispatch method and its system | |
| CN109827585B (en) | Method for rapidly filling concave area in grid map | |
| CN114419256B (en) | Urban level BIM data light weight method and system based on multistage shell extraction algorithm | |
| CN114863040A (en) | LOD tree construction method and device for texture-dense three-dimensional scene and electronic equipment | |
| CN113656514A (en) | Visualization method and device for three-dimensional model of mine | |
| JP2003271988A (en) | Image forming device and program | |
| CN111161416B (en) | Method and system for accurately adjusting model display priority according to model shape information |
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 |