CN103268633A - Contour surface construction method for raster data - Google Patents
Contour surface construction method for raster data Download PDFInfo
- Publication number
- CN103268633A CN103268633A CN2013101443182A CN201310144318A CN103268633A CN 103268633 A CN103268633 A CN 103268633A CN 2013101443182 A CN2013101443182 A CN 2013101443182A CN 201310144318 A CN201310144318 A CN 201310144318A CN 103268633 A CN103268633 A CN 103268633A
- Authority
- CN
- China
- Prior art keywords
- contour surface
- feature
- contour
- raster data
- point
- 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.)
- Pending
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A90/00—Technologies having an indirect contribution to adaptation to climate change
- Y02A90/10—Information and communication technologies [ICT] supporting adaptation to climate change, e.g. for weather forecasting or climate simulation
Abstract
The invention provides a contour surface construction method for raster data. The contour surface construction method for the raster data comprises the following steps that firstly the raster data are analyzed, and corresponding contour lines are constructed; on the basis, all Features forming the contour lines are traversed, whether each Feature is intersected by itself is judged, if the judged result is yes, the Feature is directly constructed as a surface Feature of a contour surface, and the contour surface is an island inside a final contour surface; if the judged result is no, a contour surface construction strategy needs to be adopted, all the Features are traversed, the construction process of the contour surface is finished, and finally the construction process of the contour surface corresponding to the raster data is finished through a post-processing method. The algorithm can rapidly realize the construction of the contour surface based on one raster datum (such as an air temperature datum or a rainfall datum), function expansion (like color filling) is carried out regarding different applications, and the contour surface construction method for the raster data can be applied to construction of other similar contour surfaces.
Description
Technical field
The present invention relates to the spacial analytical method in Geographic Information System (GIS) and remote sensing field, specifically, relate to the quick building process based on the raster data implementation space contour surface of remote sensing or GIS, the present invention is applicable to applications such as computer science, GIS, remote sensing.
Background technology
Isoline, contour surface are a kind of data representation methods of widespread use in the applications such as Geographic Information System, remote sensing, terrain analysis, machinery building, isoline, contour surface generating algorithm have realized that the spatial spreading data through different interpolation method formation rule graticule mesh data (raster data), can realize that based on the raster data analytical technology raster data is to the conversion process of vector isoline, contour surface data again.More based on the algorithm of raster data analysis and discrete point analysis formation isoline at present, Surfer software as U.S. GOLDEN software company provides 12 kinds of interpolation methods such as comprising Krieger method, inverse distance weighted method, multiple regression, can satisfy the interpolation demand of different application, and and then generate corresponding isoline.Corresponding list of references comprises: Chi Baoming, Li Zhijun, Ye Yong, Lin Lan, Shi Fengzhi. based on the groundwater level isogram automatic generating calculation research of GIS. Jilin University's journal (geoscience version) .200702, Jiang Yu, Du Bin, Lu Jun, Wang Peng. based on the isoplethes drawing algorithm of the Delaunay triangulation network. computer utility research .201001, katajainen J, koppinen M.Constructing Delaunay Triangulations by Merging Buckets in Quadtree Order.Ann Soc Math Polon Ser IV Fund Inform.1988 etc.
Although the building method of isoline is more, the contour surface building method of greater efficiency seldom at present has rare document to describe isoline in greater detail to the construction process of contour surface very much.The present invention at first on the basis that isoline generates, by the corresponding contour surface of contour analysis technical construction among the present invention, finishes the contour surface construction process of raster data in conjunction with the demand of the contour surface generation of loose point data or raster data.Correspondingly, the list of references of related fields comprises: Xue Qiang, Cai Wenli, Shi Jiaoying. the algorithm of precision iso-surface extracting more than. computer-aided design (CAD) and graphics journal .199801, Yu Zhaohai, He Bing. a kind of contour surface building method based on the vector field structure. Computer Simulation, 200825 (2): 90-92 etc.
Aspect the contour surface generation of raster data, still there is not at present the relevant patent that can find, and it is also less accordingly to carry out the document of quick structure aspect of contour surface based on raster data or the isoline that generated, and the present invention then mainly sets forth the construction algorithm that carries out contour surface based on the isoline that has generated.
Summary of the invention
The contour surface building method that the purpose of this invention is to provide a kind of raster data, computing machine for the planar data of vector shows, can carry out the computing machine demonstration of different colours to contour surface, its prerequisite then is based on the contour surface constructing technology of isoline, and the present invention solves at this problem.
Thinking of the present invention is: the contour surface building method that the invention provides a kind of raster data.This method at first by analyzing raster data, realizes the generation of this raster data isoline by the GDALContourGenerate function in GDAL storehouse; On this basis, constitute all Feature of isoline by traversal, judge wherein whether self intersection of each Feature, namely whether first point is same position with the end point, if then can directly this Feature be constructed to a contour surface, this contour surface is an island of final contour surface inside; If not then needing to adopt the structure strategy of contour surface of the present invention to carry out the traversal of all Feature, thereby finish the construction process of contour surface, finish the construction process of the corresponding contour surface of this raster data at last by the method for aftertreatment.The automatic structure algorithm that contour surface is not arranged in document/patent of publishing so far as yet, this algorithm can be realized the construction process of its contour surface fast based on a raster data (as temperature record, altitude figures etc.), and then can carry out further functions expanding (as the color filling etc.) at different application, and extend to during other similar contour surfaces structures use.
Technical scheme of the present invention provides the high-performance implementation method of the imperial palace circle of a kind of polygon, it is characterized in that comprising following implementation step:
1) calculates the corresponding isoline of this raster data;
2) travel through Feature all in this isoline, judge each Feature self intersection (head and the tail are identical) whether wherein, adopt step 3 or step 4 to handle respectively again;
3) if certain Feature is self intersection, namely the first point of this Feature has identical coordinate with the end point, think that then this place Feature is a contour surface island among the figure as a result, need the direct contour surface of structure and adding in the contour surface result set with this Feature;
4) if this Feature does not have self intersection, then it is joined a pending Feature and concentrates, finish all Feature traversals after, more pending Feature collection is carried out the generation of contour surface by the structure of the contour surface among the present invention policing algorithm;
5) carry out the aftertreatment work that contour surface is constructed, finish final contour surface construction process.
Above-mentioned implementation step is characterised in that:
Step 1) is analyzed based on this raster data, forms corresponding isoline, can adopt the GDALContourGenerate function in GDAL storehouse to realize;
Step 2), all Feature in the isoline vector data that generates are traveled through, at first isolate all islands by step 3), and with the input of these islands as other non-island contour surface structures of step 4);
Step 3), island for the self intersection in the isoline, it at first need be carried out the structure of contour surface and form a Polygon, from other isoline that needs are handled, it be removed, and corresponding Polygon also should be as a condition entry of removing the island in the aftertreatment;
Step 4) after the Feature on the island in removing isoline, further by constructing corresponding data structure, setting up the contour surface tracking rule and follow the trail of, is finished the construction process of contour surface;
Step 5) is carried out aftertreatment, copies the corresponding attribute of corresponding Feature, and the spatial relationship of contour surface is judged, the space is carried out on corresponding island remove operation (Difference), finishes the construction process of contour surface.
The present invention compared with prior art has following characteristics: the generative process that at first adopts the isoline of diffusing point on certain algorithm implementation space or grid point, corresponding method can be with reference to lot of documents, or adopts the GDALContourGenerate function in GDAL storehouse to realize; On this basis, at first the island in the isoline that has generated is judged and generated corresponding Polygon, again by important data structure of structure, terminal point information among each Feature that needs to travel through of record, adopt the traversal rule among the present invention progressively to carry out the tracking of contour surface, finish the construction process of contour surface.
Description of drawings
Fig. 1 is contour surface generative process synoptic diagram of the present invention
Fig. 2 is the isoline stacking diagram of raster data and generation thereof
Fig. 3 is the numbering synoptic diagram of waiting to follow the trail of the end points of isoline
Fig. 4 is the final contour surface layered map that forms
Embodiment
Fig. 1 has illustrated the raster data among the present invention to generate a main method of contour surface, its main flow process is as follows: at first realize generating based on the isoline of raster data by grid analysis, can adopt the GDALContourGenerate function in GDAL storehouse to realize, as shown in Figure 2; On this basis, by traveling through the Feature in all isoline, judge its whether from beginning to end self intersection, if self intersection then think that it is an island in the contour surface, need and from isoline, delete based on contour surface adding result set of this isoline structure, traveled through after all Feature in the isoline, also needed to adopt the contour surface construction process of concentrated all Feature of contour surface structure strategy realization isoline among the present invention.
1. the structure strategy of contour surface
Contour surface structure strategy among the present invention is as follows:
At first 2 end points to all Feature in the corresponding isoline are numbered, and as shown in Figure 3, the rule of numbering is from the upper left corner, inferior horn left successively, the lower right corner, the upper right corner, the direction in the upper left corner travels through, numbering is from 1 beginning, another point of the point place Feature that will be labeled simultaneously is same tense marker also, among the present invention it is labeled as 1 ', except label, also need to record some other information of this point, corresponding data structure definition is as follows:
By above-mentioned data structure corresponding isoline end points is defined, can record all Feature information, and carry out track-while-scan according to certain rule, realize the construction process of contour surface, corresponding tracking rule is as follows:
As shown in Figure 3, at first need be based on oriented chained list of end point configuration or the array of all Feature shown in Figure 3, structure is similar to:
vector<PointInfo*>allPoints_Seq;
Its content comprises by all Feature between all Feature between all Feature between the intersection point on upper left angle point shown in Figure 3, all Feature between the upper left corner to the lower left corner and the left side, lower-left angle point, the lower left corner to the lower right corner and following intersection point, bottom right angle point, the lower right corner to the upper right corner and the intersection point on the right, upper right angle point, the upper right corner to the upper left corner and the intersection point of top.Wherein, in the PointInfo structure of 4 angle points 2 attributes such as OGRPoint point and inttimes are only arranged, but the equal assignment of other attribute is NULL.That searches for is tactful as follows:
For allPoints_Seq, search for downwards along its data store organisation, at first begin search from the upper left corner along the left side, after searching a point, (be point 1 in this example), find another point (being point 1 ' in this example) of this point again according to above-mentioned data structure fast, continue search, obtain upper left angle point, must return a little 1 again, form the closed loop (contour surface) in the upper left corner, search finishes, and upgrades the corresponding information (times) of corresponding point 1, point 1 ', upper left angle point.Continue search, and judge whether the value of the times of each point is 2, if be 2 then a bit search under the continuation, the times that has a few in allPoints_Seq is 2 (times of 4 angle points can be 1 or 2).For this example, along point 1 search downwards, obtain angle point 2, obtain another end points 2 ' of this ring according to point 2 Pointlnfo* structure, continue search, obtain a little 4,4 ', 1 ', 1, the search end.According to said method, obtain contour surface 2,3,3 ', 2 ', 2 respectively, contour surface 3,3 ', 3, contour surface 4,5,5 ', 6,6 ', 4 ', 4, contour surface 5,5 ', 5 ... up to searching all contour surfaces.
2. the aftertreatment of contour surface
The aftertreatment work of contour surface comprises the island of removing in the structure contour surface, and the property value of contour surface is carried out assignment etc.After the structure of the contour surface of using above-mentioned all isoline of contour surface structure strategy realization is finished, need to analyze conversely island wherein, and the island carried out effective mark, implementation method can be under the prerequisite of analyzing existing island, front, the new contour surface that adopts contour surface structure strategy to follow the trail of is out carried out spatial relationship to be judged, if be judged to be the space relation of inclusion, Difference function in can the application space analyzing carries out the removal on island, finishing the spatial relationship on corresponding island judges, thereby avoid the bigger less contour surface polygon of contour surface polygon gland, finish the construction process based on the contour surface of raster data.
Further, need carry out assignment to the corresponding polygonal attribute of each contour surface, namely the height value of each Polygon be carried out assignment.Assignment method divided for 2 steps carried out, a kind of is the Polygon that forms for by the specified height value of double elv in 2 different PointInfo structures, the property value of this Polygon namely is made up of the interval that these 2 different elv values constitute, height value as certain Polygon is 9-11, and namely the height value between this Polygon is 9 to 11; Another kind of then be to be constituted by single property value, some Polygon around this comprising, and some isolated islands, the judgement of the height value of these Polygon then needs to judge and recursion draws according to its adjacent Polygon.Just can carry out different colours to contour surface with this property value after mark is intact and fill in colors on a sketch, effect as shown in Figure 4.
Example of the present invention realizes that at the PC platform test environment that adopts in the experiment is configured to the Dell3.40MHz8 core processor, the 64 bit manipulation systems of Win7.The experiment proved that the present invention can access the quick structure of realizing contour surface more quickly based on raster data.Mentioned method can be widely used in the structure application based on the contour surface of raster data such as meteorology, the hydrology, geology among the present invention.
Claims (3)
1. the contour surface building method of a raster data is characterized in that comprising following step:
Step 1 is calculated the corresponding isoline of this raster data;
Step 2 travels through Feature all in this isoline, judges each Feature self intersection (head and the tail are identical) whether wherein, adopts step 3 or step 4 to handle respectively again;
Step 3, if certain Feature is self intersection, namely the first point of this Feature has identical coordinate with end point, thinks that then this place Feature is a contour surface island among the figure as a result, needs the direct contour surface of structure and adding in the contour surface result set with this Feature;
Step 4 if this Feature does not have self intersection, then joins it pending Feature and concentrates, finish all Feature traversals after, more pending Feature collection is carried out the generation of contour surface by the structure of the contour surface among the present invention policing algorithm;
Step 5 is carried out the aftertreatment work of contour surface structure, finishes final contour surface construction process.
2. according to the structure of the contour surface described in claim 1 step 4 policing algorithm, it is characterized in that realizing that prerequisite is at first to construct a data structure, this structure is at the polygonal frontier point in non-island, its information comprises the Feature of this point coordinate, numerical value, traversal number of times, another frontier point, this Feature wire loop, corresponding 2 contour surfaces of this Feature, needs to use these information in the structure strategy of contour surface; On this basis, the directed loop of implementation step for constructing by frontier point wherein, carry out the traversal of a direction according to this ring, up to the ring that forms a sealing, and the numeration of all nodes (being " the traversal number of times " described in the claim 2) is till 2, finishes the structure in corresponding contour surface zone
3. according to the structure of the contour surface described in claim 1 step 5 policing algorithm, spatial analysis need be carried out in conjunction with the island that step 3 in the claim 1 forms in the contour surface zone that it is characterized in that step 4 formation in the claim 1, the zone of the removing corresponding island row labels of going forward side by side is finally finished the construction process of all contour surfaces.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2013101443182A CN103268633A (en) | 2013-04-24 | 2013-04-24 | Contour surface construction method for raster data |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2013101443182A CN103268633A (en) | 2013-04-24 | 2013-04-24 | Contour surface construction method for raster data |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103268633A true CN103268633A (en) | 2013-08-28 |
Family
ID=49012260
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2013101443182A Pending CN103268633A (en) | 2013-04-24 | 2013-04-24 | Contour surface construction method for raster data |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103268633A (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104166549A (en) * | 2014-08-08 | 2014-11-26 | 江苏省气象科学研究所 | Meteorological element contour surface analysis platform and construction method |
CN107292959A (en) * | 2017-06-14 | 2017-10-24 | 南京理工大学 | The method that ore body three-dimensional surface profile is rebuild using rock core cutoff grade contour surface |
CN109241369A (en) * | 2018-08-02 | 2019-01-18 | 中国水利水电科学研究院 | Rainfall isopleth construction method based on grid stretching method |
CN110070619A (en) * | 2019-04-09 | 2019-07-30 | 长江空间信息技术工程有限公司(武汉) | Take the river water surface three-dimensional visualization method of water surface gradient into account |
CN111060177A (en) * | 2019-11-07 | 2020-04-24 | 武汉达梦数据库有限公司 | Underground water contour line auxiliary generation method and device |
CN112818073A (en) * | 2019-11-15 | 2021-05-18 | 内蒙古电力(集团)有限责任公司内蒙古电力科学研究院分公司 | Method for determining meteorological icing position of power transmission line |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101504659A (en) * | 2009-03-03 | 2009-08-12 | 成秋明 | Method for extracting geoscience spatial information based on generalized self-similarity principle |
CN102998679A (en) * | 2012-11-25 | 2013-03-27 | 北京理工大学 | GIS (Geographic Information System) data acquisition method applied to unmanned vehicle |
CN102999592A (en) * | 2012-11-19 | 2013-03-27 | 北京中海新图科技有限公司 | B/S architecture based global Argo multi-source marine data management and visualization system and method |
-
2013
- 2013-04-24 CN CN2013101443182A patent/CN103268633A/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101504659A (en) * | 2009-03-03 | 2009-08-12 | 成秋明 | Method for extracting geoscience spatial information based on generalized self-similarity principle |
CN102999592A (en) * | 2012-11-19 | 2013-03-27 | 北京中海新图科技有限公司 | B/S architecture based global Argo multi-source marine data management and visualization system and method |
CN102998679A (en) * | 2012-11-25 | 2013-03-27 | 北京理工大学 | GIS (Geographic Information System) data acquisition method applied to unmanned vehicle |
Non-Patent Citations (3)
Title |
---|
于兆海 等: "一种基于矢量场结构的等值面构造方法", 《计算机仿真》 * |
周博 等: "等值面快速生成方法的改进", 《计算机工程》 * |
李红旮 等: "地理信息系统中时空多维数据可视化技术研究", 《遥感学报》 * |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104166549A (en) * | 2014-08-08 | 2014-11-26 | 江苏省气象科学研究所 | Meteorological element contour surface analysis platform and construction method |
CN104166549B (en) * | 2014-08-08 | 2018-03-06 | 江苏省气象科学研究所 | Meteorological element contour surface analysis platform and construction method |
CN107292959A (en) * | 2017-06-14 | 2017-10-24 | 南京理工大学 | The method that ore body three-dimensional surface profile is rebuild using rock core cutoff grade contour surface |
CN107292959B (en) * | 2017-06-14 | 2020-09-11 | 南京理工大学 | Method for reconstructing three-dimensional surface profile of ore body by using rock core boundary grade isosurface |
CN109241369A (en) * | 2018-08-02 | 2019-01-18 | 中国水利水电科学研究院 | Rainfall isopleth construction method based on grid stretching method |
CN109241369B (en) * | 2018-08-02 | 2019-06-21 | 中国水利水电科学研究院 | Rainfall isopleth construction method based on grid stretching method |
CN110070619A (en) * | 2019-04-09 | 2019-07-30 | 长江空间信息技术工程有限公司(武汉) | Take the river water surface three-dimensional visualization method of water surface gradient into account |
CN110070619B (en) * | 2019-04-09 | 2021-07-06 | 长江空间信息技术工程有限公司(武汉) | Three-dimensional visualization method for river water surface considering water surface gradient |
CN111060177A (en) * | 2019-11-07 | 2020-04-24 | 武汉达梦数据库有限公司 | Underground water contour line auxiliary generation method and device |
CN111060177B (en) * | 2019-11-07 | 2021-05-28 | 武汉达梦数据库股份有限公司 | Underground water contour line auxiliary generation method and device |
CN112818073A (en) * | 2019-11-15 | 2021-05-18 | 内蒙古电力(集团)有限责任公司内蒙古电力科学研究院分公司 | Method for determining meteorological icing position of power transmission line |
CN112818073B (en) * | 2019-11-15 | 2022-12-09 | 内蒙古电力(集团)有限责任公司内蒙古电力科学研究院分公司 | Method for determining meteorological icing position of power transmission line |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109345619B (en) | Mass point cloud space management method based on octree-like coding | |
CN103268633A (en) | Contour surface construction method for raster data | |
CN105513127B (en) | Shaft regularization three-dimensional modeling method and system based on density peaks cluster | |
CN100485662C (en) | Characteristic analytical method for product point clouds surface based on dynamic data access model | |
Schön et al. | Octree-based indexing for 3D pointclouds within an Oracle Spatial DBMS | |
CN103679804A (en) | System and method for automatically building three-dimensional model of data of underground pipeline | |
CN102385067B (en) | Drawing method for isoline containing reverse fault | |
CN102881039B (en) | Based on the tree three-dimensional vector model construction method of laser three-dimensional scanning data | |
CN106447777A (en) | Three-dimensional topological relation expressing and mapping achieved under support of Boolean operation | |
CN115661374B (en) | Rapid retrieval method based on space division and model voxelization | |
CN111047682B (en) | Three-dimensional lane model generation method and system | |
CN104361185A (en) | Wire distribution space automatic generating method for cable virtual design | |
CN105404898A (en) | Loose-type point cloud data segmentation method and device | |
CN108256218A (en) | A kind of subterranean communication tunnel fine modeling method based on actual measurement stringcourse data | |
CN103413357A (en) | Construction method for forming square benchmark grid surface through point cloud | |
CN105653881A (en) | Flow field visualization method based on multi-density levels | |
Qiao et al. | A rapid visualization method of vector data over 3D terrain | |
Wei et al. | A point clouds fast thinning algorithm based on sample point spatial neighborhood | |
Schön et al. | Storage, manipulation, and visualization of LiDAR data | |
Xu et al. | Vectorization of classified remote sensing raster data to establish topological relations among polygons | |
Wang et al. | Terrain mapping for autonomous trucks in surface mine | |
Mascarenhas et al. | Isocontour based visualization of time-varying scalar fields | |
You et al. | Simple octree solution for multi-resolution lidar processing and visualisation | |
CN106599248A (en) | Spatial graph conversion method based on binary element mapping pool technology | |
Guo et al. | A mapreduce algorithm for polygon retrieval in geospatial analysis |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130828 |