CN1959670A - Method for storing topographic image data in pyramid architecture - Google Patents
Method for storing topographic image data in pyramid architecture Download PDFInfo
- Publication number
- CN1959670A CN1959670A CN 200510117338 CN200510117338A CN1959670A CN 1959670 A CN1959670 A CN 1959670A CN 200510117338 CN200510117338 CN 200510117338 CN 200510117338 A CN200510117338 A CN 200510117338A CN 1959670 A CN1959670 A CN 1959670A
- Authority
- CN
- China
- Prior art keywords
- data
- pyramid
- tile
- current tile
- current
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A method of using pyramid structure to store topographic image data includes confirming data accuracy and lattice number in pyramid library, obtaining original data and geographical range, cutting original data to be Rajchmans and confirming current Rajchman storage position in data layer of pyramid, forming complete quadtree of current Rajchman upwards from confirmed storage position, updating a corresponding data of quadtree father node existed with current Rajchman upwards from said storage position till to top layer.
Description
Technical field
The present invention relates to a kind of date storage method, relate in particular to a kind of method with pyramid architecture storage landform image data.
Background technology
Gradually the increasing of the related geographic range of GIS (Geographic Information System, Geographic Information System), using wider is the city level range, maximum even develop into global range.Along with the expansion of geographic range, the data of its use also increase thereupon.The management of mass data and application have become the various serious bottlenecks that are applied to the system of image/terrain data (being referred to as grid data hereinafter) of restriction.
The orthography data are generally taked the mode of framing management, promptly according to certain rule, the data of entire city are divided into some, and numbering, are easy to management.For a large size city, common 0.5 meter about thousands of width of cloth of resolution orthography data, about about 100M, total amount is greatly about about hundreds of G greatly for each width of cloth.
For the ease of in d engine, using even carrying out Web publishing, usually original mesh is carried out pre-service.Method commonly used now is to make up tile pyramid library storage grid data.Pyramid is a kind of hierarchical model of multiresolution.The different different data precisions of layer representative, the geographic range of different layers is identical.When needs different accuracy data, extract from different data Layers, needn't carry out real-time resampling, reduced the data read amount simultaneously.
The original mesh data generally are divided into two kinds of terrain data and orthography data.Terrain data also is called the digital elevation model data.Generally directly comprise parameters such as geographic range, data precision in the raw data.The orthography data generally comprise the registration file, can directly obtain the geographic range of image by the registration file, can calculate the precision of map sheet by the number of picture elements of registration file and image.
The tile pyramid as shown in Figure 1, cuts into fixed size with the data of each layer exactly in pyramid, obtain the little blocks of data that the scope that is extracted is surrounded from corresponding layer when extracting data.The tile pyramid model has further reduced data in real time work of treatment amount, makes that the algorithm that calls data is simple, and it is fast to call speed.Pyramidal these characteristics of tile are extremely important for the massive terrains real-time visual.
The system that is applied to the image storehouse of comparative maturity all takes the framework in this pyramid storehouse at present, when pre-service, at first the original mesh data are regarded as a whole image data, cut into the data block of same yardstick then, for example, the raw video data are 1000 * 1000 pixels, resolution is 1 meter/pixel, it is 256 * 256 data block that 100 width of cloth raw data like this are cut into grid number, this just requires raw data is combined into a secondary big image, reads out 256 * 256 data block then successively.
Then high-precision raw data vacuate is become the identical rough grade data block of data volume.The data precision of pyramidal each layer of data does not have unified regulation, and the relation between layer and the layer is also uncertain.Usually in use according to the needs of using, can specifically define the precision of each layer.For example, begin to be respectively 1 meter, 2 meters, 5 meters, 10 meters every pixels etc. from bottom to the precision on upper strata.The data of each layer can directly be extracted from raw data, also can be from the data extract of lower floor than higher precision.Extraction can be used different algorithms, and fairly simple algorithm is the pixel that generates the rough grade data according to the average of the high accuracy data of geographic range.
If represent four data blocks with two pieces, Fig. 2 A-Fig. 2 C has just expressed the pyramidal construction step of present tile.At first the original mesh data as pyramidal bottom, promptly the 0th layer, and it is carried out piecemeal, form the 0th layer tile matrix.On the 0th layer basis, be combined into the method for a grid according to per 2 * 2 grids, generate the 1st layer of tile matrix.So circulation is gone down, and forms the tile pyramid.
This shows that existing method with pyramid architecture storage landform image data is to merge toward high-rise rough grade data from the high-precision data of bottom.Production run is to be unit with the layer, successively increases progressively.From its building process it can also be seen that tile pyramidal be a kind of typical quad-tree structure.
This algorithm comparison operators that successively upwards merges closes pyramidal physical significance, and is relatively simple for structure clear.But this method is to be that unit comes deal with data with the layer, relatively is fit to handle the data of a large amount of same precision, can't deal with data precision complicated situation.And wherein do not comprise the information that covers mutually about the separate sources data, so can't realize the fusion of different accuracy data.
Summary of the invention
Technical matters to be solved by this invention is to provide a kind of method with pyramid architecture storage landform image data, to solve the fusion problem of different accuracy data.
The invention provides a kind of method, comprise the steps: with tile pyramid architecture storage landform image data
(1) determines the data precision and the grid number of each data Layer in the pyramid storehouse;
(2) obtain raw data, and the precision of definite raw data, and geographic range;
(3) according to the grid number of the pyramid data Layer identical, raw data is cut into tile with the raw data precision;
(4) determine current tile, and according to the geographic range of current tile, determine the memory location of current tile in the described pyramid data Layer identical with the raw data precision;
(5), upwards generate the complete quaternary tree at this current tile place from described definite memory location;
(6) this current tile is put into described definite memory location,, upwards upgrade the corresponding data of the father node of this current tile place quaternary tree from this memory location, until top layer according to the data of this current tile.
Wherein, in the described step (2), can further comprise step: give raw data cover grade attribute;
In the described step (5), when generating the complete quaternary tree at current tile place,, then stop search, and establish this node that searches for articulating a little if in the searching route of effective father node, find that certain one-level father node or present node exist;
Described step (6) enters in the pyramid process at current tile, if the described cover grade that articulates a legacy data is higher than the cover grade of current tile data, then these current tile data stop to enter pyramid; If the described cover grade that articulates a legacy data is lower than the cover grade of current tile data, then current tile data enter pyramid, cover legacy data, and upwards upgrade.
Wherein, described covering legacy data, and in the renewal process that makes progress, if below the tile that is capped child node is arranged, then child node is deleted.
Wherein, if the described cover grade that articulates a legacy data is higher than the cover grade of current tile data, then these current tile data stop to enter the pyramid step, may further include following steps:
Detect in original tile data and whether have invalid data;
If there is invalid data, then in the data of current tile extracting data appropriate section, to replace the invalid data part in original tile data.
Wherein, if the described cover grade that articulates a legacy data is lower than the cover grade of current tile data, then current tile data enter pyramid, cover the legacy data step, may further include following steps:
Detect in the current tile data and whether have invalid data;
If there is invalid data, then when covering original tile data, keep the data corresponding with the invalid part of current tile data.
The pyramidal construction method of quaternary tree tile provided by the invention, use with the tile quaternary tree and replaced traditional construction method that successively makes progress as the construction method of benchmark, and with technology actings in conjunction such as cover grade, grid mask, become the magnanimity tile pyramid construction method of a perfect fusion multiple precision number certificate.
Description of drawings
Fig. 1 is the synoptic diagram that is used for the existing tile pyramid architecture of save mesh data;
Fig. 2 A-Fig. 2 C is existing process synoptic diagram with pyramid architecture storage network management data;
Fig. 3 is according to embodiments of the invention, with the schematic flow sheet of pyramid architecture save mesh data;
Fig. 4 A-Fig. 4 D is according to the described pyramid construction mode synoptic diagram based on quaternary tree of embodiments of the invention;
Fig. 5 A-Fig. 5 C is according to the described synoptic diagram based on the different situations in the pyramid construction mode of quaternary tree of embodiments of the invention;
Fig. 6 is for merging the situation synoptic diagram of the raw data of different accuracy according to the described use cover grade of embodiments of the invention.
Embodiment
As shown in Figure 3, for according to embodiments of the invention, with the schematic flow sheet of pyramid architecture save mesh data.At first, determine the data precision and the grid number (step 301) of each data Layer in the pyramid storehouse; Obtain raw data then, and the precision of definite raw data, and geographic range (step 302); Grid number according to the pyramid data Layer identical with the raw data precision is cut into tile (step 303) with raw data; Determine current tile, and according to the geographic range of current tile, determine the memory location (step 304) of current tile in the described pyramid data Layer identical with the raw data precision; From described definite memory location, upwards generate the complete quaternary tree (step 305) at this current tile place; This current tile is put into described definite memory location, and this position is set is leafy node (step 306); According to the data of this current tile, upwards upgrade the corresponding data of the father node of this current tile place quaternary tree from this leafy node, until top layer (step 307).
Pyramid construction mode based on quaternary tree of the present invention with the maximum difference of prior art is: no longer be to pyramidal layer, and whole renewal from top to bottom, but based on the update method of raw data.Be exactly each width of cloth original data storage when going in pyramid in simple terms, the data that all layers are identical with the raw data geographic range in the pyramid all can be upgraded.Below in conjunction with accompanying drawing, embodiments of the invention are further introduced.
Shown in Fig. 4 A, first raw data is cut into tile earlier.Before first tile enters pyramid, in pyramid, at first generate the complete quaternary tree at this tile place.
Shown in Fig. 4 B, tile is placed on the data Layer identical with the raw data precision in the pyramid storehouse for another example, and current piece is set is leafy node that expression lower floor does not have data block.
For another example shown in Fig. 4 C, upwards upgrade the data of father node of the quaternary tree at current tile place, up to top layer.
Then, shown in Fig. 4 D, the complete quaternary tree at second tile place of regeneration is put into pyramid with second tile data then; So circulation is put into pyramid fully up to first width of cloth raw data.
In Fig. 4 D, the tile that data generate in the map sheet is adjacent, and precision is identical.So in the pyramid storehouse, generally be in position adjacent.
The new raw data that obtains all repeats top process equally.
The precision of the new raw data that obtains may be different with the precision of past data, and geographically also may be non-conterminous with legacy data.Can be any situation among Fig. 5 A-Fig. 5 C, left-half be represented the more new situation of data among the figure, and data block length is up and down represented geographic range, no matter all data block length, data volume is all identical.Right half part is represented the quad-tree structure of pyramid in building process.
Fig. 5 A represents an adjacent tile with legacy data.But Fig. 5 B represent identical with the legacy data precision on geographic range away from tile.It is different with the legacy data precision that Fig. 5 C represents, and geographic range is inequality.
Repeatedly like this like this, all raw data all enter in the tile pyramid.
From top renewal process as can be seen, in fact more the basis of new data is the tile data.Do not require the raw data all must be in same level, and do not require to enter pyramid in a certain order yet.The raw data of different accuracy enters in the different quaternary trees when different geographic ranges separately.So this is the fusion that the structure pyramid algorith of benchmark can fine solution different accuracy raw data with original map sheet, and algorithm is equally very succinct.
Above-mentioned pyramid architecture storage mode can hold the raw data of different accuracy, but may attract another problem, when there are the data of different accuracy in promptly same geographic position, how to generate pyramidal data block.According to general logic, can only select one as the data in the pyramid storehouse.For this reason, in making data pyramid process, can give raw data attribute, i.e. a cover grade.So-called cover grade is exactly the hiding relation between the raw data.The raw data that cover grade is the highest just can enter the pyramid storehouse.After being made into the data pyramid, kept the information of data cover grades in the data block, accept or reject when having geographic range overlapping in order to data.The configuration foundation of the cover grade of raw data mainly is accuracy relation and the historical factor that covers between the different pieces of information of areal, and can according to this according to and adjust it.
Cover grade also is the priority that shows in same geographic range different pieces of information, has only the highest data of cover grade to show.Data pyramid storehouse generally all is stored in the database, except preserving grid data, has also preserved cover grade in the tile data.Cover grade is the attribute of raw data, has inherited the cover grade of raw data after the tile data enter pyramid.Introduce to use it to merge two kinds of situations of raw data of the different cover grades of same geographic range below:
1, stops entering of new data;
In the flow process that makes referrals to above, the data when afterwards enter pyramidal the time, need to generate earlier the complete quaternary tree at current tile place.And there has been a complete quaternary tree in the pyramid.If there is identical node in new complete quaternary tree of creating with the quaternary tree that has existed, then initiate quaternary tree is the equal of to be articulated in original quaternary tree.In the process that generates new quaternary tree, if find corresponding node or father node to exist, and cover grade is higher than the cover grade of current raw data, and then current raw data no longer attempts to enter the pyramid storehouse.
As shown in Figure 6, cover grade be 3 current raw data when upwards creating quaternary tree, at first search for an effective father node.Exist if find in the path of search certain one-level father node or current node, then search is ended, and this node that searches articulates a little exactly.If the cover grade that articulates a little is higher than current tile data, then this tile does not just enter pyramid.As can be seen from Figure 6, cover grade is that to have stoped cover grade be that 3 data slice enters the pyramid storehouse for 4 data tile.
2, new data covers old data;
Make referrals to above, if the cover grade of finding to articulate a little enters the cover grade of pyramidal tile less than current preparation, the data of then newly arriving enter pyramid, and upwards renewal, cover original data, and as shown in Figure 6, cover grade is 6 data.If below the tile that is capped child node is arranged, then child node is deleted.
In addition, under a lot of situations, the pyramidal original mesh data of actual generation often all can not just in time be cut into the tile data of monoblock, some tile DATA DISTRIBUTION are always arranged at the edge of data, and causing wherein, a part is invalid.Another part data of tile need other original map sheet data to fill.Invalid data are filled mask at corresponding grid position when entering the pyramid storehouse.That is to say, when the raw data when afterwards enters pyramid, must be able to recognize data block and whether have invalid data, and can identify concrete inactive pixels, so that use the valid data of oneself to replace them.
Like this, superincumbent new covers old, perhaps old when covering new piece, all has a problem.For example, during the new tile data of the data organization of original high cover grade, the method for introducing is above only mentioned stoping and is entered in the pyramid storehouse.This is old disposal route when being active data fully in the storehouse in fact.If the tile data division that articulates a little is invalid, then invalid part should be come out fill from new extracting data.
In like manner, if having invalid data in the tile data of newly arriving, and cover grade is higher than the tile in the storehouse.Should extract filling with the invalid data part this time from original tile when covering.
At present, although the different terrain image data is had different mask treating methods, principle all is identical.In an embodiment of the present invention, can use 32 integer value representation to the pixel in the data block, the rgb value of three byte representation colors wherein, each data block has a sign about mask, shows whether this data block contains invalid data.In addition each pixel byte representation the validity of this pixel, if a pixel is an invalid value, then the most significant digit of mask byte is set to 1, this most significant digit just is called masked bits.Be the workflow of mask rule below:
When being introduced into pyramidal data block and comprising invalid data, the mask that piece is set is masked as and comprises invalid data, and the masked bits of invalid data is changed to 1.After enter the pyramidal data block of data, at first detect the cover grade of data, if the cover grade of data was lower than data with existing afterwards, and there is not invalid data in data with existing, then data can't enter the data pyramid afterwards; If the cover grade of data was lower than data with existing afterwards, and data with existing comprises invalid data, then retrieve the invalid part of data with existing one by one, if the data of newly arriving on these positions are effective, then use new pixel to be filled on the corresponding position, like this, the data in the pyramid are just complete.
Claims (7)
1, a kind of method with tile pyramid architecture storage landform image data is characterized in that, comprises the steps:
(1) determines the data precision and the grid number of each data Layer in the pyramid storehouse;
(2) obtain raw data, and the precision of definite raw data, and geographic range;
(3) according to the grid number of the pyramid data Layer identical, raw data is cut into tile with the raw data precision;
(4) determine current tile, and according to the geographic range of current tile, determine the memory location of current tile in the described pyramid data Layer identical with the raw data precision;
(5), upwards generate the complete quaternary tree at this current tile place from described definite memory location;
(6) this current tile is put into described definite memory location,, upwards upgrade the corresponding data of the father node of this current tile place quaternary tree from this memory location, until top layer according to the data of this current tile.
2, the method for claim 1 is characterized in that, in the described step (2), further comprises step: give raw data cover grade attribute;
In the described step (5), when generating the complete quaternary tree at current tile place,, then stop search, and establish this node that searches for articulating a little if in the searching route of effective father node, find that certain one-level father node or present node exist;
In the described step (6), enter in the pyramid process at current tile, if the described cover grade that articulates a legacy data is higher than the cover grade of current tile data, then these current tile data stop to enter pyramid; If the described cover grade that articulates a legacy data is lower than the cover grade of current tile data, then current tile data enter pyramid, cover legacy data, and upwards upgrade.
3, method as claimed in claim 2 is characterized in that, described covering legacy data, and in the renewal process that makes progress, if below the tile that is capped child node is arranged, then child node is deleted.
4, method as claimed in claim 2 is characterized in that, if the described cover grade that articulates a legacy data is higher than the cover grade of current tile data, then these current tile data stop to enter the pyramid step, further comprise the steps:
Detect in original tile data and whether have invalid data;
If there is invalid data, then in the data of current tile extracting data appropriate section, to replace the invalid data part in original tile data.
5, method as claimed in claim 2 is characterized in that, if the described cover grade that articulates a legacy data is lower than the cover grade of current tile data, then current tile data enter pyramid, covers the legacy data step, further comprises the steps:
Detect in the current tile data and whether have invalid data;
If there is invalid data, then when covering original tile data, keep the data corresponding with the invalid part of current tile data.
6, the method for claim 1 is characterized in that, in the described step (6), this current tile is put into described definite memory location step, and further comprise step: it is leafy node that this memory location is set.
7, method as claimed in claim 2 is characterized in that, the described raw data cover grade attribute step of giving is to carry out according to the accuracy relation and the historical factor that cover between the areal different pieces of information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101173386A CN100489848C (en) | 2005-11-02 | 2005-11-02 | Method for storing topographic image data in pyramid architecture |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101173386A CN100489848C (en) | 2005-11-02 | 2005-11-02 | Method for storing topographic image data in pyramid architecture |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1959670A true CN1959670A (en) | 2007-05-09 |
| CN100489848C CN100489848C (en) | 2009-05-20 |
Family
ID=38071372
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005101173386A Active CN100489848C (en) | 2005-11-02 | 2005-11-02 | Method for storing topographic image data in pyramid architecture |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100489848C (en) |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101789028A (en) * | 2010-03-19 | 2010-07-28 | 苏州广达友讯技术有限公司 | Search engine for geographical position and constructing method thereof |
| CN101887595A (en) * | 2009-05-14 | 2010-11-17 | 武汉如临其境科技创意有限公司 | Three-dimensional digital earth-space data organizing and rendering method based on quad-tree index |
| CN101963996A (en) * | 2010-10-29 | 2011-02-02 | 中国科学院地理科学与资源研究所 | Global raster data storing method |
| CN102116862A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | Shuttle radar topography mission (SRTM) data processing method and device suitable for map projection transformation |
| CN102117288A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | Method and device used for searching modeling data in three-dimensional modeling |
| CN102117495A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | New data partitioning method and device in three-dimensional modeling |
| CN101339570B (en) * | 2008-08-12 | 2011-12-07 | 北京航空航天大学 | Efficient distributed organization and management method for mass remote sensing data |
| CN102395965A (en) * | 2009-04-17 | 2012-03-28 | 弗兰霍菲尔运输应用研究公司 | Method for searching objects in a database |
| CN101415018B (en) * | 2007-10-17 | 2012-08-29 | 北京灵图软件技术有限公司 | Transmission method and system for geographical message data |
| CN102750870A (en) * | 2011-08-26 | 2012-10-24 | 新奥特（北京）视频技术有限公司 | Method and system for processing multi-projection-mode geographic data |
| CN102750294A (en) * | 2011-08-10 | 2012-10-24 | 新奥特（北京）视频技术有限公司 | Method, device and system for generating topography image data |
| CN102141999B (en) * | 2010-02-02 | 2012-12-05 | 武汉大学 | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes |
| CN102999573A (en) * | 2012-11-09 | 2013-03-27 | 中国铁道科学研究院电子计算技术研究所 | Cache updating method for stripped GIS (Geographic Information System) map elements |
| CN103336772A (en) * | 2013-04-25 | 2013-10-02 | 中国科学院遥感与数字地球研究所 | Novel organization method of single-scene image tile data |
| CN103678501A (en) * | 2013-11-18 | 2014-03-26 | 航天恒星科技有限公司 | Extra-large remote sensing image display method based on pyramids and image rendering engine |
| CN102117493B (en) * | 2009-12-30 | 2015-04-29 | 新奥特（北京）视频技术有限公司 | Method and device for updating data in three-dimensional modeling |
| CN105956165A (en) * | 2016-05-20 | 2016-09-21 | 江苏得得空间信息科技有限公司 | Tile type large file organization storage method of three-dimensional model data |
| CN102750870B (en) * | 2011-08-26 | 2016-12-14 | 新奥特（北京）视频技术有限公司 | A kind of method and system processing many projection mode geodata |
| CN107430692A (en) * | 2015-04-02 | 2017-12-01 | 高通股份有限公司 | The computation levels computing calculated for computer vision |
| CN111190894A (en) * | 2018-11-15 | 2020-05-22 | 阿里巴巴集团控股有限公司 | Map display method and device, related storage medium and client |
| CN111630523A (en) * | 2018-05-21 | 2020-09-04 | 华为技术有限公司 | Image feature extraction method and device |
-
2005
- 2005-11-02 CN CNB2005101173386A patent/CN100489848C/en active Active
Cited By (32)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101415018B (en) * | 2007-10-17 | 2012-08-29 | 北京灵图软件技术有限公司 | Transmission method and system for geographical message data |
| CN101339570B (en) * | 2008-08-12 | 2011-12-07 | 北京航空航天大学 | Efficient distributed organization and management method for mass remote sensing data |
| CN102395965A (en) * | 2009-04-17 | 2012-03-28 | 弗兰霍菲尔运输应用研究公司 | Method for searching objects in a database |
| CN102395965B (en) * | 2009-04-17 | 2015-07-15 | 弗兰霍菲尔运输应用研究公司 | Method for searching objects in a database |
| US8886652B2 (en) | 2009-04-17 | 2014-11-11 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Method for searching objects in a database |
| CN101887595A (en) * | 2009-05-14 | 2010-11-17 | 武汉如临其境科技创意有限公司 | Three-dimensional digital earth-space data organizing and rendering method based on quad-tree index |
| CN101887595B (en) * | 2009-05-14 | 2014-05-28 | 武汉如临其境科技创意有限公司 | Three-dimensional digital earth-space data organizing and rendering method based on quad-tree index |
| CN102116862B (en) * | 2009-12-30 | 2014-06-04 | 新奥特（北京）视频技术有限公司 | Shuttle radar topography mission (SRTM) data processing method and device suitable for map projection transformation |
| CN102117288A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | Method and device used for searching modeling data in three-dimensional modeling |
| CN102117495A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | New data partitioning method and device in three-dimensional modeling |
| CN102117493B (en) * | 2009-12-30 | 2015-04-29 | 新奥特（北京）视频技术有限公司 | Method and device for updating data in three-dimensional modeling |
| CN102116862A (en) * | 2009-12-30 | 2011-07-06 | 新奥特（北京）视频技术有限公司 | Shuttle radar topography mission (SRTM) data processing method and device suitable for map projection transformation |
| CN102141999B (en) * | 2010-02-02 | 2012-12-05 | 武汉大学 | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes |
| CN101789028A (en) * | 2010-03-19 | 2010-07-28 | 苏州广达友讯技术有限公司 | Search engine for geographical position and constructing method thereof |
| CN101789028B (en) * | 2010-03-19 | 2012-03-21 | 苏州广达友讯技术有限公司 | Search engine for geographical position and constructing method thereof |
| CN101963996B (en) * | 2010-10-29 | 2013-02-13 | 中国科学院地理科学与资源研究所 | Global raster data storing method |
| CN101963996A (en) * | 2010-10-29 | 2011-02-02 | 中国科学院地理科学与资源研究所 | Global raster data storing method |
| CN102750294A (en) * | 2011-08-10 | 2012-10-24 | 新奥特（北京）视频技术有限公司 | Method, device and system for generating topography image data |
| CN102750294B (en) * | 2011-08-10 | 2017-09-19 | 新奥特（北京）视频技术有限公司 | A kind of generation method of landform image data, generating means and generation system |
| CN102750870B (en) * | 2011-08-26 | 2016-12-14 | 新奥特（北京）视频技术有限公司 | A kind of method and system processing many projection mode geodata |
| CN102750870A (en) * | 2011-08-26 | 2012-10-24 | 新奥特（北京）视频技术有限公司 | Method and system for processing multi-projection-mode geographic data |
| CN102999573A (en) * | 2012-11-09 | 2013-03-27 | 中国铁道科学研究院电子计算技术研究所 | Cache updating method for stripped GIS (Geographic Information System) map elements |
| CN102999573B (en) * | 2012-11-09 | 2015-10-28 | 中国铁道科学研究院电子计算技术研究所 | The buffering updating method of ribbon GIS map key element |
| CN103336772A (en) * | 2013-04-25 | 2013-10-02 | 中国科学院遥感与数字地球研究所 | Novel organization method of single-scene image tile data |
| CN103336772B (en) * | 2013-04-25 | 2017-04-12 | 中国科学院遥感与数字地球研究所 | Organization method of single-scene image tile data |
| CN103678501A (en) * | 2013-11-18 | 2014-03-26 | 航天恒星科技有限公司 | Extra-large remote sensing image display method based on pyramids and image rendering engine |
| CN103678501B (en) * | 2013-11-18 | 2016-09-21 | 航天恒星科技有限公司 | A kind of super large remote sensing image display packing based on pyramid and visual renderings engine |
| CN107430692A (en) * | 2015-04-02 | 2017-12-01 | 高通股份有限公司 | The computation levels computing calculated for computer vision |
| CN105956165A (en) * | 2016-05-20 | 2016-09-21 | 江苏得得空间信息科技有限公司 | Tile type large file organization storage method of three-dimensional model data |
| CN105956165B (en) * | 2016-05-20 | 2019-01-18 | 江苏得得空间信息科技有限公司 | A kind of big file storage organization method of the tile type of three-dimensional modeling data |
| CN111630523A (en) * | 2018-05-21 | 2020-09-04 | 华为技术有限公司 | Image feature extraction method and device |
| CN111190894A (en) * | 2018-11-15 | 2020-05-22 | 阿里巴巴集团控股有限公司 | Map display method and device, related storage medium and client |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100489848C (en) | 2009-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1959670A (en) | Method for storing topographic image data in pyramid architecture | |
| CN104199986B (en) | Vector data space index method based on hbase and geohash | |
| CN101477547B (en) | Regulation based spatial data integration method | |
| CN102915227B (en) | Parallel method for large-area drainage basin extraction | |
| CN101916297B (en) | Method for quickly mapping by batch symbolization | |
| CN109992636A (en) | Space-time code method, temporal index and querying method and device | |
| CN111243091B (en) | Massive DEM pyramid slice parallel construction method based on distributed system | |
| CN105303612B (en) | A kind of extract digital network method based on Triangulated irregular network model | |
| CN102722549A (en) | Cluster-based real-time rendering service of remote sensing data set | |
| CN110147377A (en) | General polling algorithm based on secondary index under extensive spatial data environment | |
| CN101719148B (en) | Three-dimensional spatial information saving method, device, system and query system | |
| Aljumaily et al. | Big-data approach for three-dimensional building extraction from aerial laser scanning | |
| CN102663028B (en) | Method suitable for fast spatially-indexing global digital elevation model and remote sensing image data | |
| Chevrier et al. | 3D modelling of a town scale model | |
| CN113312369A (en) | Multi-scale map database cascading updating method based on unique identification code | |
| CN116860905B (en) | Space unit coding generation method of city information model | |
| CN113626550A (en) | Image tile map service method based on triple bidirectional index and optimized cache | |
| KR20170016168A (en) | Tile-based map data updating system and method thereof | |
| CN101840541A (en) | Method for generally surveying resources by utilizing 3S technology and application thereof | |
| CN111143935B (en) | Automatic design method of three-dimensional concrete viaduct | |
| de Berg et al. | Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions | |
| CN110766790A (en) | Parameter-driven self-adaptive multi-level three-dimensional visualization method for high-speed railway bridge | |
| CN102306156A (en) | Method for editing GIS (geographic information system) topological data set interactively | |
| Arge et al. | Computing Floods Caused by Non-Uniform Sea-Level Rise | |
| CN102750737B (en) | A kind of method and system that three-dimensional earth model is created based on quaternary tree |
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 |