CN102141999B - Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes - Google Patents
Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes Download PDFInfo
- Publication number
- CN102141999B CN102141999B CN 201010107646 CN201010107646A CN102141999B CN 102141999 B CN102141999 B CN 102141999B CN 201010107646 CN201010107646 CN 201010107646 CN 201010107646 A CN201010107646 A CN 201010107646A CN 102141999 B CN102141999 B CN 102141999B
- Authority
- CN
- China
- Prior art keywords
- tin
- dem
- data
- blocks
- dummy 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for storing a TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes. In the invention, data sources are judged firstly, and then different methods are used according to different data sources. When the data sources are original data, grids are established through the existing algorithm for constructing an irregular triangulation network; then, the size of blocks is determined according to the requirements of a user; and block storage is carried out on the triangulation network by utilizing the method based on the virtual nodes so that the whole region only can be covered by only one network logically. When the data sources are the existing TIN-DEM block products, the data sources are organized into blocks with the size meeting the requirements of the user through preprocessing operations such as segmentation and combination, and then index arrangement and storage are carried out block by block. The method disclosed by the invention has large practical values when applied to TIN-DEM products, can enhance the storage and updating efficiency of a TIN library, can simplify a production flow in the production and update of the DEM with multiple scales, shortens the production cycle and reduces the labor intensity.
Description
Technical field
The invention belongs to computer application field, relate in particular to a kind of TIN-DEM storage means based on dummy node.
Background technology
Digital elevation model (DEM) is more and more important as a kind of special effect of spatial data content in NSDI.In order to satisfy the various demands to large scale basic data collection, extensive dem data usually uses the large scale basic data source and produces with very high precision and resolution.Particularly TIN digital ground elevation model (TIN-DEM) demand is increasing, yet the data of magnanimity make the storage administration to data become increasingly complex, and existing storage means can not satisfy the storage administration to the TIN-DEM data of magnanimity.
Summary of the invention
Problem to be solved by this invention is: a kind of method of TIN ground elevation model data of the storage magnanimity based on dummy node is provided, improves storage and updating efficiency.
Technical scheme provided by the invention is: the storage means of a kind of TIN-DEM based on dummy node may further comprise the steps:
Step 2 makes up the TIN-DEM net according to raw data, with the data volume that the TIN-DEM net that structure is good is perhaps given tacit consent to according to user's request, adopts based on the mode of dummy node and carries out the piece division, obtains some TIN-DEM blocks of data, gets into step 4 then;
Said mode based on dummy node is carried out piece and is divided; Be meant and carrying out producing dummy node when piece is divided and adding to divide gained TIN-DEM blocks of data; Wherein dummy node is the intersection point that piece is divided used blueline and TIN-DEM net, and this intersection point does not exist in the constructed TIN-DEM net of raw data;
Step 3 is carried out pre-service to the scope and the size of existing TIN-DEM blocks of data, gets into step 4 then; Said pretreatment mode does, if the scope of certain TIN-DEM blocks of data and size have surpassed the preset upper limit value, then this TIN-DEM blocks of data is adopted based on the mode of dummy node and carries out the piece cutting; If the piece scope of certain TIN-DEM blocks of data less than the predetermined lower limit value, is then spliced this TIN-DEM blocks of data;
Said mode based on dummy node is carried out the piece cutting; Be meant when carrying out the piece cutting, to produce dummy node and add and cut apart gained TIN-DEM blocks of data; Wherein dummy node is that piece is cut apart used blueline and the intersection point of being cut apart the TIN-DEM blocks of data, and this intersection point is cut apart in the TIN-DEM blocks of data at quilt and do not existed; Step 4 is carried out the index layout to all TIN-DEM blocks of data, and as requested the TIN-DEM blocks of data is derived or go into library storage.
Characteristics of the present invention: this method can be suitable for the efficient storage of magnanimity TIN digital ground elevation model data.Difference according to data source; Through using different cutting apart and processing procedure such as merging based on dummy node; Realizing after the storage that logically whole regional one throws the net, is that unit stores and permutation index with the piece in the time of actual storage, has improved storage and updating efficiency.Earlier data storage is earlier imported to database hereof again during concrete the storage, can take into account file user and database user simultaneously, the dirigibility of document retaining storage mode; File and database are consistent, comprise the layout of piece, index of piece or the like.
Description of drawings
Fig. 1 is the embodiment of the invention makes up the TIN-DEM net from raw data a synoptic diagram;
Fig. 2 is the synoptic diagram of the embodiment of the invention to the cutting of TIN-DEM net;
Fig. 3 merges two triangulation network synoptic diagram before in the embodiment of the invention;
Fig. 4 is the area schematic that sign needs reconstruct and optimization in the embodiment of the invention
Fig. 5 merges triangulation network synoptic diagram afterwards in the embodiment of the invention;
Fig. 6 is a piece index synoptic diagram in the embodiment of the invention.
Embodiment
Followingly with reference to Fig. 1-6 and embodiment technical scheme of the present invention is described, the performing step of embodiment is following:
Step 2 is carried out network forming according to raw data, adopts the structure TIN algorithm of prior art to get final product, and the present invention will not give unnecessary details.Like Fig. 1 is the TIN-DEM net that builds.Then the TIN-DEM net that structure is good being carried out piece according to the data volume of user's request or acquiescence divides.If block is divided in the intersection point of used blueline and TIN-DEM net; When non-existent dummy node is arranged in the constructed TIN-DEM of the raw data net; This dummy node is joined in the data of existing network forming, in order to avoid it is imperfect to divide the vertex data of gained TIN-DEM blocks of data.As shown in Figure 2, the point of white is empty summit, and the point of black is the point of raw data data centralization, and dotted line is empty limit, gets into step 4 then.
Step 3 is carried out pre-service to the scope and the size of existing TIN-DEM blocks of data, and promptly if block scope and size have surpassed the preset upper limit value, then need cut piece; The if block scope then need be spliced this piece less than the predetermined lower limit value.
When an existing TIN-DEM blocks of data is carried out cutting operation, consistent with the mode of TIN-DEM net piecemeal in the step 2.Can obtain the intersection point with the existing triangulation network along the piece cut-off rule, will non-existent intersection point be added to dummy node in the TIN-DEM blocks of data being cut apart, and note.Like this, cut apart two new pieces of gained the public intersection point that cut-off rule produced is all arranged.
When carrying out the edge fit union operation,, only need judge whether it is same point in the time of edge fit or merging along the block boundary that dummy node is arranged owing to have the existence of dummy node.If two or more than piece to be combined when having a dummy node to be respectively at same that overlaps, this point deletion is got final product.
Embodiment at first finds adjacent two pieces according to coordinate and Given information when splicing, shown in Figure 3 is two adjacent blocks: piecemeal A and piecemeal B.Connect two pieces bottom with summit topmost, the delta-shaped region that can obtain carrying out reconstruct and optimization promptly is the dash area of Fig. 4.In this zone, carrying out reconstruct gets final product with the optimization triangulation network.Fig. 5 is that frame of broken lines then is a former scope through the triangulation network after handling.Get into step 4 then.
Step 4 is carried out the index layout to all TIN-DEM blocks of data.The character string that time standby " Scale_X_Y " mode that embodiment encodes at index connects is as the filename of piece.Wherein, Scale representes the engineer's scale size of this piece, is exactly 10000 as 1: 1 ten thousand; X representes the row of this piece in this net number (since 0); Y representes the row of this piece in this net number (since 0).As shown in Figure 6, according to from left to right, order is from top to bottom come the index of piece of tissue, from left to right since 0 be row number, from top to bottom since 0 be the row number.Be example with four pieces among the figure, be encoded to 1000_1_0,1000_1_1,1000_0_0,1000_0_1 respectively.Earlier hereof, import database by file then during concrete the storage with the storage of TIN net.
Claims (1)
1. TIN-DEM storage means based on dummy node, said TIN-DEM is a TIN digital ground elevation model, may further comprise the steps:
Step 1, the judgment data source, if data source be raw data then get into step 2, if data source is existing TIN-DEM blocks of data then gets into step 3;
Step 2 makes up the TIN-DEM net according to raw data, with the data volume that the TIN-DEM net that structure is good is perhaps given tacit consent to according to user's request, adopts based on the mode of dummy node and carries out the piece division, obtains some TIN-DEM blocks of data, gets into step 4 then;
Said mode based on dummy node is carried out piece and is divided; Be meant and carrying out producing dummy node when piece is divided and adding to divide gained TIN-DEM blocks of data; Wherein dummy node is the intersection point that piece is divided used blueline and TIN-DEM net, and this intersection point does not exist in the constructed TIN-DEM net of raw data;
Step 3 is carried out pre-service to the scope and the size of existing TIN-DEM blocks of data, gets into step 4 then; Said pretreatment mode does, if the scope of certain TIN-DEM blocks of data and size have surpassed the preset upper limit value, then this TIN-DEM blocks of data is adopted based on the mode of dummy node and carries out the piece cutting; If the piece scope of certain TIN-DEM blocks of data less than the predetermined lower limit value, is then spliced this TIN-DEM blocks of data;
Said mode based on dummy node is carried out the piece cutting; Be meant when carrying out the piece cutting, to produce dummy node and add and cut apart gained TIN-DEM blocks of data; Wherein dummy node is that piece is cut apart used blueline and the intersection point of being cut apart the TIN-DEM blocks of data, and this intersection point is cut apart in the TIN-DEM blocks of data at quilt and do not existed;
When carrying out the edge fit union operation; Only need judge whether it is same point in the time of edge fit or merging along the block boundary that dummy node is arranged; If two or more than piece to be combined when having a dummy node to be respectively at same that overlaps, with this point deletion;
Step 4 is carried out the index layout to all TIN-DEM blocks of data, and as requested the TIN-DEM blocks of data is derived or go into library storage.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010107646 CN102141999B (en) | 2010-02-02 | 2010-02-02 | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010107646 CN102141999B (en) | 2010-02-02 | 2010-02-02 | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102141999A CN102141999A (en) | 2011-08-03 |
| CN102141999B true CN102141999B (en) | 2012-12-05 |
Family
ID=44409523
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010107646 Expired - Fee Related CN102141999B (en) | 2010-02-02 | 2010-02-02 | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102141999B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105205095B (en) * | 2015-08-14 | 2019-03-26 | 中国地质大学（武汉） | A kind of quick storage and querying method of irregular Grid square |
| CN108924205B (en) * | 2018-06-25 | 2022-09-06 | 北京旷视科技有限公司 | Data transmission method and device, electronic equipment and gatekeeper adapter |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1956009A (en) * | 2005-10-26 | 2007-05-02 | 北京航空航天大学 | Presenting method of large scale three-D data set |
| CN1959670A (en) * | 2005-11-02 | 2007-05-09 | 北京灵图软件技术有限公司 | Method for storing topographic image data in pyramid architecture |
| CN101354710A (en) * | 2008-07-10 | 2009-01-28 | 北京超图软件股份有限公司 | Method and apparatus of line segment intersection |
| CN101488141A (en) * | 2008-12-16 | 2009-07-22 | 南京莱斯大型电子***工程有限公司 | Electronic map data processing method |
-
2010
- 2010-02-02 CN CN 201010107646 patent/CN102141999B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1956009A (en) * | 2005-10-26 | 2007-05-02 | 北京航空航天大学 | Presenting method of large scale three-D data set |
| CN1959670A (en) * | 2005-11-02 | 2007-05-09 | 北京灵图软件技术有限公司 | Method for storing topographic image data in pyramid architecture |
| CN101354710A (en) * | 2008-07-10 | 2009-01-28 | 北京超图软件股份有限公司 | Method and apparatus of line segment intersection |
| CN101488141A (en) * | 2008-12-16 | 2009-07-22 | 南京莱斯大型电子***工程有限公司 | Electronic map data processing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102141999A (en) | 2011-08-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106326580B (en) | A kind of elevated structure BIM model modeling design method | |
| CN106776963B (en) | The online method for visualizing of light-weighted BIM big data and system | |
| CN105549548B (en) | Three-dimensional assembly technique generation method and generating means | |
| CN102254029B (en) | View-based data access system and method | |
| CN103871102B (en) | A kind of road three-dimensional fine modeling method based on elevational point and road profile face | |
| JP6345873B2 (en) | Method and apparatus for building a demand metamodel for high-speed trains | |
| CN106133766A (en) | For calculating, apply and show the system and method for document increment | |
| CN107018031A (en) | A kind of car networking fast Optimization calculated based on mist | |
| CN109408521A (en) | A kind of method and device thereof for more new block chain global data state | |
| CN105574643A (en) | Real-time data center and big data platform fusion method for power grid | |
| CN104978411A (en) | Train model development method and apparatus for high-speed train | |
| CN104573915A (en) | Method and device for constructing high-speed train product structure tree | |
| CN105447253A (en) | Three-dimensional process data integration method | |
| CN104239653A (en) | Casting three-dimensional process designing method | |
| CN104392037A (en) | City scene parameterization modeling system | |
| CN105279269A (en) | SQL generating method and system for supporting table free association | |
| CN105893655A (en) | Physical simulation method for petroleum reservoir architecture | |
| CN105426590A (en) | Machining process feature tree and construction method thereof | |
| US20230147594A1 (en) | Method for integratedly updating map data, device and storage medium | |
| CN111078094A (en) | Distributed machine learning visualization device | |
| CN102141999B (en) | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes | |
| CN104574517A (en) | Processing method and device for boundary surface grid cell of three-dimensional model | |
| CN104392035B (en) | A kind of urban three-dimensional modeling method of sing on web | |
| CN103441988B (en) | Across GIS platform data migration method | |
| Bast et al. | Efficient generation of geographically accurate transit maps |
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: 20121205 Termination date: 20160202 |