CN102542607A - Filling processing method of digital elevation model depression - Google Patents
Filling processing method of digital elevation model depression Download PDFInfo
- Publication number
- CN102542607A CN102542607A CN201110419607XA CN201110419607A CN102542607A CN 102542607 A CN102542607 A CN 102542607A CN 201110419607X A CN201110419607X A CN 201110419607XA CN 201110419607 A CN201110419607 A CN 201110419607A CN 102542607 A CN102542607 A CN 102542607A
- Authority
- CN
- China
- Prior art keywords
- grid elements
- node
- elements node
- row
- depression
- 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
Abstract
The invention relates to a filling processing method of a digital elevation model depression. The filling processing method comprises the following steps of: checking each grid element node in a boundary grid element node set by configuring the boundary grid element node set, a depression grid element node set and a middle grid element node set; if a node adjacent to a boundary grid element node is not in the depression grid element node set, canceling the boundary grid element node from the boundary grid element node set; if the node adjacent to the boundary grid element node is a non-depression grid, adding the adjacent depression grid element node to the boundary grid element node set; if no any grid element node is processed in the boundary grid element node set and the depression grid element node set, repeatedly checking each grid element node in the boundary grid element node set; otherwise, filling the depression grid element node in the depression grid element node set. Through the filling processing method of the digital elevation model depression, disclosed by the invention, depression caused by errors in data acquisition and interpolation processes can be processed, and an incorrect result is prevented from being generated during water flow terrain analysis.
Description
Technical field
Present technique relates to the geography information field, particularly a kind of digital elevation model depression fill and lead up disposal route.
Background technology
Digital elevation model (DEM) is digital Terrain Analysis and application, and dem data carries out dem data is carried out pre-service.The depression is by the local landform unit of DEM that higher elevation surrounded, the depression that in dem data, is showed be mostly since data obtain with interpolation process in the caused pseudo-depression of error.The depression is the key factor that influences current, and under the natural situation, current flow to lower, and the existence in these depression can make that using digital elevation model to carry out the current terrain analysis causes incorrect result, even algorithm can't calculate.When dem data was applied in the hydrology and morphologic analysis, the Algorithm Analysis failure can be caused in the depression that basin network and topographic structure are interrupted, and therefore before using the DEM digital elevation model, need fill and lead up processing to the depression in the dem data.
Present depression is filled and led up method and mainly contained: smoothing processing, fill and lead up processing etc., eliminate the depression through smoothing processing, but this method can only be handled depression more shallow and among a small circle, darker and wider depression still exists, and has changed raw data.Fill and lead up the water delivering orifice elevation that the processing elevation that the depression is inner increases to the depression.The depression is the ponding zone of regional landform; The elevation of depression low spot is lower than other field point; The depression is filled and led up method and is mainly single grid depression and fills and leads up; This method be elevation with 8 field points in the digital ground elevation model all greater than the elevation of this point, the elevation in so single grid depression is directly given the minimum elevation of contiguous grid.
It is to confirm the depression cell earlier mostly that method is filled and led up in present depression; Confirm the catchment area of depression cell then; Smallest point from the catchment area is filled and led up processing as potential water delivering orifice, and these class methods are difficult to solve large-area depression, and finds all depression that possibly exist.The present invention is from the border of want processing region; The elevation current that the elevation of intra-zone grid is greater than or equal to the border grid could pass through the zone; Or flow to region exterior from intra-zone; Make hydropexic inner mesh fill and lead up processing for all according to the minimum elevation of its borderline region; Method of the present invention makes all depression of intra-zone all can be processed, and the depression grid influence of being filled and led up simultaneously processing is minimum, the grid after keeping as far as possible filling and leading up and fill and lead up before the difference of landform between the grid.
Summary of the invention
The purpose that the present invention implements provides a kind of depression to fill and lead up disposal route, can be in real time from the border grid elements node to inner mesh element node progressively the method for transition all depression grid elements nodes are filled processing.
Technical scheme of the present invention has provided the disposal route of filling and leading up in a kind of digital elevation model depression, it is characterized in that:
Step 1: the capable n row of a m grid matrix M is set is used to write down the terrain mesh altitude figures; Wherein m and n are respectively the positive integer greater than 1, and each the grid elements node among the grid matrix M is provided with a floating-point variable H, wherein floating-point variable H record terrain mesh elevation; A border grid elements node set A, a depression grid elements node set B and an intermediate mesh element node set C are set; The initial value of depression grid elements node set B is all inner mesh element nodes, and inner mesh element node is the grid elements node of the capable j row of the i when () among the grid matrix M, and the initial value of border grid elements node set A is all border grid elements nodes; Border grid elements node is other grid elements nodes in addition of inner mesh element node among the grid matrix M; The initial value of intermediate mesh element node set C is empty, wherein, logical variable T is set; Initial value T is 0, gets into step 2;
Step 2: from the grid elements node set A of border, take out a grid elements node; Said grid elements node is added intermediate mesh element node set C; And described grid elements node deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; If the adjacent mesh element node of described border grid elements node has in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node, then get into step 3; Otherwise described border grid elements node is deleted from middle grid elements node set C, got into step 4;
Step 3: if the elevation of described adjacent depression grid elements node is lower than border grid elements node; Get into step 4; Otherwise should add intermediate mesh element node set C by adjacent depression grid elements node; And described adjacent depression grid elements node deleted from the grid elements node set B of depression, it is 1 that logical variable T is set, and gets into step 4;
Step 4:, then get into step 5, otherwise return step 2 if border grid elements node set A is empty;
Step 5: all grid elements nodes of intermediate mesh element node set C are joined border mesh node set A; Intermediate mesh element node set C is set to sky simultaneously, if logical variable T is 0, gets into step 6; Equal 0 otherwise T is set, get back to step 2;
Step 6: if border grid elements node set A is empty; Get into step 7; Otherwise search the minimum elevation h in all the grid elements nodes of grid elements node set A of border; To fill and lead up to minimum elevation h less than the corresponding plot of all grid elements nodes among the depression grid elements node set B of minimum elevation h, grid elements node elevation H is set to h less than all grid elements node elevations of minimum elevation h among the depression grid elements node set B simultaneously, gets back to step 2;
Step 7: each grid elements node elevation after the processing is filled and led up in the output depression.
Compared with prior art, the present invention has following advantage and effective effect:
(1) the present invention can fill and lead up and handle all by the local landform unit of the digital elevation model that higher elevation surrounded; Can not only handle depression more shallow and among a small circle; And depression that can be darker and wider; Solve since data obtain with interpolation process in the caused depression of error, carry out the current terrain analysis and cause incorrect result thereby avoid the use of digital elevation model, even algorithm can't calculate.
(2) the present invention wants the border of processing region from digital elevation model; The elevation current that the elevation of intra-zone grid elements node is greater than or equal to border grid elements node could pass through the zone; Or flow to region exterior from intra-zone; Make hydropexic inner mesh element node fill and lead up processing for all according to the minimum elevation of its borderline region; Method of the present invention makes all depression of intra-zone all can be filled and led up processing, and the depression grid elements node influence of being filled and led up simultaneously processing is minimum, the grid after keeping as far as possible filling and leading up and fill and lead up before the difference of landform between the grid.
Description of drawings
In order to be illustrated more clearly in the technical scheme of embodiment of the present invention, will do simple introduction to the accompanying drawing of required use in embodiment or the description of the Prior Art below, obviously, the accompanying drawing in describing below is embodiments more of the present invention.
Fig. 1: a kind of digital elevation model depression fill and lead up the process flow synoptic diagram.
Fig. 2: the disposal route process of the filling and leading up synoptic diagram in a kind of digital elevation model depression.
Fig. 3: one is carried out the depression and fills and leads up the digital elevation model of the grid matrix B of 4 row, 4 row before handling and be used to write down terrain data, is the 1st row the 2nd row grid for depression grid elements node wherein.
Fig. 4: carry out the digital elevation model that the grid matrix B after handling is filled and led up in the depression.
Embodiment
To combine the accompanying drawing in the embodiment of the present invention below, the technical scheme in the embodiment of the present invention is carried out clear, intactly description, certain described embodiment only is the present invention's part embodiment, rather than whole embodiments.
Embodiment 1
A kind of digital elevation model depression fill and lead up disposal route, it is characterized in that:
Step 1: the capable n row of a m grid matrix M is set is used to write down the terrain mesh altitude figures; Wherein m and n are respectively the positive integer greater than 1, and each the grid elements node among the grid matrix M is provided with a floating-point variable H, wherein floating-point variable H record terrain mesh elevation; A border grid elements node set A, a depression grid elements node set B and an intermediate mesh element node set C are set; The initial value of depression grid elements node set B is all inner mesh element nodes, and inner mesh element node is the grid elements node of the capable j row of the i when () among the grid matrix M, and the initial value of border grid elements node set A is all border grid elements nodes; Border grid elements node is other grid elements nodes in addition of inner mesh element node among the grid matrix M; The initial value of intermediate mesh element node set C is empty, wherein, logical variable T is set; Initial value T is 0, gets into step 2;
Step 2: from the grid elements node set A of border, take out a grid elements node; Said grid elements node is added intermediate mesh element node set C; And described grid elements node deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent
The lookup method of said grid elements node adjacent mesh element node is following: suppose the capable j row of an i grid elements node, if i, the value of j does; Adjacent grid elements node has eight, is respectively the capable j-1 row of i-1 grid elements node, the capable j row of i-1 grid elements node, the capable j+1 row of i-1 grid elements node, the capable j-1 row of i grid elements node, the capable j+1 row of i grid elements node, the capable j-1 row of i+1 grid elements node, the capable j row of i+1 grid elements node, the capable j+1 row of i+1 grid elements node, if i; The value of j is
; Then adjacent mesh element node has five, is respectively the 1st row j-1 row grid elements node, the 1st row j+1 row grid elements node, the 2nd row j-1 row grid elements node, the 2nd row j row grid elements node, the 2nd row j+1 row grid elements node, if i; The value of j does; Then adjacent mesh element node has five, is respectively the capable j-1 row of m-1 grid elements node, the capable j row of m-1 grid elements node, the capable j+1 row of m-1 grid elements node, the capable j-1 row of m grid elements node, the capable j+1 row of m grid elements node, if i; The value of j does; Then adjacent mesh element node has five, is respectively capable the 1st row grid elements node of i-1, capable the 2nd row grid elements node of i-1, capable the 2nd row grid elements node of i, capable the 1st row grid elements node of i+1, capable the 2nd row grid elements node of i+1, if i; The value of j does; Then adjacent mesh element node has five, is respectively the capable n-1 row of i-1 grid elements node, the capable n row of i-1 grid elements node, the capable n-1 row of i grid elements node, the capable n-1 row of i+1 grid elements node, the capable n row of i+1 grid elements node, if i; The value of j does; Then adjacent mesh element node has three, is respectively the 1st row the 2nd row grid elements node, the 2nd row the 1st row grid elements node, the 2nd row the 2nd row grid elements node, if i; The value of j does; Then adjacent mesh element node has three, is respectively the 1st row n-1 row grid elements node, the 2nd row n-1 row grid elements node, the 2nd row n row grid elements node, if i; The value of j does; Then adjacent mesh element node has three, is respectively capable the 1st row grid elements node of m-1, capable the 2nd row grid elements node of m-1, capable the 2nd row grid elements node of m, if i; The value of j does; Then adjacent mesh element node has three, is respectively the capable n-1 row of m-1 grid elements node, the capable n row of m-1 grid elements node, the capable n-1 row of m grid elements node
If the adjacent mesh element node of described border grid elements node has in the grid elements node set B of depression; Then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node; Then get into step 3; Otherwise described border grid elements node is deleted from middle grid elements node set C, got into step 4;
Step 3: if the elevation of described adjacent depression grid elements node is lower than border grid elements node; Get into step 4; Otherwise should add intermediate mesh element node set C by adjacent depression grid elements node; And described adjacent depression grid elements node deleted from the grid elements node set B of depression, it is 1 that logical variable T is set, and gets into step 4;
Step 4:, then get into step 5, otherwise return step 2 if border grid elements node set A is empty;
Step 5: all grid elements nodes of intermediate mesh element node set C are joined border mesh node set A; Intermediate mesh element node set C is set to sky simultaneously, if logical variable T is 0, gets into step 6; Equal 0 otherwise T is set, get back to step 2;
Step 6: if border grid elements node set A is empty; Get into step 7; Otherwise search the minimum elevation h in all the grid elements nodes of grid elements node set A of border; To fill and lead up to minimum elevation h less than the corresponding plot of all grid elements nodes among the depression grid elements node set B of minimum elevation h, grid elements node elevation H is set to h less than all grid elements node elevations of minimum elevation h among the depression grid elements node set B simultaneously, gets back to step 2;
Step 7: each grid elements node elevation after the processing is filled and led up in the output depression, and each grid elements node elevation that described output depression is filled and led up after the processing is each ranks grid elements node of output and corresponding elevation thereof.
A digital elevation model depression fill and lead up disposal route, it is characterized in that:
Step 1 (1): one 3 row 4 row grid matrix M are set are used to write down the terrain mesh altitude figures; Each grid elements node among the grid matrix M is provided with a floating-point variable H, and wherein floating-point variable H record terrain mesh elevation is provided with a border grid elements node set A, a depression grid elements node set B and an intermediate mesh element node set C; The initial value of depression grid elements node set B is all inner mesh element nodes; Inner mesh element node is the grid elements node of the capable j row of the i when (1 <i < 3,1 < j < 4) among the grid matrix M, and the initial value of border grid elements node set A is all border grid elements nodes; Border grid elements node is other grid elements nodes in addition of inner mesh element node among the grid matrix M; The initial value of intermediate mesh element node set C is empty, wherein, logical variable T is set; Initial value T is 0
The initial value of border grid elements node set A is all border grid elements nodes,
A={(1,?1),?(1,?2),?(1,?3),?(1,?4)
(2,?1),?(2,?4),
(3,?1),?(3,?2),?(3,?3),?(3,?4),}
Depression grid elements node set B is all inner mesh element nodes,
B={(2,?2),?(2,?3)}
Intermediate mesh element node set C is all grid elements nodes,
C={?}
Logical variable T is set, and initial value T is 0, gets into step 2 (2);
Step 2 (2): from the grid elements node set A of border, take out a grid elements node (1,1), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (1; 1) from the grid elements node set A of border, deletes, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (1; 1) adjacent mesh element node (2; 2) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(1,?2),?(1,?3),?(1,?4)
(2,?1),?(2,?4),
(3,?1),?(3,?2),?(3,?3),?(3,?4),}
Depression grid elements node set B does
B={(2,?2),?(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1)}
Then get into step 3 (3);
Step 3 (3): the elevation 3 of described adjacent depression grid elements node (2,2) is lower than the elevation 5 of border grid elements node (1,1), gets into step 4 (4);
Step 4 (4): border grid elements node set A has element, returns step 2 (5);
Step 2 (5): from the grid elements node set A of border, take out a grid elements node (1,2), said grid elements node is added intermediate mesh element node set C; And described grid elements node (1,2) deleted from the grid elements node set A of border, check all grid elements nodes that described grid elements node is adjacent; Described border grid elements node (1; 2) adjacent mesh element node (2,2) and (2,3) are in the grid elements node set B of depression; Then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(1,?3),?(1,?4)
(2,?1),?(2,?4),
(3,?1),?(3,?2),?(3,?3),?(3,?4),}
Depression grid elements node set B does
B={(2,?2),?(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2)}
Then get into step 3 (6);
Step 3 (6): described adjacent depression grid elements node (2; 2) elevation 3 equals border grid elements node (1,2), then should adjacent depression grid elements node (2; 2) add intermediate mesh element node set C; And described adjacent depression grid elements node (2,2) deleted from the grid elements node set B of depression
Border grid elements node set A does
A={(1,?3),?(1,?4)
(2,?1),?(2,?3),
(3,?1),?(3,?2),?(3,?3),?(3,?4),}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,?2)}
It is 1 that logical variable T is set, and gets into step 4 (7);
Step 4 (7): border grid elements node set A has element, returns step 2 (8);
Step 2 (8): from the grid elements node set A of border, take out a grid elements node (1,3), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (1; 3) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (1; 3) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(1,?4),
(2,?1),?(2,?4),
(3,?1),?(3,?2),?(3,?3),?(3,?4),}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,2),?(1,?3)}
Then get into step 3 (9);
Step 3 (9): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation 2 of border grid elements node (1,3), gets into step 4 (10);
Step 4 (10): border grid elements node set A has element, returns step 2 (11);
Step 2 (11): from the grid elements node set A of border, take out a grid elements node (1,4), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (1; 4) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (1; 4) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(2,?1),?(2,?4),
(3,?1),?(3,?2),?(3,?3),?(3,?4),}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,?2),?(1,?3),?(1,?4)}
Then get into step 3 (12);
Step 3 (12): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation 2 of border grid elements node (1,4), gets into step 4 (13);
Step 4 (13): border grid elements node set A has element, returns step 2 (14);
Step 2 (14): from the grid elements node set A of border, take out a grid elements node (2,1), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (2; 1) from the grid elements node set A of border, deletes, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (2; 1) adjacent mesh element node is not in the grid elements node set B of depression; Described border grid elements node (2,1) is deleted from middle grid elements node set C, got into step 4 (15);
Border grid elements node set A does
A={(2,?4),
(3,?1),?(3,?2),?(3,?3),?(3,?4),}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,?2),?(1,?3),?(1,?4)}
Then get into step 4 (15);
Step 4 (15): border grid elements node set A has element, returns step 2 (16);
Step 2 (16): from the grid elements node set A of border, take out a grid elements node (2,4), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (2; 4) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (2; 4) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(3,?1),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,?2),?(1,?3),?(1,?4),?(2,4)}
Then get into step 3 (17);
Step 3 (17): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation 3 of border grid elements node (2,4), gets into step 4 (18);
Step 4 (18): border grid elements node set A has element, returns step 2 (19);
Step 2 (19): from the grid elements node set A of border, take out a grid elements node (3,1), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (3; 1) from the grid elements node set A of border, deletes, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (3; 1) adjacent mesh element node is not in the grid elements node set B of depression; Described border grid elements node (3,1) is deleted from middle grid elements node set C
Border grid elements node set A does
A={(3,?2),?(3,?3),?(3,?4),}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,?2),?(1,?3),?(1,?4),(2,4)}
Then get into step 4 (20);
Step 4 (20): border grid elements node set A has element, returns step 2 (21);
Step 2 (21): from the grid elements node set A of border, take out a grid elements node (3,2), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (3; 2) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (3; 2) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(3,?3),?(3,?4),}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,?2),?(1,?3),?(1,?4),(2,4),?(3,?2)}
Then get into step 3 (22);
Step 3 (22): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation 2 of border grid elements node (3,2), gets into step 4 (23);
Step 4 (23): border grid elements node set A has element, returns step 2 (24);
Step 2 (24): from the grid elements node set A of border, take out a grid elements node (3,3), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (3; 3) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (3; 3) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,?2),?(1,?3),?(1,?4),(2,4),?(3,?2),?(3,?3)}
Then get into step 3 (25);
Step 3 (25): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation 2 of border grid elements node (3,3), gets into step 4 (26);
Step 4 (26): border grid elements node set A has element, returns step 2 (27);
Step 2 (27): from the grid elements node set A of border, take out a grid elements node (3,4), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (3; 4) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (3; 4) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?1),?(1,?2),?(2,?2),?(1,?3),?(1,?4),(2,4),?(3,?2),?(3,?3),?(3,?4)}
Then get into step 3 (28);
Step 3 (28): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation 2 of border grid elements node (3,4), gets into step 4 (29);
Step 4 (29):, then get into step 5 (30) if border grid elements node set A is empty;
Step 5 (30): all grid elements nodes of intermediate mesh element node set C are joined border mesh node set A, and intermediate mesh element node set C is set to sky simultaneously,
Border grid elements node set A does
A={(1,?1),?(1,?2),?(2,?2),?(1,?3),?(1,?4),(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={}
Logical variable T is 1, T is set equals 0, gets back to step 2 (31);
Step 2 (31): from the grid elements node set A of border, take out a grid elements node (1,1), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (1; 1) from the grid elements node set A of border, deletes, check all grid elements nodes that described grid elements node (1,1) is adjacent; Described border grid elements node (1; 1) adjacent mesh element node in the grid elements node set B of depression, is not then deleted described border grid elements node from middle grid elements node set C
Border grid elements node set A does
A={(1,?2),?(2,?2),?(1,?3),?(1,?4),(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={}
Get into step 4 (32);
Step 4 (32): border grid elements node set A has element, returns step 2 (33);
Step 2 (33): from the grid elements node set A of border, take out a grid elements node (1,2), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (1; 2) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (1; 2) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={?(2,?2),?(1,?3),?(1,?4),(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2)}
Then get into step 3 (34);
Step 3 (34): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation 2 of border grid elements node (1,2), gets into step 4 (35);
Step 4 (35): border grid elements node set A has element, returns step 2 (36);
Step 2 (36): from the grid elements node set A of border, take out a grid elements node (2,2), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (2; 2) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (2; 2) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={?(1,?3),?(1,?4),(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2)}
Then get into step 3 (37);
Step 3 (37): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation of border grid elements node (1,2), gets into step 4 (38);
Step 4 (38): border grid elements node set A has element, returns step 2 (39);
Step 2 (39): from the grid elements node set A of border, take out a grid elements node (1,3), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (1; 3) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (1; 3) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={?(1,?4),(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3)?}
Then get into step 3 (40);
Step 3 (40): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation of border grid elements node (1,3), gets into step 4 (41);
Step 4 (41): border grid elements node set A has element, returns step 2 (42);
Step 2 (42): from the grid elements node set A of border, take out a grid elements node (1,4), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (1; 4) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (1; 4) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3),?(1,?4)}
Then get into step 3 (43);
Step 3 (43): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation of border grid elements node (1,4), gets into step 4 (44);
Step 4 (44): border grid elements node set A has element, returns step 2 (45);
Step 2 (45): from the grid elements node set A of border, take out a grid elements node (2,4), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (2; 4) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (2; 4) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3),?(1,?4),?(2,4)}
Then get into step 3 (46);
Step 3 (46): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation of border grid elements node (2,4), gets into step 4 (47);
Step 4 (47): border grid elements node set A has element, returns step 2 (48);
Step 2 (48): from the grid elements node set A of border, take out a grid elements node (3,2), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (3; 2) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (3; 2) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3),?(1,?4),?(2,4),?(3,?2)}
Then get into step 3 (49);
Step 3 (49): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation of border grid elements node (3,2), gets into step 4 (50);
Step 4 (50): border grid elements node set A has element, returns step 2 (51);
Step 2 (51): from the grid elements node set A of border, take out a grid elements node (3,3), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (3; 3) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (3; 3) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3),?(1,?4),?(2,4),?(3,?2),?(3,?3)}
Then get into step 3 (52);
Step 3 (52): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation of border grid elements node (3,3), gets into step 4 (53);
Step 4 (53): border grid elements node set A has element, returns step 2 (54);
Step 2 (54): from the grid elements node set A of border, take out a grid elements node (3,4), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (3; 4) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (3; 4) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={?}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3),?(1,?4),?(2,4),?(3,?2),?(3,?3),?(3,?4)}
Then get into step 3 (55);
Step 3 (55): the elevation 1 of described adjacent depression grid elements node (2,3) is lower than the elevation of border grid elements node (3,4), gets into step 4 (56);
Step 4 (56): border grid elements node set A gets into step 5 (57) for having element in vain;
Step 5 (57): all grid elements nodes of intermediate mesh element node set C are joined border mesh node set A, and intermediate mesh element node set C is set to sky simultaneously,
Border grid elements node set A does
A={(1,?2),?(2,?2),?(1,?3),?(1,?4),?(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={?}
Logical variable T is 0, gets into step 6 (58);
Step 6 (58): the minimum elevation h that searches in all the grid elements nodes of grid elements node set A of border equals 2; Will be less than grid elements node (2 among the depression grid elements node set B of minimum elevation 2; 3) corresponding plot is filled and led up to minimum elevation 2, simultaneously with grid elements node (2,3) elevation H among the grid elements node set B of depression less than the grid elements node elevation (2 of minimum elevation 2; 3) be set to 2, get back to step 2 (59);
Step 2 (59): from the grid elements node set A of border, take out a grid elements node (1,2), said grid elements node is added intermediate mesh element node set C; And with described grid elements node (1; 2) from the grid elements node set A of border, delete, check all grid elements nodes that described grid elements node is adjacent, described border grid elements node (1; 2) adjacent mesh element node (2; 3) in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={?(2,?2),?(1,?3),?(1,?4),?(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2)}
Then get into step 3 (60);
Step 3 (60): the elevation 2 of described adjacent depression grid elements node (2,3) is lower than the elevation of border grid elements node (1,2), gets into step 4 (61);
Step 4 (61): border grid elements node set A has element, returns step 2 (62);
Step 2 (62): from the grid elements node set A of border, take out a grid elements node (2,2), with said grid elements node (2; 2) add intermediate mesh element node set C; And described grid elements node (2,2) deleted from the grid elements node set A of border, check all grid elements nodes that described grid elements node is adjacent; Described border grid elements node (2; 2) adjacent mesh element node has in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node
Border grid elements node set A does
A={?(1,?3),?(1,?4),?(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={(2,?3)}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2)}
Then get into step 3 (63);
Step 3 (63): the elevation 2 of described adjacent depression grid elements node (2,3) gets into step 4 (63) less than border grid elements node (2,2);
Step 4 (63): border grid elements node set A has element, returns step 2 (64);
Step 2 (64): from the grid elements node set A of border, take out a grid elements node (1,3), with said grid elements node (1; 3) add intermediate mesh element node set C, and described grid elements node (1,3) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node (2,3) of described border grid elements node (1,3) is in the grid elements node set B of depression; Then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node, then get into step 3 (65);
Step 3 (65): if described adjacent depression grid elements node (2; 3) elevation 2 equals the elevation 2 of border grid elements node (1,3), should adjacent depression grid elements node (2; 3) add intermediate mesh element node set C; And described adjacent depression grid elements node (2,3) deleted from the grid elements node set B of depression
Border grid elements node set A does
A={?(1,?4),?(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3)}
It is 1 that logical variable T is set, and gets into step 4 (66);
Step 4 (66): border grid elements node set A has element, returns step 2 (67);
Step 2 (67): from the grid elements node set A of border, take out a grid elements node (1,4), with said grid elements node (1; 4) add intermediate mesh element node set C, and described grid elements node (1,4) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node of described border grid elements node (1,4) is not in the grid elements node set B of depression, then with described border grid elements node (1; 4) from middle grid elements node set C, delete
Border grid elements node set A does
A={(2,4),?(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3)}
Get into step 4 (68);
Step 4 (68): border grid elements node set A has element, returns step 2 (69);
Step 2 (69): from the grid elements node set A of border, take out a grid elements node (2,4), with said grid elements node (2; 4) add intermediate mesh element node set C, and described grid elements node (2,4) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node of described border grid elements node (2,4) is not in the grid elements node set B of depression, then with described border grid elements node (2; 4) from middle grid elements node set C, delete
Border grid elements node set A does
A={(3,?2),?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3)}
Get into step 4 (70);
Step 4 (70): border grid elements node set A has element, returns step 2 (71);
Step 2 (71): from the grid elements node set A of border, take out a grid elements node (3,2), with said grid elements node (3; 2) add intermediate mesh element node set C, and described grid elements node (3,2) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node of described border grid elements node (3,2) is not in the grid elements node set B of depression, then with described border grid elements node (3; 2) from middle grid elements node set C, delete
Border grid elements node set A does
A={?(3,?3),?(3,?4)}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3)}
Get into step 4 (72);
Step 4 (72): border grid elements node set A has element, returns step 2 (73);
Step 2 (73): from the grid elements node set A of border, take out a grid elements node (3,3), with said grid elements node (3; 3) add intermediate mesh element node set C, and described grid elements node (3,3) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node of described border grid elements node (3,3) is not in the grid elements node set B of depression, then with described border grid elements node (3; 3) from middle grid elements node set C, delete
Border grid elements node set A does
A={(3,?4)}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3)}
Get into step 4 (74);
Step 4 (74): border grid elements node set A has element, returns step 2 (75);
Step 2 (75): from the grid elements node set A of border, take out a grid elements node (3,4), with said grid elements node (3; 4) add intermediate mesh element node set C, and described grid elements node (3,4) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node of described border grid elements node (3,4) is not in the grid elements node set B of depression, then with described border grid elements node (3; 4) from middle grid elements node set C, delete
Border grid elements node set A does
A={?}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={(1,?2),?(2,?2),?(1,?3)}
Get into step 4 (76);
Step 4 (76): border grid elements node set A is empty, gets into step 5 (77);
Step 5 (77): all grid elements nodes of intermediate mesh element node set C are joined border mesh node set A, and intermediate mesh element node set C is set to sky simultaneously,
Border grid elements node set A does
A={(1,?2),?(2,?2),?(1,?3)?}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={?}
Logical variable T is 1, T is set equals 0, gets back to step 2 (78);
Step 2 (78): from the grid elements node set A of border, take out a grid elements node (1,2), with said grid elements node (1; 2) add intermediate mesh element node set C, and described grid elements node (1,2) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node of described border grid elements node (1,2) is not in the grid elements node set B of depression, then with described border grid elements node (1; 2) from middle grid elements node set C, delete
Border grid elements node set A does
A={(2,?2),?(1,?3)?}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={?}
Get into step 4 (79);
Step 4 (79): border grid elements node set A has element, returns step 2 (80);
Step 2 (80): from the grid elements node set A of border, take out a grid elements node (2,2), with said grid elements node (2; 2) add intermediate mesh element node set C, and described grid elements node (2,2) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node of described border grid elements node (2,2) is not in the grid elements node set B of depression, then with described border grid elements node (2; 2) from middle grid elements node set C, delete
Border grid elements node set A does
A={(1,?3)?}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={?}
Get into step 4 (81);
Step 4 (81): border grid elements node set A has element, returns step 2 (82);
Step 2 (82): from the grid elements node set A of border, take out a grid elements node (1,3), with said grid elements node (1; 3) add intermediate mesh element node set C, and described grid elements node (1,3) is deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; The adjacent mesh element node of described border grid elements node (1,3) is not in the grid elements node set B of depression, then with described border grid elements node (1; 3) from middle grid elements node set C, delete
Border grid elements node set A does
A={?}
Depression grid elements node set B does
B={?}
Intermediate mesh element node set C does,
C={?}
Get into step 4 (83);
Step 4 (83): border grid elements node set A is empty, gets into step 5 (84);
Step 5 (84): all grid elements nodes of intermediate mesh element node set C are joined border mesh node set A, and intermediate mesh element node set C is set to sky simultaneously, and logical variable T is 0, gets into step 6 (85);
Step 6 (85): border grid elements node set A is empty, gets into step 7 (86);
Step 7 (86): each grid elements node elevation that the output depression is filled and led up after the processing does,
The 1st row the 1st row elevation 5
The 1st row the 2nd row elevation 3
The 1st row the 3rd row elevation 2
The 1st row the 4th row elevation 3
The 2nd row the 1st row elevation 3
The 2nd row the 2nd row elevation 3
The 2nd row the 3rd row elevation 2
The 2nd row the 4th row elevation 3
The 3rd row the 1st row elevation 2
The 3rd row the 2nd row elevation 2
The 3rd row the 3rd row elevation 2
The 3rd row the 4th row elevation 3
Method finishes.
Claims (3)
- A digital elevation model depression fill and lead up disposal route, it is characterized in that:Step 1: the capable n row of a m grid matrix M is set is used to write down the terrain mesh altitude figures; Wherein m and n are respectively the positive integer greater than 1, and each the grid elements node among the grid matrix M is provided with a floating-point variable H, wherein floating-point variable H record terrain mesh elevation; A border grid elements node set A, a depression grid elements node set B and an intermediate mesh element node set C are set; The initial value of depression grid elements node set B is all inner mesh element nodes, and inner mesh element node is the grid elements node of the capable j row of the i when () among the grid matrix M, and the initial value of border grid elements node set A is all border grid elements nodes; Border grid elements node is other grid elements nodes in addition of inner mesh element node among the grid matrix M; The initial value of intermediate mesh element node set C is empty, wherein, logical variable T is set; Initial value T is 0, gets into step 2;Step 2: from the grid elements node set A of border, take out a grid elements node; Said grid elements node is added intermediate mesh element node set C; And described grid elements node deleted from the grid elements node set A of border; Check all grid elements nodes that described grid elements node is adjacent; If the adjacent mesh element node of described border grid elements node has in the grid elements node set B of depression, then with the adjacent mesh element node among the grid elements node set B of depression as adjacent depression grid elements node, then get into step 3; Otherwise described border grid elements node is deleted from middle grid elements node set C, got into step 4;Step 3: if the elevation of described adjacent depression grid elements node is lower than border grid elements node; Get into step 4; Otherwise should add intermediate mesh element node set C by adjacent depression grid elements node; And described adjacent depression grid elements node deleted from the grid elements node set B of depression, it is 1 that logical variable T is set, and gets into step 4;Step 4:, then get into step 5, otherwise return step 2 if border grid elements node set A is empty;Step 5: all grid elements nodes of intermediate mesh element node set C are joined border mesh node set A; Intermediate mesh element node set C is set to sky simultaneously, if logical variable T is 0, gets into step 6; Equal 0 otherwise T is set, get back to step 2;Step 6: if border grid elements node set A is empty; Get into step 7; Otherwise search the minimum elevation h in all the grid elements nodes of grid elements node set A of border; To fill and lead up to minimum elevation h less than the corresponding plot of all grid elements nodes among the depression grid elements node set B of minimum elevation h, grid elements node elevation H is set to h less than all grid elements node elevations of minimum elevation h among the depression grid elements node set B simultaneously, gets back to step 2;Step 7: each grid elements node elevation after the processing is filled and led up in the output depression.
- 2. a kind of digital elevation model according to claim 1 depression fill and lead up disposal route, it is characterized in that the lookup method of said grid elements node adjacent mesh element node is following: suppose the capable j row of an i grid elements node; If i, the value of j is that adjacent grid elements node has eight; Be respectively the capable j-1 row of i-1 grid elements node, the capable j row of i-1 grid elements node, the capable j+1 row of i-1 grid elements node, the capable j-1 row of i grid elements node, the capable j+1 row of i grid elements node, the capable j-1 row of i+1 grid elements node, the capable j row of i+1 grid elements node, the capable j+1 row of i+1 grid elements node, if i, the value of j is ; Then adjacent mesh element node has five; Be respectively the 1st row j-1 row grid elements node, the 1st row j+1 row grid elements node, the 2nd row j-1 row grid elements node, the 2nd row j row grid elements node, the 2nd row j+1 row grid elements node, if i, the value of j does; Then adjacent mesh element node has five; Be respectively the capable j-1 row of m-1 grid elements node, the capable j row of m-1 grid elements node, the capable j+1 row of m-1 grid elements node, the capable j-1 row of m grid elements node, the capable j+1 row of m grid elements node, if i, the value of j does; Then adjacent mesh element node has five; Be respectively capable the 1st row grid elements node of i-1, capable the 2nd row grid elements node of i-1, capable the 2nd row grid elements node of i, capable the 1st row grid elements node of i+1, capable the 2nd row grid elements node of i+1, if i, the value of j does; Then adjacent mesh element node has five; Be respectively the capable n-1 row of i-1 grid elements node, the capable n row of i-1 grid elements node, the capable n-1 row of i grid elements node, the capable n-1 row of i+1 grid elements node, the capable n row of i+1 grid elements node, if i, the value of j does; Then adjacent mesh element node has three; Be respectively the 1st row the 2nd row grid elements node, the 2nd row the 1st row grid elements node, the 2nd row the 2nd row grid elements node, if i, the value of j is; Then adjacent mesh element node has three; Be respectively the 1st row n-1 row grid elements node, the 2nd row n-1 row grid elements node, the 2nd row n row grid elements node, if i, the value of j does; Then adjacent mesh element node has three; Be respectively capable the 1st row grid elements node of m-1, capable the 2nd row grid elements node of m-1, capable the 2nd row grid elements node of m, if i, the value of j does; Then adjacent mesh element node has three, is respectively the capable n-1 row of m-1 grid elements node, the capable n row of m-1 grid elements node, the capable n-1 row of m grid elements node.
- 3. a kind of digital elevation model according to claim 1 depression fill and lead up disposal route, it is characterized in that each grid elements node elevation that described output depression is filled and led up after the processing is each ranks grid elements node of output and corresponding elevation thereof.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110419607.XA CN102542607B (en) | 2011-12-15 | 2011-12-15 | Filling processing method of digital elevation model depression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110419607.XA CN102542607B (en) | 2011-12-15 | 2011-12-15 | Filling processing method of digital elevation model depression |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102542607A true CN102542607A (en) | 2012-07-04 |
| CN102542607B CN102542607B (en) | 2014-03-26 |
Family
ID=46349417
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110419607.XA Expired - Fee Related CN102542607B (en) | 2011-12-15 | 2011-12-15 | Filling processing method of digital elevation model depression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102542607B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050049802A1 (en) * | 2003-08-27 | 2005-03-03 | Minton Joseph Grayson | Method for flow analysis utilizing cell elevation topology |
| CN101050961A (en) * | 2007-04-30 | 2007-10-10 | 西南林学院 | Method for fine correcting satellite remote sensing image geometry based on topographic line |
| US7899272B1 (en) * | 2005-03-07 | 2011-03-01 | Hsu Shin-Yi | Method of recognizing an object in an image using multi-sensor integration through conditionally optimal geoscene generation and registration |
-
2011
- 2011-12-15 CN CN201110419607.XA patent/CN102542607B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050049802A1 (en) * | 2003-08-27 | 2005-03-03 | Minton Joseph Grayson | Method for flow analysis utilizing cell elevation topology |
| US7899272B1 (en) * | 2005-03-07 | 2011-03-01 | Hsu Shin-Yi | Method of recognizing an object in an image using multi-sensor integration through conditionally optimal geoscene generation and registration |
| CN101050961A (en) * | 2007-04-30 | 2007-10-10 | 西南林学院 | Method for fine correcting satellite remote sensing image geometry based on topographic line |
Non-Patent Citations (2)
| Title |
|---|
| LIU YONG-HE, ET AL.: "Another Fast and Simple DEM Depression-Filling Algorithm Based on Priority Queue Structure", 《ATMOSPHERIC AND OCEANIC SCIENCE LETTERS》 * |
| 李丽，等: "基于DEM的流域特征提取综述", 《地球科学进展》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102542607B (en) | 2014-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jarvie et al. | Using species distribution modelling to determine opportunities for trophic rewilding under future scenarios of climate change | |
| Murphy et al. | Higher β‐diversity observed for herbs over woody plants is driven by stronger habitat filtering in a tropical understory | |
| Whittaker et al. | The island immaturity–speciation pulse model of island evolution: an alternative to the “diversity begets diversity” model | |
| Guevara et al. | Low phylogenetic beta diversity and geographic neo‐endemism in Amazonian white‐sand forests | |
| CN108370255A (en) | Polar code continuously eliminates memory management and paths ordering in list-decoding device | |
| US11314830B2 (en) | Method and apparatus for automatically discovering gas station POI, storage medium and device | |
| Siero et al. | Grazing away the resilience of patterned ecosystems | |
| Saikia et al. | Land-use/land-cover change and fragmentation in the Nameri Tiger Reserve, India | |
| CN104504008B (en) | A kind of Data Migration algorithm based on nested SQL to HBase | |
| CN106981092B (en) | Priority-Flood-based internal flow domain extraction method | |
| CN103500060B (en) | The manufacture method of electronic chart, producing device, display packing and display device | |
| Li et al. | Assembly processes of waterbird communities across subsidence wetlands in China: A functional and phylogenetic approach | |
| CN105843982B (en) | Bit stream generation method, device and designing system for programmable logic device | |
| CN103823854A (en) | Method for reducing data volumes of electronic maps of navigation terminals on basis of land boundary line indexes | |
| CN103150326A (en) | Skyline query method orienting to probability data flow | |
| Jung et al. | Redefining floristic zones in the Korean Peninsula using high‐resolution georeferenced specimen data and self‐organizing maps | |
| Rasquinha et al. | Modelling biome shifts in the Indian subcontinent under scenarios of future climate change | |
| CN102542607B (en) | Filling processing method of digital elevation model depression | |
| CN110018457B (en) | Method for designing satellite-borne SAR echo data frame header identifier detection functional module | |
| CN102082737A (en) | Method for replacing Web services based on service priority | |
| Linares Montes et al. | New mammal and bird tracks from the Lower Oligocene of the Ebro Basin (NE Spain): implications for the Palaeogene ichnological record | |
| CN117034051A (en) | Water conservancy information aggregation method, device and medium based on BIRCH algorithm | |
| CN104615697A (en) | Webpage level memorizing and returning method | |
| CN106095882A (en) | A kind of personalization cloud recommendation method under cloudy platform environment | |
| Salgueiro et al. | Drivers of phylogenetic structure in Amazon freshwater fish assemblages |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| 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: 20140326 Termination date: 20161215 |