CN102117495A - New data partitioning method and device in three-dimensional modeling - Google Patents

New data partitioning method and device in three-dimensional modeling Download PDF

Info

Publication number
CN102117495A
CN102117495A CN2009102442937A CN200910244293A CN102117495A CN 102117495 A CN102117495 A CN 102117495A CN 2009102442937 A CN2009102442937 A CN 2009102442937A CN 200910244293 A CN200910244293 A CN 200910244293A CN 102117495 A CN102117495 A CN 102117495A
Authority
CN
China
Prior art keywords
data
latitude
new data
layer
level
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
Application number
CN2009102442937A
Other languages
Chinese (zh)
Other versions
CN102117495B (en
Inventor
龚浩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Digital Video Beijing Ltd
Original Assignee
China Digital Video Beijing Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Digital Video Beijing Ltd filed Critical China Digital Video Beijing Ltd
Priority to CN200910244293.7A priority Critical patent/CN102117495B/en
Publication of CN102117495A publication Critical patent/CN102117495A/en
Application granted granted Critical
Publication of CN102117495B publication Critical patent/CN102117495B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Processing Or Creating Images (AREA)

Abstract

The invention provides a new data partitioning method and a device in three-dimensional modeling. The method comprises the steps of calculating new data partitioning hierarchy according to the target resolution ratio in an old data partitioning method, conducting data block partitioning on each hierarchy, and calculating the forming information of each data block on each hierarchy by the longitude and latitude information. In the partitioning process of the refresh data, the partitioning hierarchy and partitioning block of the new data need to be determined in the old data partitioning method for fusing the new and old data conveniently, therefore, a pyramids and quadtrees partitioning method needs to be adopted, and the range and resolution ratio of the blocks divided need to be consistent with those of the old data.

Description

New data dividing method and device in a kind of three-dimensional modeling
Technical field
The present invention relates to the dimensional Modeling Technology field, particularly relate to new data dividing method and device in a kind of three-dimensional modeling.
Background technology
Three-dimensional modeling is usually used in the processing of geographic information data, has using value in a plurality of fields such as oil-field development, geological researches.Three-dimensional modeling is a kind of method of setting up stereoscopic model in the space on process; On the result, briefly the model of setting up exactly has spatial impression and can see up and down all around.
A kind of three-dimensional modeling method that adopts is a pyramid structure of setting up hierarchical block at present, is about to raw data and is divided into many levels, and each level is represented the data model of different fine degree (being different resolution); For every layer data, carry out data block again and cut apart.
With reference to shown in Figure 1, employing be 2 multiplying power pyramid hierarchies.More and more higher from pyramidal bottom (i.e. the 0th layer the figure) to high-rise (i.e. the 2nd layer among the figure) its resolution, and the piece number that divides is also more and more.Suppose that bottom resolution is r 0, then the resolution of i layer is r arbitrarily i=r 0* 2 -1Like this, for the requirement that TV is particularly exported this constant display precision, use pyramid model can make the visit capacity of data remain on a smaller and constant scope.
But the user may often upgrade local data, in order to satisfy the method for above-mentioned hierarchical block modeling, need carry out local pyramid data to the partial data that upgrades and cut apart.
Summary of the invention
Technical matters to be solved by this invention provides new data dividing method and the device in a kind of three-dimensional modeling, can carry out hierarchical block to data updated and handle, and makes it to merge mutually with legacy data.
In order to address the above problem, the invention discloses the new data dividing method in a kind of three-dimensional modeling, comprising:
According to the partitioning scheme of legacy data, calculate the level that new data is cut apart according to target resolution, and each layer is carried out data block cut apart;
To each data block of every layer, utilize latitude and longitude information to calculate the information that forms data block.
Preferably, described method also comprises:
To cut apart good new data and be stored in the zone that is different from the legacy data storage;
Reading new data replacement legacy data shows.
Preferably, described each data block to every layer, utilize latitude and longitude information to calculate the information that forms data block and comprise:
To each data block of every layer, calculate corresponding longitude and latitude scope, and calculate the original longitude and latitude data that need read;
The original longitude and latitude data that read are carried out interpolation calculation, obtain forming the information of data block.
Preferably, described interpolation calculation comprises:
Adopt method of interpolation nearby,, obtain the angle point nearest apart from this data point by calculating certain data point and the distance of four angle points on every side, and with the value of this angle point as the value that newly is worth this data point of renewal; Wherein, described angle point is meant original longitude and latitude data.
Preferably, described partitioning scheme according to legacy data, the level of cutting apart according to target resolution calculating new data comprises:
When the new data dividing layer only can be formed a piece or not satisfy piece of composition, this level was minimum level just;
When the resolution of new data dividing layer no longer satisfies when cutting apart requirement, this level is a highest level just.
The present invention also provides the segmenting device of the new data in a kind of three-dimensional modeling, comprising:
The hierarchical block module is used for the partitioning scheme according to legacy data, calculates the level that new data is cut apart according to target resolution, and each layer is carried out data block cuts apart;
The blocks of data generation module is used for each data block to every layer, utilizes latitude and longitude information to calculate the information that forms data block.
Preferably, described device also comprises:
Preserve module, be used for being stored in the zone that is different from the legacy data storage cutting apart good new data;
Display module is used to read new data replacement legacy data and shows.
Preferably, described blocks of data generation module comprises:
Piece scope determining unit is used for each data block to every layer, calculates corresponding longitude and latitude scope, and calculates the original longitude and latitude data that need read;
The interpolation calculation unit is used for the original longitude and latitude data that read are carried out interpolation calculation, obtains forming the information of data block.
Preferably, described interpolation calculation unit adopts method of interpolation nearby, by calculating certain data point and the distance of four angle points on every side, obtains the angle point nearest apart from this data point, and with the value of this angle point as the value that newly is worth this data point of renewal; Wherein, described angle point is meant original longitude and latitude data.
Preferably, described hierarchical block module comprises:
The lowermost layer cutting unit is used for when the new data dividing layer only can be formed a piece or not satisfy piece of composition, and this level is minimum level just;
Top cutting unit is used for no longer satisfying when cutting apart requirement when the resolution of new data dividing layer, and this level is a highest level just.
Compared with prior art, the present invention has the following advantages:
At first, the present invention is when more new data is cut apart, carry out the fusion of new legacy data for convenience, need determine the dividing layer and the block of new data according to the partitioning scheme of legacy data, promptly not only will adopt the partitioning scheme of pyramid quaternary tree, and the piece scope that splits also must be consistent with legacy data with resolution.
Secondly, the present invention has adopted method of interpolation nearby when computing block information, calculate quick and convenient.
Once more, the present invention still keeps legacy data, is stored in the zone that is different from the legacy data storage and will cut apart good new data, reads new data during demonstration and replaces legacy data, makes things convenient for the user to carry out reduction of data like this.
Description of drawings
Fig. 1 is the pyramid structure synoptic diagram of hierarchical block in the prior art;
Fig. 2 is the new data dividing method process flow diagram in the described a kind of three-dimensional modeling of the embodiment of the invention;
Fig. 3 is the synoptic diagram of interpolation calculation nearby in the embodiment of the invention;
Fig. 4 is the structural drawing of the new data segmenting device in the described a kind of three-dimensional modeling of the embodiment of the invention.
Embodiment
For above-mentioned purpose of the present invention, feature and advantage can be become apparent more, the present invention is further detailed explanation below in conjunction with the drawings and specific embodiments.
Behind the three-dimensional model of having set up hierarchical block, if desired the local data in the model is upgraded, just need carry out hierarchical block again and handle new data (hereinafter to be referred as new data) more, replace corresponding legacy data in the model then.Because in general the data updated part can be very not big, therefore upgrading is to move automatically on the backstage.
The invention provides the method that a kind of new data is cut apart, its core concept is: at first calculate the pyramidal layer aggregated(particle) structure that can cut apart by target data resolution.Carry out the fusion of new legacy data for convenience, new data need be observed the partitioning scheme of legacy data, and promptly new data not only will adopt the partitioning scheme of pyramid quaternary tree, and the piece scope that splits also must be consistent with legacy data with resolution.Like this, the definite of minimum level just has been easy to, and when new dividing layer only can be formed a piece or not satisfy piece of composition, this level was minimum level just.And the resolution of determining new data of highest level no longer satisfies and just is highest level when cutting apart requirement.
Be elaborated below by embodiment.
With reference to Fig. 2, be the new data dividing method process flow diagram in the described a kind of three-dimensional modeling of the embodiment of the invention.
For the new data of cutting apart, cut apart requirement below need satisfying according to the pattern of legacy data:
1, big or small regular piecemeal such as, its median size refer to all pieces and all equate with wide height between the piece, and rule is meant clocklike, is not out of order.Adopt the reason of this principle to be: if adopt irregular piecemeal, or not wait big or small piecemeal, will increase the complexity of edge fit algorithm; Wait big or small piecemeal that the load time is consistent simultaneously, simplify memory management, stop to produce memory fragmentation.
2, the data block size is 2 integer power.Reason is: simplify the complexity set up hierarchical pyramid, and now the image size of texture generally all to require wide height be 2 integer power.Therefore, what Fig. 3 adopted is the quaternary tree index structure, meets 2 integer power between each layer.
Based on above-mentioned partition principle, step is as follows:
Step 201 reads new data;
Described new data typically refers to the geographic information data of taking photo by plane, and is used for upgrading the legacy data of three-dimensional model;
Whether step 202, judgement read successful;
The data existence has in the file of specific format owing to take photo by plane, if therefore do not resolve this specific format, just can not read data.
If read success, then continue step 203; Otherwise it is unsuccessful to notify the user to read.
Step 203 obtains original latitude and longitude information and projection mode;
Comprise the original latitude and longitude information and the projection mode of use in the data of taking photo by plane, projection mode has multiple, the projection mode that data are used if take photo by plane is different with the projection mode that three-dimensional model uses, also need to carry out the projection mode conversion, the projection mode that the data of taking photo by plane are used is converted to the projection mode that three-dimensional model uses.
Then,, calculate the level that new data is cut apart, specifically be divided into step 204 and step 205 according to target resolution according to the partitioning scheme of legacy data, as follows:
Step 204, minimum dividing layer calculates, and according to the partitioning scheme of legacy data, and if only if when new data only can be divided into a piece or just not satisfy a piece, and this level is minimum level just;
Step 205, best result are cut layer and are calculated, and according to target resolution, when the lack of resolution of new data was cut apart with support, this level was a highest level just;
Described target resolution is meant the resolution of original longitude and latitude data, so described being not enough to supported to cut apart to be meant: the top resolution of new data can not surpass the resolution of original longitude and latitude data, because original longitude and latitude data are the meticulousst.
Step 206, lowermost layer and top between data carried out piece cut apart;
If three-dimensional model is a pyramid quaternary tree pattern shown in Figure 1, then the piece number of each layer is 2 integer power, is 2 multiplying power pyramid hierarchies.
Step 207 to each data block of every layer, utilizes latitude and longitude information to calculate the information that forms data block;
Because new data relies on the partitioning scheme of legacy data in order to show convenient needs, therefore may cause partial data can not satisfy the coordinate position of legacy data, at this moment just need carry out the value that interpolation calculation goes out this correct position.
Specifically comprise:
The first step is calculated corresponding longitude and latitude scope to each data block, and calculates the original longitude and latitude data that need read;
Second step, the original longitude and latitude data that read are carried out interpolation calculation, obtain forming the information of data block.
Carry out according to the resolution when anterior layer during interpolation, the algorithm of data interpolating has a variety of.In the present embodiment and since in the method for models show, follow be data resolution less than display resolution, that is to say that the interpolation influence here is a Pixel-level, error is negligible for normal demonstration.Therefore, in order to carry out fast new value calculating, present embodiment has adopted the most convenient and scheme rapidly: method of interpolation nearby.
Method of interpolation nearby is exactly by calculating certain data point and the distance of four angle points on every side, obtains the angle point nearest apart from this data point, and with the value of this angle point as the value that newly is worth this data point of renewal.Wherein, described angle point is meant original longitude and latitude data, and described data point is meant the information that forms data block.
With reference to Fig. 3, be the synoptic diagram of interpolation calculation nearby in the embodiment of the invention.
Suppose that certain modeling data coordinate position is B, can find its adjacent 4 data coordinate positions (A1---A4, promptly original longitude and latitude data) like this.Carry out the new value that interpolation can be calculated coordinate position B by these four coordinate positions.
The interpolation calculation process is: by calculating the distance (L1---L4) of four angle points (A1---A4) and B, obtain apart from the nearest angle point of B point, then the value of this point is gone to upgrade the value that B is ordered as new value.
Step 208, the new data after will cutting apart according to the requirement of hierarchical block three dimensional pattern is preserved.
When the mode that all data are cut apart according to pyramid organize finish after, these can be cut apart good data and be placed on the predefined path, and be not directly this part data to be replaced original legacy data, make things convenient for the user to carry out reduction of data like this.And when showing, can read new data and remove to replace legacy data and show.
Preferably, data reads for convenience, use the mode of piecemeal to handle earlier equally for data file, set up quaternary tree tile index, can disposable needed data be read in fully when obtaining data like this, work such as do not obtain and do not need that again data are carried out range arithmetic, interpolation, thereby made things convenient for data read, quickened modeling process.
At said method embodiment, the present invention also provides corresponding device thereof embodiment.
With reference to Fig. 4, be the structural drawing of the new data segmenting device in the described a kind of three-dimensional modeling of the embodiment of the invention.
Described device mainly comprises:
Hierarchical block module 41 is used for the partitioning scheme according to legacy data, calculates the level that new data is cut apart according to target resolution, and each layer is carried out data block cuts apart;
Blocks of data generation module 42 is used for each data block to every layer, utilizes latitude and longitude information to calculate the information that forms data block.
Wherein, described blocks of data generation module 42 further can comprise:
Piece scope determining unit is used for each data block to every layer, calculates corresponding longitude and latitude scope, and calculates the original longitude and latitude data that need read;
The interpolation calculation unit is used for the original longitude and latitude data that read are carried out interpolation calculation, obtains forming the information of data block.
Present embodiment preferably adopts method of interpolation nearby, by calculating certain data point and the distance of four angle points on every side, obtains the angle point nearest apart from this data point, and with the value of this angle point as the value that newly is worth this data point of renewal; Wherein, described angle point is meant original longitude and latitude data.
Described hierarchical block module 41 further can comprise:
The lowermost layer cutting unit is used for when the new data dividing layer only can be formed a piece or not satisfy piece of composition, and this level is minimum level just;
Top cutting unit is used for no longer satisfying when cutting apart requirement when the resolution of new data dividing layer, and this level is a highest level just.
Preferably, described device can also comprise:
Preserve module 43, be used for being stored in the zone that is different from the legacy data storage cutting apart good new data;
Display module 44 is used to read new data replacement legacy data and shows.
In sum, device of the present invention can be cut apart new data according to the partitioning scheme of legacy data, is that new data and legacy data merge.And, when computing block information, adopted method of interpolation nearby, calculate quick and convenient.And, still keep legacy data, be stored in the zone that is different from the legacy data storage and will cut apart good new data, read new data during demonstration and replace legacy data, make things convenient for the user to carry out reduction of data like this.
Each embodiment in this instructions all adopts the mode of going forward one by one to describe, and what each embodiment stressed all is and the difference of other embodiment that identical similar part is mutually referring to getting final product between each embodiment.For device embodiment, because it is similar substantially to method embodiment, so description is fairly simple, relevant part gets final product referring to the part explanation of method embodiment.
More than to new data dividing method and device in a kind of three-dimensional modeling provided by the present invention, be described in detail, used specific case herein principle of the present invention and embodiment are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.

Claims (10)

1. the new data dividing method in the three-dimensional modeling is characterized in that, comprising:
According to the partitioning scheme of legacy data, calculate the level that new data is cut apart according to target resolution, and each layer is carried out data block cut apart;
To each data block of every layer, utilize latitude and longitude information to calculate the information that forms data block.
2. method according to claim 1 is characterized in that, also comprises:
To cut apart good new data and be stored in the zone that is different from the legacy data storage;
Reading new data replacement legacy data shows.
3. method according to claim 1 is characterized in that, described each data block to every layer is utilized latitude and longitude information to calculate the information that forms data block and comprised:
To each data block of every layer, calculate corresponding longitude and latitude scope, and calculate the original longitude and latitude data that need read;
The original longitude and latitude data that read are carried out interpolation calculation, obtain forming the information of data block.
4. method according to claim 3 is characterized in that, described interpolation calculation comprises:
Adopt method of interpolation nearby,, obtain the angle point nearest apart from this data point by calculating certain data point and the distance of four angle points on every side, and with the value of this angle point as the value that newly is worth this data point of renewal; Wherein, described angle point is meant original longitude and latitude data.
5. method according to claim 1 is characterized in that, described partitioning scheme according to legacy data, and the level of cutting apart according to target resolution calculating new data comprises:
When the new data dividing layer only can be formed a piece or not satisfy piece of composition, this level was minimum level just;
According to target resolution, when the resolution of new data dividing layer no longer satisfies when cutting apart requirement, this level is a highest level just.
6. the new data segmenting device in the three-dimensional modeling is characterized in that, comprising:
The hierarchical block module is used for the partitioning scheme according to legacy data, calculates the level that new data is cut apart according to target resolution, and each layer is carried out data block cuts apart;
The blocks of data generation module is used for each data block to every layer, utilizes latitude and longitude information to calculate the information that forms data block.
7. device according to claim 6 is characterized in that, also comprises:
Preserve module, be used for being stored in the zone that is different from the legacy data storage cutting apart good new data;
Display module is used to read new data replacement legacy data and shows.
8. device according to claim 6 is characterized in that, described blocks of data generation module comprises:
Piece scope determining unit is used for each data block to every layer, calculates corresponding longitude and latitude scope, and calculates the original longitude and latitude data that need read;
The interpolation calculation unit is used for the original longitude and latitude data that read are carried out interpolation calculation, obtains forming the information of data block.
9. device according to claim 8 is characterized in that:
Described interpolation calculation unit adopts method of interpolation nearby, by calculating certain data point and the distance of four angle points on every side, obtains the angle point nearest apart from this data point, and with the value of this angle point as the value that newly is worth this data point of renewal; Wherein, described angle point is meant original longitude and latitude data.
10. device according to claim 6 is characterized in that, described hierarchical block module comprises:
The lowermost layer cutting unit is used for when the new data dividing layer only can be formed a piece or not satisfy piece of composition, and this level is minimum level just;
Top cutting unit is used for according to target resolution, and when the resolution of new data dividing layer no longer satisfies when cutting apart requirement, this level is a highest level just.
CN200910244293.7A 2009-12-30 2009-12-30 New data partitioning method and device in three-dimensional modeling Expired - Fee Related CN102117495B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200910244293.7A CN102117495B (en) 2009-12-30 2009-12-30 New data partitioning method and device in three-dimensional modeling

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200910244293.7A CN102117495B (en) 2009-12-30 2009-12-30 New data partitioning method and device in three-dimensional modeling

Publications (2)

Publication Number Publication Date
CN102117495A true CN102117495A (en) 2011-07-06
CN102117495B CN102117495B (en) 2015-02-18

Family

ID=44216247

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200910244293.7A Expired - Fee Related CN102117495B (en) 2009-12-30 2009-12-30 New data partitioning method and device in three-dimensional modeling

Country Status (1)

Country Link
CN (1) CN102117495B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105427380A (en) * 2015-12-23 2016-03-23 昆明能讯科技有限责任公司 Three-dimensional map data processing method based on multiple detailed layers
CN109710624A (en) * 2018-12-19 2019-05-03 泰康保险集团股份有限公司 Data processing method, device, medium and electronic equipment

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1959670A (en) * 2005-11-02 2007-05-09 北京灵图软件技术有限公司 Method for storing topographic image data in pyramid architecture
CN101415018A (en) * 2007-10-17 2009-04-22 北京灵图软件技术有限公司 Transmission method and system for geographical message data

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1959670A (en) * 2005-11-02 2007-05-09 北京灵图软件技术有限公司 Method for storing topographic image data in pyramid architecture
CN101415018A (en) * 2007-10-17 2009-04-22 北京灵图软件技术有限公司 Transmission method and system for geographical message data

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
商宗剑: "战场地理信息系统中遥感图像处理和三维综合建模技术研究", 《中国优秀硕士学位论文全文数据库》 *
郑群英: "影像金字塔增量组织与更新", 《地理空间信息》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105427380A (en) * 2015-12-23 2016-03-23 昆明能讯科技有限责任公司 Three-dimensional map data processing method based on multiple detailed layers
CN105427380B (en) * 2015-12-23 2018-05-08 昆明能讯科技有限责任公司 One kind is based on detail three-dimensional map data processing method
CN109710624A (en) * 2018-12-19 2019-05-03 泰康保险集团股份有限公司 Data processing method, device, medium and electronic equipment
CN109710624B (en) * 2018-12-19 2021-06-11 泰康保险集团股份有限公司 Data processing method, device, medium and electronic equipment

Also Published As

Publication number Publication date
CN102117495B (en) 2015-02-18

Similar Documents

Publication Publication Date Title
JP7166383B2 (en) Method and apparatus for creating high-precision maps
JP5950673B2 (en) Database for navigation device, method for outputting three-dimensional display of terrain, and method for generating database
CN103208225B (en) A kind of tile map method for making and system
KR101994317B1 (en) Navigation device, method of determining a height coordinate and method of generating a database
CN103595791B (en) Cloud accessing method for mass remote sensing data
CN108038249B (en) Global map data storage organization method and call method
CN102117494A (en) Method and device for delaminating and blocking data in three-dimensional modeling
CN102930594B (en) Rendering method for computer three-dimensional terrain grid based on boundary maintenance
CN101872492A (en) Multi-angle map implementation method of three-dimensional simulation city
CN107918957B (en) Three-dimensional building model simplification method capable of keeping structure and texture characteristics
EP2518443B1 (en) Method of generating a database, navigation device and method of determining height information
CN113066157B (en) CIM platform-based data hierarchical request rendering method and system
CN102930601B (en) A kind of construction method of dual-mode three-dimensional terrain stereo environment
JP2017174393A (en) Multi-resolution image system
CN102779165A (en) Building method of grid map picture base
CN110070616A (en) Memory, statistical data rendering method, device and equipment based on GIS platform
CN103345507A (en) Three-dimensional map dynamic loading method based on collision box principle
CN102117495A (en) New data partitioning method and device in three-dimensional modeling
Zhang et al. A geometry and texture coupled flexible generalization of urban building models
CN102117493A (en) Method and device for updating data in three-dimensional modeling
CN104090945B (en) Geographic space entity constructing method and system
AU2013399651B2 (en) Global grid building in reverse faulted areas by an optimized unfaulting method
CN102117288A (en) Method and device used for searching modeling data in three-dimensional modeling
CN103034999A (en) Pyramid slicing method based on dynamic effect model (DEM) data
CN113849498B (en) Index construction and query method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20150218

Termination date: 20161230