CN107730583A - A kind of terrain tile data dynamic dispatching method and device based on three-dimensional scenic - Google Patents
A kind of terrain tile data dynamic dispatching method and device based on three-dimensional scenic Download PDFInfo
- Publication number
- CN107730583A CN107730583A CN201711013323.4A CN201711013323A CN107730583A CN 107730583 A CN107730583 A CN 107730583A CN 201711013323 A CN201711013323 A CN 201711013323A CN 107730583 A CN107730583 A CN 107730583A
- Authority
- CN
- China
- Prior art keywords
- tile data
- node
- tile
- data
- present 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.)
- Granted
Links
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 kind of terrain tile data dynamic dispatching method based on three-dimensional scenic, including：Terrain data is cut according to quaternary tree mechanism first, generates tile data, the tile data storage after cutting is in the server；Quad-tree structure is built according to the distance of tile central point and viewpoint in real time, realize the scheduling and display to landform tile data, and when building the scheduling of quaternary tree progress data, if current tile data need not be shown, it is existing so there was only node, data in node are released, only the data inside the node of display in need are existing, so dispatching method described in this programme, terrain data need not be parsed all to internal memory, only the data of display in need just can be resolved and load, so as to reduce the consumption to internal memory；The invention also discloses a kind of terrain tile data dynamic scheduler, equipment and computer-readable recording medium based on three-dimensional scenic, above-mentioned technique effect can be equally realized.
Description
Technical field
The present invention relates to terrain data dispatching technique field, more specifically to a kind of landform based on three-dimensional scenic
Tile data dynamic dispatching method, device, equipment and computer-readable recording medium.
Background technology
At present, drafting of traditional three-dimensional scenic to terrain data is by finishing, inciting somebody to action to the disposable parsing of terrain data
All terrain datas are loaded into internal memory and shown, but because memory size is limited, therefore, when terrain data is magnanimity number
According to when, not only need to take a long time when parsing data, and the mass data that internal memory can not be after storing and resolving.
Therefore, how massive terrain data to be scheduled in three-dimensional scenic, the problem of being current urgent need to resolve.
The content of the invention
It is an object of the invention to provide a kind of terrain tile data dynamic dispatching method based on three-dimensional scenic, device,
Equipment and computer-readable recording medium.
To achieve the above object, the embodiments of the invention provide following technical scheme：
A kind of terrain tile data dynamic dispatching method based on three-dimensional scenic, including：
S1, the root node using the node corresponding to the top layer tile data of tile data as quad-tree structure, by root section
Point adds list, and the tile data generates after being cut according to quaternary tree mechanism to terrain data；
S2, present node is chosen from list, judge whether present node meets positive ergodic condition；
S3, when present node meets positive ergodic condition, determine that next layer four of present node is opened in tile data
The minimum range of heart point and viewpoint；
S4, judge whether minimum range is less than the reference distance of next layer of tile data；If so, then perform S5；
S5, carry out positive traversal, using four nodes corresponding to next layer of present node of four tile datas as
The child nodes of present node, load each child nodes corresponding to tile data, delete the tile data of present node, and will
Four child nodes are added to list, to replace the present node in list, and continue executing with the S2.
Wherein, if judging in S2, present node is unsatisfactory for positive ergodic condition, or, judge that minimum range is not less than in S4
The reference distance of next layer of tile data, then the terrain tile data dynamic dispatching method also include：
S6, reversely traveled through, judge that present node whether there is father node；If in the presence of, if performing S7, being not present,
Then perform S2；
S7, determine present node father node the central point of four child nodes and the minimum range of viewpoint, judge most
Whether small distance is less than the reference distance of current layer tile data；If so, S8 is then performed, if it is not, then performing S9；
S8, judge whether present node has loaded corresponding tile data；If it is not, then load the tile data of present node
Afterwards, S2 is performed；If so, then directly perform S2；
S9, judge whether father's node of present node has loaded corresponding tile data；If it is not, then load father's node
Tile data after, perform S10；If so, then directly perform S10；
S10, father's node of present node added into list, to replace the child nodes of father's node in list, and after
It is continuous to perform S2.
Wherein, judge whether present node meets positive ergodic condition in S2, including：
If the bounding box of present node is handed over what comes into a driver's body phase, and the current level of present node is more than zero, then judges current
Node meets positive ergodic condition, otherwise, it is determined that present node meets reverse ergodic condition.
Wherein, before performing S1, in addition to：
Using the hierarchical information of tile data and the bounding box information of terrain data, determine that the tile of every layer of tile data is big
It is small；
Establish the coordinate system of tile data；The coordinate system includes the ranks coordinate value of every layer of tile data；
Reference distance is determined according to the bounding box information of terrain data and maximum hierarchical information.
Wherein, the next layer four for determining present node opens the minimum range of the central point and viewpoint of tile data, bag
Include：
According to the coordinate system of the tile data, determine that next layer four of present node opens the coordinate value of tile data；
Utilize the coordinate value of next every tile data of layer, the bounding box information of terrain data and next layer of tile data
Tile size, determine the bounding box information of next every tile data of layer；
Determine the central point of next every tile data of layer with regarding according to the bounding box information of next every tile data of layer
The distance of point, minimum range is filtered out from the distance of the central point of next every tile data of layer and viewpoint.
Wherein, judge whether minimum range is less than the reference distance of next layer of tile data, including：
According to the hierarchical information and reference distance of next layer of tile data, determine that the benchmark of next layer of tile data is joined
Examine distance.
A kind of terrain tile data dynamic scheduler based on three-dimensional scenic, including：
List initialization module, for the node corresponding to the top layer tile data using tile data as quad-tree structure
Root node, root node is added into list, the tile data is raw after being cut according to quaternary tree mechanism to terrain data
Into；
First judge module, for choosing present node from list, judge whether present node meets positive traversal bar
Part；
Minimum range determining module, for when present node meets positive ergodic condition, determining the next of present node
The central point of four tile data of layer and the minimum range of viewpoint；
Second judge module, for judging whether minimum range is less than the reference distance of next layer of tile data；
Positive spider module, for minimum range be less than the reference of next layer of tile data apart from when, prosthomere will be worked as
Child nodes of four nodes as present node corresponding to next layer of four tile datas of point, load each child's section
Tile data corresponding to point, deletes the tile data of present node, and four child nodes are added into list, to replace list
In present node, and continue to trigger first judge module.
Wherein, if first judge module judges that present node is unsatisfactory for positive ergodic condition, or, described second sentences
Disconnected module judges reference distance of the minimum range not less than next layer of tile data, then the terrain tile data dynamic is adjusted
Degree device also includes reverse spider module, and the reversely spider module includes：
First judging unit, for judging that present node whether there is father node；If father node is not present, first is triggered
Judge module；
Minimum range determining unit, when father node be present for present node, determine four of the father node of present node
The central point of child nodes and the minimum range of viewpoint；
Second judging unit, for judging whether minimum range is less than the reference distance of current layer tile data；
3rd judging unit, for minimum range be less than the reference of current layer tile data apart from when, judge current
Whether node has loaded corresponding tile data；If having loaded, first judge module is triggered；
First loading unit, when there is no tile data corresponding to loading for present node, load the tile of present node
After data, and trigger first judge module；
4th judging unit, for minimum range not less than current layer tile data reference apart from when, judge work as
Whether father's node of front nodal point has loaded corresponding tile data；If having loaded, trigger list updating block；
Second loading unit, father's node for present node during tile data, load father not corresponding to loading
The tile data of node, and trigger list updating block；
List update unit, for father's node of present node to be added into list, to replace father's node in list
Child nodes, and trigger the first judge module.
A kind of terrain tile data dynamic dispatching equipment based on three-dimensional scenic, including：
Memory, for storing computer program；
Processor, the step of above-mentioned terrain tile data dynamic dispatching method is realized during for performing the computer program
Suddenly.
A kind of computer-readable recording medium, computer program is stored with the computer-readable recording medium, it is described
The step of above-mentioned terrain tile data dynamic dispatching method is realized when computer program is executed by processor.
By above scheme, a kind of terrain tile data dynamic based on three-dimensional scenic provided in an embodiment of the present invention
Dispatching method, including：Terrain data is cut according to quaternary tree mechanism first, generates tile data, the tile after cutting
Data storage is in the server；Quad-tree structure is built according to the distance of tile central point and viewpoint in real time, realized to landform watt
The scheduling and display of sheet data, and when building the scheduling of quaternary tree progress data, if current tile data need not show
Show, then only node is existing, and the data in node are released, only the data inside the node of display in need
It is existing, so based on the dispatching method described in this programme, terrain data need not be parsed all to internal memory, only in need aobvious
The data shown just can be resolved and load, so as to reduce the consumption to internal memory；The invention also discloses one kind to be based on three dimensional field
Terrain tile data dynamic scheduler, equipment and the computer-readable recording medium of scape, can equally realize above-mentioned technique effect.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is a kind of terrain tile data dynamic dispatching method flow based on three-dimensional scenic disclosed in the embodiment of the present invention
Schematic diagram；
Fig. 2 is terrain tile data dynamic dispatching method stream of the another kind disclosed in the embodiment of the present invention based on three-dimensional scenic
Journey schematic diagram；
Fig. 3 is tile coordinate system schematic diagram disclosed in the embodiment of the present invention；
Fig. 4 a are current tile schematic diagram disclosed in the embodiment of the present invention；
Fig. 4 b are the schematic diagram of next layer of tile of current tile disclosed in the embodiment of the present invention；
Fig. 5 is a kind of terrain tile data dynamic scheduler structure based on three-dimensional scenic disclosed in the embodiment of the present invention
Schematic diagram.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, rather than whole embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other under the premise of creative work is not made
Embodiment, belong to the scope of protection of the invention.
The embodiment of the invention discloses a kind of terrain tile data dynamic dispatching method based on three-dimensional scenic, device, set
Standby and computer-readable recording medium.
Referring to Fig. 1, a kind of terrain tile data dynamic dispatching method based on three-dimensional scenic provided in an embodiment of the present invention,
Including：
S1, the root node using the node corresponding to the top layer tile data of tile data as quad-tree structure, by root section
Point adds list, and the tile data generates after being cut according to quaternary tree mechanism to terrain data；
Specifically, the terrain tile data described in the present embodiment are to be generated after being cut by quaternary tree mode to terrain data
, quaternary tree form is only cut into, subsequently can just utilize the quad-tree structure of quad-tree structure structure tile data, so as to
Realize the scheduling and display to landform tile data.The node of list storage in this programme is the node for being currently needed for scheduling,
The node is the present node described in subsequent schedule, when present node is selected from list, if all in list
The tile node of same level, then each tile node is selected successively according to predefined procedure as present node, if existing different
The tile node of level, then first using the tile node of the present node same level selected with last time as present node, directly
To after node is entirely located in same level present in list, present node is selected further according to predefined procedure.
S2, present node is chosen from list, judge whether present node meets positive ergodic condition；
It should be noted that this programme judges whether present node meets positive ergodic condition, can specifically include：If work as
The bounding box of front nodal point is handed over what comes into a driver's body phase, and the current level of present node is more than zero, then it is positive to judge that present node meets
Ergodic condition, otherwise, it is determined that present node meets reverse ergodic condition.
Specifically, it is necessary to judge whether to meet following two conditions when this programme judges whether to need positive travel through, when
Whether current what comes into a driver's body with the tile node in list has common factor；Specifically, what comes into a driver's body is a regular centrum, judges to regard
It is by judging what comes into a driver's body and tile bounding box (cuboid box) that whether scape body intersects its principle with the tile in tile list
Whether intersect what is realized.Second, whether the level of present node is more than 0, if common factor and level are more than 0, then proceed by just
To traversal, otherwise reversely traveled through.
It is understood that the number of levels of tile data more big data precision is lower, number of levels more crankshaft bearing sheet data is more
It is small；This programme is before being scheduled, it is necessary to the tile data of lowest accuracy layer be initialized, so as to build the root section of quaternary tree
Point, and root node is stored to list, that is to say, that the initial present node in list is root node；Certainly, in this programme
In a variety of lists can be equally set, to store the node of different types, this programme does not limit specifically.
S3, when present node meets positive ergodic condition, determine that next layer four of present node is opened in tile data
The minimum range of heart point and viewpoint；
S4, judge whether minimum range is less than the reference distance of next layer of tile data；If so, then perform S5；
S5, carry out positive traversal, using four nodes corresponding to next layer of present node of four tile datas as
The child nodes of present node, load each child nodes corresponding to tile data, delete the tile data of present node, and will
Four child nodes are added to list, to replace the present node in list, and continue executing with the S2.
Specifically, if the minimum range of present node is not less than the reference distance of next layer of tile data, at this moment
Four child nodes that whether there is present node in list are may determine that, if it does not exist, then creating four child nodes simultaneously
Data are loaded, and establish the set membership of present node and four child nodes；If four child nodes are existing, but watt
Sheet data does not load, then loads data, comes back for dispatching next time if data failure is loaded.
It should be noted that four child nodes are added to list in S5, to replace the present node in list, i.e.,
Represent after performing S5, the current list is not present in list, only exists four child nodes newly added, when continuing executing with S2,
Present node can be selected from four child nodes in list, and continue executing with subsequent step.
It can be seen that a kind of terrain tile data dynamic dispatching method based on three-dimensional scenic provided in an embodiment of the present invention, first
First terrain data is cut according to quaternary tree mechanism, generates tile data；It is real according to the distance of tile central point and viewpoint
When build quad-tree structure, realize scheduling and display to landform tile data, and the tune of data is carried out in structure quaternary tree
When spending, if current tile data need not be shown, then only node is existing, and the data in node are to be released
, only the data inside the node of display in need are existing, so based on the dispatching method described in this programme, terrain data
Need not all it parse to internal memory, only the data of display in need just can be resolved and load, and internal memory is disappeared so as to reduce
Consumption.
Referring to Fig. 2, a kind of terrain tile data dynamic dispatching method based on three-dimensional scenic provided in an embodiment of the present invention,
Including：
S1, the root node using the node corresponding to the top layer tile data of tile data as quad-tree structure, by root section
Point adds list, and the tile data generates after being cut according to quaternary tree mechanism to terrain data；
It should be noted that before this programme performs S1, if parameter corresponding to tile data is not initialized, such as
The information such as the size and accuracy of each layer tile data, then need the encirclement of the hierarchical information and terrain data using tile data
Box information, determine the tile size of every layer of tile data；Establish the coordinate system of tile data；The coordinate system includes every layer of tile
The ranks coordinate value of data；Reference distance is determined according to the bounding box information of terrain data and maximum hierarchical information.
Specifically, initial work has four important steps, first is the calculating of each layer of tile precision and tile size,
Second is the establishment of tile coordinate system, and the 3rd is a reference determination of distance, and the 4th is the structure of initialization list.
1st, the calculating of each layer of tile precision and tile size
During initialization, it is several layers of can to learn that the data of cutting share by the tile data of well cutting first, it is maximum
The bounding box information of level and the tile data precision of maximum level.It can be calculated according to level and maximum level tile precision information
Go out each layer of tile precision, each layer of tile size can be calculated according to level and terrain data bounding box information.
Specific calculation is as follows：
The maximum level of terrain data is MaxLevel, and minimum level 0, the data precision of maximum level is minimum, precision
For MaxRes (the smaller precision of numerical value is higher, and is all positive number), 0 layer of tile data precision highest, from 0 layer to MaxLevel layers
The calculation formula of data precision is：
ResLevel=Max Re s/2MaxLevel-Level；Wherein Level be tile level, ResLevelFor Level layers
The data precision of tile.
The bounding box information of terrain data：XMin (minimum value of terrain data X-direction), XMax be (terrain data X-direction
Maximum), YMin (minimum value of terrain data Y-direction), YMax (maximum of terrain data Y-direction).When tile is cut, rule
The tile size for determining top MaxLevel is：TileSize=Max (XMax-XMin, YMax-YMin), this formula refer to watt
Piece size TileSize is the maximum length of landform bounding box X-direction and Y-direction.
Each layer of tile size is：TileSizeLevel=TileSize/2MaxLevel-Level, wherein TileSizeLevel
For the tile size of Level layers.
2nd, the establishment of tile coordinate system
Tile coordinate system, using the upper left corner as origin (this origin corresponds to (XMin, YMax) coordinate of landform), from left to right arrange
Number increases (arranging since 0) successively, and line number increases (row is since 0) successively from top to bottom, specific as shown in Figure 3；This programme watt
The foundation of piece coordinate system, can clearly know the stratose row of father's node of each node, the stratose row of adjacent node, and
The stratose row of child nodes, so as to establish a relation between node.
3rd, reference determination of distance
Reference distance in this programme is to have individual reference when carrying out positive traversal and reversely traversal
Judge currently whether need positive traversal or reversely traversal.The calculating of reference distance is determined with below equation：
BaseDistance=4.5* ((XMax-XMin)/2MaxLevel)。
4th, the structure of list
Specifically, in the present embodiment, 5 lists are established, are beginningization list InitList, the current list CurList respectively,
List UpdateList, delete list DelList, temporary table TemList are updated, these lists are also with a vector<
GroupNode*>(GroupNode* refers to the pointer of tile node, and the inside stores the geological information and line of tile data for storage
Manage information and stratose row information).Beginningization list InitList is just establishes during initialization, by the tile of current lowest accuracy
Back end is stored into this list, completes initial work, the node is root node.
, it is necessary to give initialization list InitList to the current list CurList, the current list before this programme is performed
CurList is assigned to update list UpdateList, and the current list CurList is assigned to temporary table TemList；Empty deletion row
Table DelList；, it is necessary to obtain current data from temporary table TemList so when being scheduled, and travel through (comprising forward direction
With reverse traversal) each tile node in temporary table TemList, and according to the node updates UpdateList of renewal,
The node deleted will be needed to add delete list DelList, after the node scheduling in temporary table TemList is complete, it is necessary to
Renewal list UpdateList is assigned into the current list CurList to exchange, renewal list UpdateList is changed into new and works as
Preceding list CurList, renewal list UpdateList is assigned to temporary table TemList, so as to update temporary table
TemList, and carry out the scheduling of next step.
Delete list DelList is traveled through, by the data (tile in the GroupNode* nodes in delete list DelList
The geological information and texture information of data) delete, node retain in itself (node be dynamic construction quaternary tree a part, it is impossible to
It is deleted).
S2, present node is chosen from list, judge whether present node meets positive ergodic condition；If satisfied, then hold
Row S3, if not satisfied, then performing S6；
S3, determine that next layer four of present node opens the central point of tile data and the minimum range of viewpoint；
Wherein, the next layer four for determining present node opens the minimum range of the central point and viewpoint of tile data, bag
Include：
According to the coordinate system of the tile data, determine that next layer four of present node opens the coordinate value of tile data；Profit
Tile with the coordinate value of next every tile data of layer, the bounding box information of terrain data and next layer of tile data is big
It is small, determine the bounding box information of next every tile data of layer；
Determine the central point of next every tile data of layer with regarding according to the bounding box information of next every tile data of layer
The distance of point, minimum range is filtered out from the distance of the central point of next every tile data of layer and viewpoint.
Specifically, in the present embodiment, if present node meets positive ergodic condition, it is next to calculate current tile node
The minimum range of four tile bounding box central point of layer and viewpoint eye (x, y, z).Next layer four of current tile opens tile can be with
Obtained by calculation formula, specific calculation is as follows：
Assuming that the stratose row of current tile is respectively CurLevel, CurCol, CulRow, then next layer (CurLevel-1)
Four columns of tiles rows and current tile row row calculation formula be：
The behavior of first tile：Row=2*CulRow, it is classified as：Col=2*CulCol；
The behavior of second tile：Row=2*CulRow, it is classified as：Col=2*CulCol+1；
The behavior of 3rd tile：Row=2*CulRow+1, it is classified as：Col=2*CulCol；
The behavior of 4th tile：Row=2*CulRow+1, it is classified as：Col=2*CulCol+1；
Four tiles and with the graph of a relation of current tile as shown in Fig. 4 a and Fig. 4 b.
It is as follows for the bounding box calculation formula of each tile (layer CurLevel-1, be classified as Col, behavior Row)：
TXMin=XMin+TileSizeCurLevel-1* Col,
TXMax=XMin+TileSizeCurLevel-1* (Col+1),
TYMin=YMax-TileSizeCurLevel-1* (Row+1),
TYMax=YMax-TileSizeCurLevel-1* Row, wherein TXMin, TXMax, TYMin, TYMax are respectively every
X-direction minimum value, X-direction maximum, the Y-direction of one tile (layer CurLevel-1, be classified as Col, behavior Row) bounding box
Minimum value, Y-direction maximum, the distance of four tiles and viewpoint is calculated respectively, takes minimum M inDis therein.
S4, judge whether minimum range is less than the reference distance of next layer of tile data；If so, then perform S5；If
It is no, then perform S6；
Wherein, judge whether minimum range is less than the reference distance of next layer of tile data, including：According to next layer
The hierarchical information and reference distance of tile data, determine the reference distance of next layer of tile data.
Specifically, the reference distance of next layer of tile data in this programme is LoadDis and reference distance
BaseDistance relation is LoadDis=BaseDistance*2CurLevel-1, compare MinDis and LoadDis relation,
If MinDis is less than LoadDis, positive traversal is carried out, is otherwise reversely traveled through.
S5, carry out positive traversal, using four nodes corresponding to next layer of present node of four tile datas as
The child nodes of present node, load each child nodes corresponding to tile data, delete the tile data of present node, and will
Four child nodes are added to list, to replace the present node in list, and continue executing with the S2；
If specifically, carrying out positive traversal, judge whether four child nodes of present node have been present, if not
In the presence of then creating GroupNode*, (GroupNode* refers to the pointer of tile node, and the inside stores the geometry letter of tile data
Breath and texture information and stratose row information) node loading data, and establish set membership (father, four children)；Such as
Four child nodes of fruit are existing, but data (geological information and texture information of tile data) do not load, then load data,
Come back for dispatching next time if data failure is loaded.
After the data for loading four child nodes, whether current four child nodes are searched from renewal list UpdateList
It is existing, if it does not exist, then being added in renewal list UpdateList.Searched from renewal list UpdateList and work as prosthomere
Whether point is existing, if existing, remove this node from renewal list and adds it in delete list DelList,
During to travel through delete list, the tile data of the node in delete list is deleted.
S6, reversely traveled through, judge that present node whether there is father node；If in the presence of, if performing S7, being not present,
Then perform S2；
S7, determine present node father node the central point of four child nodes and the minimum range of viewpoint, judge most
Whether small distance is less than the reference distance of current layer tile data；If so, S8 is then performed, if it is not, then performing S9；
Specifically, if father's node of present node is present, need to calculate four of current tile node parent node
The bounding box central point of child's tile node and viewpoint eye (x, y, z) minimum range MinDis, turn.And compare minimum range
The reference distance LoadDis of MinDis and current layer tile data relation, wherein, LoadDis=BaseDistance*
2CurLevel。
S8, judge whether present node has loaded corresponding tile data；If it is not, then load the tile data of present node
Afterwards, S2 is performed；If so, then directly perform S2；
Specifically, if it is determined that father's node of present node is not present, then tile data (the tile of present node is judged
The geological information and texture information of data) whether load, loaded if not loading, prevent the tile number of node
According to situation about not being loaded, further increase the accurate of tile data in quad-tree structure and determine, be then back to.
S9, judge whether father's node of present node has loaded corresponding tile data；If it is not, then load father's node
Tile data after, perform S10；If so, then directly perform S10；
Likewise, if minimum range is less than the reference distance of current layer tile data, watt of father's node is judged
Whether sheet data (geological information and texture information of tile data) has loaded, and is loaded, prevented if not loading
The situation that the tile data of node is not loaded, further increase the accurate of tile data in quad-tree structure and determine.
S10, father's node of present node added into list, to replace the child nodes of father's node in list, and after
It is continuous to perform S2.
If specifically, if minimum range judges father's node less than the reference distance of current layer tile data
Whether in list UpdateList is updated, if it does not exist, then father's node is added in renewal list UpdateList；
Then four child nodes of father's node of present node are judged successively whether in list UpdateList is updated, if
In the presence of removing this node from renewal list and add it in delete list DelList, it is necessary to illustrate, if updating
Four child nodes of four child nodes of father's node in list UpdateList be present, then equally by four child nodes
Four child nodes add into delete list DelList.It can be seen that the present invention to landform tile data by adjusting in real time
Degree, so as to reduce the data that tile node preserves in internal memory, realize Dynamic Announce of the massive terrain data in three-dimensional scenic.And
And because the quaternary tree of foundation is due to being nearby fine data, and be at a distance asperity data, so as to will generally make internal memory disappear
Consumption greatly reduces.
The present embodiment provides a kind of specifically terrain tile data dynamic dispatching method based on three-dimensional scenic, with to we
Case explains, specific as follows：
First, data source
Terrain data bounding box：
XMin=70403.594, XMax=104115.631, YMin=62958.352, YMax=100016.620；
Terrain tile data maximum level：3；
Terrain tile data maximum level tile data precision：4.
2nd, the rule and calculation of root node are initialized
1st, the calculating of each layer of tile precision and tile size
3rd layer of tile precision：Res3=4；Tile size TileSize3=37058.268；
2nd layer of tile precision：Res2=2；Tile size TileSize2=18529.134；
1st layer of tile precision：Res1=1；Tile size TileSize1=9264.567；
0th layer of tile precision：Res0=0.5；Tile size TileSize0=4632.2835；
2nd, the establishment of tile coordinate system
3rd layer of row of tiles train value：Row 0, row 0
2nd layer of row of tiles train value：Row 0-1, arrange 0-1
1st layer of row of tiles train value：Row 0-3, arrange 0-3
0th layer of row of tiles train value：Row 0-7, arrange 0-7
3rd, reference determination of distance
BaseDistance=18963.02.
4th, the structure of initialization list
Only have tile (to mark) 3-0-0 nodes with Level-Col-Row in initialization list
3rd, tile data dynamic dispatching
It is assumed that current view point coordinate is 87259.6171875,81487.484375,74116.53125；The remote section of what comes into a driver's body
Distance is 78234.992, and nearly cross-sectional distance is 1, and field-of-view angle is 35 °, and the aspect ratio of frustum is 1.8679678.
1st, dispatch for the first time：
There are 3-0-0 nodes in the current list CurList, have 3-0-0 nodes, temporary table in renewal list UpdateList
There are 3-0-0 nodes in TemList, delete list DelList is sky.
Travel through 3-0-0 in TemList：
Handed over what comes into a driver's body phase, current level is 3 to be more than 0, carries out positive traversal, and first tile is 2-0-0, bounding box
For：
TXmin=70403.594,
TXMax=88932.734, TYMin=81487.484, TYMax=100016.62；Bounding box central point and viewpoint
Distance be 75078.109.
Second tile is 2-0-1, and bounding box is：
TXmin=70403.594,
TXMax=88932.734, TYMin=62958.352, TYMax=81487.484；Bounding box central point and viewpoint
Distance be 75078.109.
3rd tile is 2-1-0, and bounding box is：
TXmin=88932.734,
TXMax=107461.87, TYMin=81487.484, TYMax=100016.62；
The distance of bounding box central point and viewpoint is 75489.906.
4th tile is 2-1-1, and bounding box is：
TXmin=88932.734,
TXMax=107461.87, TYMin=62958.352, TYMax=81487.484；Bounding box central point and viewpoint
Distance be 75489.906.
Minimum value is MinDis=75078.109；LoadDis=75852.078；MinDis<LoadDis, carry out positive
Traversal, 4 child nodes GroupNode* are created, and load the data of four child nodes.Four child's tile nodes are added
Enter and update list, current tile node removes from renewal list and is added to delete list, exchanges renewal list and the current list, then：
There are 2-0-0,2-0-1,2-1-0,2-1-1 in renewal list UpdateList；There is 2-0- in temporary table TemList
0、2-0-1、2-1-0、2-1-1；There are 2-0-0,2-0-1,2-1-0,2-1-1 in the current list CurList；Delete list
There is 3-0-0 in DelList, and delete the tile data information of 3-0-0 in delete list DelList, delete list after deletion
DelList is sky.
2nd, second of scheduling：
2.1st, 2-0-0 in temporary table TemList is traveled through：
Handed over what comes into a driver's body phase, current level is 2 to be more than 0, carries out positive traversal, and first tile is 1-0-0, bounding box
For：
TXmin=70403.594,
TXMax=79668.164, TYMin=90752.055, TYMax=100016.62；Bounding box central point and viewpoint
Distance be 76392.422；
Second tile is 1-0-1, and bounding box is：
TXmin=70403.594,
TXMax=79668.164, TYMin=81487.484, TYMax=90752.055；Bounding box central point and viewpoint
Distance be 75260.469；
3rd tile is 1-1-0, and bounding box is：
TXmin=79668.164,
TXMax=88932.734, TYMin=90752.055, TYMax=100016.62；
The distance of bounding box central point and viewpoint is 75466.148；
4th tile is 1-1-1, and bounding box is：
TXmin=79668.164,
TXMax=88932.734, TYMin=81487.484, TYMax=90752.055；Bounding box central point and viewpoint
Distance be 74320.086；
Minimum value is MinDis=74320.086；LoadDis=37926.039；MinDis>LoadDis, carry out reverse
Traversal, judge that father's node is present, calculate four child nodes tile bounding box central points of father's node to the distance of viewpoint
It is respectively：
2-0-0：75078.109；2-0-1：75078.109；2-1-0：75489.906；2-1-1：It is 75489.906 minimum
Distance MinDis=75078.109, LoadDis=75852.078, MinDis<LoadDis, then in order to prevent present node
Data are not loaded, it is necessary to check whether present node has loaded data, if not loading data, then loading data are returned
Return.
2.2nd, 2-0-1 in TemList is traveled through：
Handed over what comes into a driver's body phase, current level is 2 to be more than 0, carries out positive traversal, and first tile is 1-0-2, bounding box
For：
TXmin=70403.594,
TXMax=79668.164, TYMin=72222.914, TYMax=81487.484；Bounding box central point and viewpoint
Distance be 75260.469；
Second tile is 1-0-3, and bounding box is：
TXmin=70403.594,
TXMax=79668.164, TYMin=62958.352, TYMax=72222.914；Bounding box central point and viewpoint
Distance be 76392.422；
3rd tile is 1-1-2, and bounding box is：
TXmin=79668.164,
TXMax=88932.734, TYMin=72222.914, TYMax=81487.484；
The distance of bounding box central point and viewpoint is 74320.086；
4th tile is 1-1-3, and bounding box is：
TXmin=79668.164,
TXMax=88932.734, TYMin=62958.352, TYMax=72222.914；Bounding box central point and viewpoint
Distance be 75446.148；
Minimum value is MinDis=74320.086；LoadDis=37926.039；MinDis>LoadDis, carry out reverse
Traversal, judge that father's node is present, calculate four child nodes tile bounding box central points of father's node to the distance of viewpoint
It is respectively：
2-0-0：75078.109；2-0-1：75078.109；2-1-0：75489.906；2-1-1：It is 75489.906 minimum
Distance MinDis=75078.109, LoadDis=75852.078, MinDis<LoadDis, then in order to prevent present node
Data are not loaded, it is necessary to check whether present node has loaded data, if not loading data, then loading data are returned
Return.
2.3rd, 2-1-0 in TemList is traveled through：
Handed over what comes into a driver's body phase, current level is 2 to be more than 0, carries out positive traversal, and first tile is 1-2-0, bounding box
For：
TXmin=88932.734,
TXMax=98197.297, TYMin=90752.055, TYMax=100016.62；Bounding box central point and viewpoint
Distance be 75671.266；
Second tile is 1-2-1, and bounding box is：
TXmin=88932.734,
TXMax=98197.297, TYMin=81487.484, TYMax=90752.055；Bounding box central point and viewpoint
Distance be 74528.359；
3rd tile is 1-3-0, and bounding box is：
TXmin=98197.297,
TXMax=107461.87, TYMin=90752.055, TYMax=100016.62；
The distance of bounding box central point and viewpoint is 76998.742；
4th tile is 1-3-1, and bounding box is：
TXmin=98197.297,
TXMax=107461.87, TYMin=81487.484, TYMax=90752.055；
The distance of bounding box central point and viewpoint is 75875.836；
Minimum value is MinDis=74528.359；LoadDis=37926.039；MinDis>LoadDis, carry out reverse
Traversal, judge that father's node is present, calculate four child nodes tile bounding box central points of father's node to the distance of viewpoint
It is respectively：
2-0-0：75078.109；2-0-1：75078.109；2-1-0：75489.906；2-1-1：It is 75489.906 minimum
Distance MinDis=75078.109, LoadDis=75852.078, MinDis<LoadDis, then in order to prevent present node
Data are not loaded, it is necessary to check whether present node has loaded data, if not loading data, then loading data are returned
Return.
2.4th, 2-1-1 in TemList is traveled through：
Handed over what comes into a driver's body phase, current level is 2 to be more than 0, carries out positive traversal, and first tile is 1-2-2, bounding box
For：
TXmin=88932.734,
TXMax=98197.297, TYMin=72222.914, TYMax=81487.484；Bounding box central point and viewpoint
Distance be 74528.359；
Second tile is 1-2-3, and bounding box is：
TXmin=88932.734,
TXMax=98197.297, TYMin=62958.352, TYMax=72222.914；Bounding box central point and viewpoint
Distance be 75671.266；
3rd tile is 1-3-2, and bounding box is：
TXmin=98197.297,
TXMax=107461.87, TYMin=72222.914, TYMax=81487.484；
The distance of bounding box central point and viewpoint is 75875.836；
4th tile is 1-3-3, and bounding box is：
TXmin=98197.297,
TXMax=107461.87, TYMin=62958.352, TYMax=72222.914；
The distance of bounding box central point and viewpoint is 76998.742；
Minimum value is MinDis=74528.359；LoadDis=37926.039；MinDis>LoadDis, carry out reverse
Traversal, judge that father's node is present, calculate four child nodes tile bounding box central points of father's node to the distance of viewpoint
It is respectively：
2-0-0：75078.109；2-0-1：75078.109；2-1-0：75489.906；2-1-1：It is 75489.906 minimum
Distance MinDis=75078.109, LoadDis=75852.078, MinDis<LoadDis, then in order to prevent present node
Data are not loaded, it is necessary to check whether present node has loaded data, if not loading data, then loading data are returned
Return.
Renewal list and the current list are exchanged, then has 2-0-0,2-0-1,2-1-0,2-1-1 in the current list CurList.
Delete list DelList is sky.Because viewpoint does not change, then still have 2-0-0,2-0- in the current list CurList
1st, 2-1-0,2-1-1 node, so second of scheduling operation can be repeated always.
Terrain tile data dynamic scheduler provided in an embodiment of the present invention is introduced below, described belowly
Shape tile data dynamic scheduler can be with cross-referenced with above-described terrain tile data dynamic dispatching method.
Referring to Fig. 5, a kind of terrain tile data dynamic scheduler based on three-dimensional scenic provided in an embodiment of the present invention,
Including：
List initialization module 100, for the node corresponding to the top layer tile data using tile data as quaternary tree
The root node of structure, root node is added into list, the tile data is that terrain data is cut according to quaternary tree mechanism
Generate afterwards；
First judge module 200, for choosing present node from list, judge whether present node meets positive traversal
Condition；
Minimum range determining module 300, for when present node meets positive ergodic condition, determining under present node
The central point of one layer of four tile data and the minimum range of viewpoint；
Second judge module 400, for judging whether minimum range is less than the reference distance of next layer of tile data；
Positive spider module 500, for minimum range be less than the reference of next layer of tile data apart from when, will be current
Child nodes of four nodes as present node corresponding to four tile datas of next layer of node, load each child
Tile data corresponding to node, the tile data of present node is deleted, and four child nodes are added to list, to replace row
Present node in table, and continue to trigger first judge module.
Based on above-mentioned technical proposal, if first judge module judges that present node is unsatisfactory for positive ergodic condition, or
Person, second judge module judge reference distance of the minimum range not less than next layer of tile data, then the landform
Tile data dynamic scheduler also includes reverse spider module, and the reversely spider module includes：
First judging unit, for judging that present node whether there is father node；If father node is not present, first is triggered
Judge module；
Minimum range determining unit, when father node be present for present node, determine four of the father node of present node
The central point of child nodes and the minimum range of viewpoint；
Second judging unit, for judging whether minimum range is less than the reference distance of current layer tile data；
3rd judging unit, for minimum range be less than the reference of current layer tile data apart from when, judge current
Whether node has loaded corresponding tile data；If having loaded, first judge module is triggered；
First loading unit, when there is no tile data corresponding to loading for present node, load the tile of present node
After data, and trigger first judge module；
4th judging unit, for minimum range not less than current layer tile data reference apart from when, judge work as
Whether father's node of front nodal point has loaded corresponding tile data；If having loaded, trigger list updating block；
Second loading unit, father's node for present node during tile data, load father not corresponding to loading
The tile data of node, and trigger list updating block；
List update unit, for father's node of present node to be added into list, to replace father's node in list
Child nodes, and trigger the first judge module.
A kind of terrain tile data dynamic dispatching equipment based on three-dimensional scenic provided in an embodiment of the present invention, including storage
Device and processor：
Memory, for storing computer program；
Processor, the terrain tile data dynamic tune as described in above-mentioned embodiment is realized during for performing the computer program
The step of degree method.
Likewise, the embodiment of the present invention additionally provides a kind of computer-readable recording medium, the computer-readable storage
Computer program is stored with medium, the landform watt as described in above-mentioned embodiment is realized when the computer program is executed by processor
The step of sheet data dynamic dispatching method.
Each embodiment is described by the way of progressive in this specification, what each embodiment stressed be and other
The difference of embodiment, between each embodiment identical similar portion mutually referring to.
The foregoing description of the disclosed embodiments, professional and technical personnel in the field are enable to realize or using the present invention.
A variety of modifications to these embodiments will be apparent for those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, it is of the invention
The embodiments shown herein is not intended to be limited to, and is to fit to and principles disclosed herein and features of novelty phase one
The most wide scope caused.
Claims (10)
- A kind of 1. terrain tile data dynamic dispatching method based on three-dimensional scenic, it is characterised in that including：S1, the root node using the node corresponding to the top layer tile data of tile data as quad-tree structure, by root node plus Enter list, the tile data generates after being cut according to quaternary tree mechanism to terrain data；S2, present node is chosen from list, judge whether present node meets positive ergodic condition；S3, when present node meets positive ergodic condition, determine that next layer four of present node opens the central point of tile data With the minimum range of viewpoint；S4, judge whether minimum range is less than the reference distance of next layer of tile data；If so, then perform S5；S5, positive traversal is carried out, using four nodes corresponding to next layer of present node of four tile datas as current The child nodes of node, load each child nodes corresponding to tile data, delete the tile data of present node, and by four Child nodes are added to list, to replace the present node in list, and continue executing with the S2.
- 2. terrain tile data dynamic dispatching method according to claim 1, it is characterised in that if judging to work as prosthomere in S2 Point is unsatisfactory for positive ergodic condition, or, reference distance of the minimum range not less than next layer of tile data is judged in S4, Then the terrain tile data dynamic dispatching method also includes：S6, reversely traveled through, judge that present node whether there is father node；If in the presence of, if perform S7, be not present, hold Row S2；S7, determine present node father node the central point of four child nodes and the minimum range of viewpoint, judge most narrow spacing With a distance from whether less than the reference of current layer tile data；If so, S8 is then performed, if it is not, then performing S9；S8, judge whether present node has loaded corresponding tile data；If it is not, then after the tile data of loading present node, Perform S2；If so, then directly perform S2；S9, judge whether father's node of present node has loaded corresponding tile data；If it is not, then load watt of father's node After sheet data, S10 is performed；If so, then directly perform S10；S10, father's node addition list by present node, to replace the child nodes of father's node in list, and continue to hold Row S2.
- 3. terrain tile data dynamic dispatching method according to claim 1, it is characterised in that present node is judged in S2 Whether positive ergodic condition is met, including：If the bounding box of present node is handed over what comes into a driver's body phase, and the current level of present node is more than zero, then judges present node Meet positive ergodic condition, otherwise, it is determined that present node meets reverse ergodic condition.
- 4. terrain tile data dynamic dispatching method as claimed in any of claims 1 to 3, it is characterised in that hold Before row S1, in addition to：Using the hierarchical information of tile data and the bounding box information of terrain data, the tile size of every layer of tile data is determined；Establish the coordinate system of tile data；The coordinate system includes the ranks coordinate value of every layer of tile data；Reference distance is determined according to the bounding box information of terrain data and maximum hierarchical information.
- 5. terrain tile data dynamic dispatching method according to claim 4, it is characterised in that the determination present node Next layer four open the central point of tile data and the minimum range of viewpoint, including：According to the coordinate system of the tile data, determine that next layer four of present node opens the coordinate value of tile data；Utilize the coordinate value of next every tile data of layer, the bounding box information of terrain data and watt of next layer of tile data Piece size, determine the bounding box information of next every tile data of layer；The central point and viewpoint of next every tile data of layer are determined according to the bounding box information of next every tile data of layer Distance, minimum range is filtered out from the distance of the central point of next every tile data of layer and viewpoint.
- 6. terrain tile data dynamic dispatching method according to claim 4, it is characterised in that whether judge minimum range Less than the reference distance of next layer of tile data, including：According to the hierarchical information and reference distance of next layer of tile data, determine the reference of next layer of tile data away from From.
- A kind of 7. terrain tile data dynamic scheduler based on three-dimensional scenic, it is characterised in that including：List initialization module, the root for the node corresponding to the top layer tile data using tile data as quad-tree structure Node, root node is added into list, the tile data generates after being cut according to quaternary tree mechanism to terrain data；First judge module, for choosing present node from list, judge whether present node meets positive ergodic condition；Minimum range determining module, for when present node meets positive ergodic condition, determining next layer four of present node Open the central point of tile data and the minimum range of viewpoint；Second judge module, for judging whether minimum range is less than the reference distance of next layer of tile data；Positive spider module, for minimum range be less than the reference of next layer of tile data apart from when, by present node Child nodes of four nodes as present node corresponding to next layer of four tile datas, load each child nodes pair The tile data answered, the tile data of present node is deleted, and four child nodes are added to list, to replace in list Present node, and continue to trigger first judge module.
- 8. terrain tile data dynamic scheduler according to claim 7, it is characterised in that if described first judges mould Block judges that present node is unsatisfactory for positive ergodic condition, or, second judge module judges minimum range not less than next Layer tile data reference distance, then the terrain tile data dynamic scheduler also include reverse spider module, institute Stating reverse spider module includes：First judging unit, for judging that present node whether there is father node；If father node is not present, triggering first judges Module；Minimum range determining unit, when father node be present for present node, determine four children of the father node of present node The central point of node and the minimum range of viewpoint；Second judging unit, for judging whether minimum range is less than the reference distance of current layer tile data；3rd judging unit, for minimum range be less than current layer tile data reference apart from when, judge present node Whether corresponding tile data has been loaded；If having loaded, first judge module is triggered；First loading unit, when there is no tile data corresponding to loading for present node, load the tile data of present node Afterwards, and first judge module is triggered；4th judging unit, for minimum range not less than current layer tile data reference apart from when, judgement work as prosthomere Whether father's node of point has loaded corresponding tile data；If having loaded, trigger list updating block；Second loading unit, father's node for present node during tile data, load father's node not corresponding to loading Tile data, and trigger list updating block；List update unit, for father's node of present node to be added into list, to replace the child of father's node in list Node, and trigger the first judge module.
- A kind of 9. terrain tile data dynamic dispatching equipment based on three-dimensional scenic, it is characterised in that including：Memory, for storing computer program；Processor, realize that the terrain tile data as described in any one of claim 1 to 6 are moved during for performing the computer program The step of state dispatching method.
- 10. a kind of computer-readable recording medium, it is characterised in that be stored with computer on the computer-readable recording medium Program, the terrain tile data dynamic as described in any one of claim 1 to 6 is realized when the computer program is executed by processor The step of dispatching method.
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 true CN107730583A (en) | 2018-02-23 |
| CN107730583B 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) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108363808A (en) * | 2018-03-07 | 2018-08-03 | 浙江科澜信息技术有限公司 | The dynamic dispatching of mass data and display methods, device, equipment and storage medium |
| CN109584366A (en) * | 2018-12-10 | 2019-04-05 | 浙江科澜信息技术有限公司 | A kind of terrain rendering method, apparatus, equipment and readable storage medium storing program for executing |
| CN110647541A (en) * | 2019-09-26 | 2020-01-03 | 武汉市珞珈俊德地信科技有限公司 | Efficient adaptive three-dimensional model tile production method |
| CN111105492A (en) * | 2019-12-18 | 2020-05-05 | 四川大学 | Rapid scheduling method for tile elevation data in terrain smoothing process |
| CN113506378A (en) * | 2021-07-29 | 2021-10-15 | 和舆图（北京）科技有限公司 | Method for dynamically loading three-dimensional model on MR (magnetic resonance) equipment |
| CN117237543A (en) * | 2023-11-10 | 2023-12-15 | 中科星图智慧科技安徽有限公司 | 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 |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108363808A (en) * | 2018-03-07 | 2018-08-03 | 浙江科澜信息技术有限公司 | The dynamic dispatching of mass data and display methods, device, equipment and storage medium |
| CN108363808B (en) * | 2018-03-07 | 2020-08-11 | 浙江科澜信息技术有限公司 | Method, device, equipment and storage medium for dynamically scheduling and displaying mass data |
| CN109584366A (en) * | 2018-12-10 | 2019-04-05 | 浙江科澜信息技术有限公司 | A kind of terrain rendering method, apparatus, equipment and readable storage medium storing program for executing |
| 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 |
| CN111105492A (en) * | 2019-12-18 | 2020-05-05 | 四川大学 | Rapid scheduling method for tile elevation data in terrain smoothing process |
| CN113506378A (en) * | 2021-07-29 | 2021-10-15 | 和舆图（北京）科技有限公司 | Method for dynamically loading three-dimensional model on MR (magnetic resonance) equipment |
| CN113506378B (en) * | 2021-07-29 | 2023-03-17 | 和舆图（北京）科技有限公司 | Method for dynamically loading three-dimensional model on MR (magnetic resonance) equipment |
| CN117237543A (en) * | 2023-11-10 | 2023-12-15 | 中科星图智慧科技安徽有限公司 | Front-end Web multi-source heterogeneous three-dimensional model and three-dimensional terrain fusion method |
| CN117237543B (en) * | 2023-11-10 | 2024-02-20 | 中科星图智慧科技安徽有限公司 | Front-end Web multi-source heterogeneous three-dimensional model and three-dimensional terrain fusion method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107730583B (en) | 2021-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107730583A (en) | A kind of terrain tile data dynamic dispatching method and device based on three-dimensional scenic | |
| CN103198366B (en) | A kind of multi-goal path planing method considering that destination node is ageing | |
| CN101908068B (en) | Quadtree-based massive laser scanning point cloud real-time drawing method | |
| CN103970960B (en) | The element-free Galerkin structural topological optimization method accelerated parallel based on GPU | |
| CN110537210A (en) | Augmented reality display system, program and method | |
| WO2004111799A3 (en) | Systems and methods for using visual hulls to determine the number of people in a crowd | |
| CN107341548A (en) | A kind of data processing method, device and electronic equipment | |
| CN105874511B (en) | Analog machine | |
| CN107918957A (en) | A kind of three-dimensional building model simplifying method of holding structure and textural characteristics | |
| CN104573140A (en) | Layered dynamic path planning method applied to virtual simulation | |
| CN108830376A (en) | For the multivalence value network depth intensified learning method of the environment of time-sensitive | |
| CN104536831B (en) | A kind of multinuclear SoC software image methods based on multiple-objection optimization | |
| CN104537835B (en) | The loop traffic reliability emulation mode and system of a kind of macroscopic view-microcosmic combination | |
| CN107240155B (en) | A kind of method, server and the 3D application system of model object building | |
| CN110490302A (en) | A kind of neural network compiling optimization method, device and Related product | |
| JP2006201979A (en) | Program for supporting construction planning of building | |
| CN108304929A (en) | A kind of determination method and system of the best tactics of lattice chess | |
| Kulikov et al. | The Principles of Discrete Modeling of Rod Constructions of Architectural Objects | |
| CN113609548B (en) | Bridge span distribution method, device, equipment and readable storage medium | |
| CN103577705B (en) | A kind of system controls the data processing method and device of group | |
| Husseinzadeh Kashan et al. | A rig-based formulation and a league championship algorithm for helicopter routing in offshore transportation | |
| CN112988403B (en) | Integrated circuit simulation multithread management parallel method and device with security function | |
| CN109558654A (en) | A kind of plane tension integral structure topology design method | |
| CN114863040A (en) | LOD tree construction method and device for texture-dense three-dimensional scene and electronic equipment | |
| JP7215876B2 (en) | CONSTRUCTION SIMULATION DEVICE, CONSTRUCTION SIMULATION METHOD, AND PROGRAM |
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 |