CN107871048A - Large Scale Basin grid method of partition - Google Patents

Large Scale Basin grid method of partition Download PDF

Info

Publication number
CN107871048A
CN107871048A CN201711177159.0A CN201711177159A CN107871048A CN 107871048 A CN107871048 A CN 107871048A CN 201711177159 A CN201711177159 A CN 201711177159A CN 107871048 A CN107871048 A CN 107871048A
Authority
CN
China
Prior art keywords
block
grid
section
node
ascription
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201711177159.0A
Other languages
Chinese (zh)
Other versions
CN107871048B (en
Inventor
张万顺
张潇
王永桂
彭虹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuhan University WHU
Original Assignee
Wuhan University WHU
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Wuhan University WHU filed Critical Wuhan University WHU
Priority to CN201711177159.0A priority Critical patent/CN107871048B/en
Publication of CN107871048A publication Critical patent/CN107871048A/en
Application granted granted Critical
Publication of CN107871048B publication Critical patent/CN107871048B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • G06F30/23Design optimisation, verification or simulation using finite element methods [FEM] or finite difference methods [FDM]

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention provides a kind of Large Scale Basin grid method of partition, it is characterised in that including:Step 1. is based on river course relation, Heavenly Stems and Earthly Branches stream intersection is divided into node, on the basis of node, basin river course is divided into some sections by Heavenly Stems and Earthly Branches flow relation, according to upstream-downstream relationship, first mainstream is numbered, run into node, go to and tributary is numbered, return and mainstream is numbered, obtain the section system completely encoded to the basin water system in computer capacity;Step 2. determines the piecemeal regular grid quantity and size of each section, automatic piecemeal again is carried out to each section, obtains the piecemeal of suitable regular grid population size according to section feature, actual calculating grid accuracy requirement and computing machine hardware condition;Step 3., by Heavenly Stems and Earthly Branches stream section and node according to spatial relation, is divided into polytype, corresponding border exchange regulation is set respectively according to all kinds, to realize that the border of multi-block technique exchanges automatically according to the characteristics of the water system of basin.

Description

Large Scale Basin grid method of partition
Technical field
The invention belongs to hydrodynamics and environmental simulation field, and in particular to a kind of Large Scale Basin grid method of partition.
Technical background
Grid is the premise that integral unit discretization is carried out to finite element numerical simulation calculating.With with finite element numerical The continuous development of the three-dimensional hydrodynamic force water quality model of hydrodynamics method and two based on calculating, the unit of calculating is from part Watershed Scale is gradually extended to, the simulation computational accuracy demand more and more higher of Watershed Scale, basin calculating grid is more and more, enters The hardware condition and the difference of computing capability that row simulation calculates, how basin magnanimity fine grid blockses are divided into point of suitable size Block grid, to adapt to the feature in basin and design conditions, reach the maximization of computational efficiency, be current basin large scale magnanimity net The important prerequisite that lattice calculate, and improve the important technology problem of analog capability and efficiency.
Grid can be used for painting for orthogonal grid as the computing unit in numerical computations, current existing ripe business software System, also with Mesh Smoothing, it is orthogonal, delete the methods of etc. can be used for that the quality of grid is tested or edited.It is although logical The multi-block technique of suitable number of grid can be drawn according to wish using these business softwares by crossing, but be painted in basin perimeter When processed, the quantity of grid is magnanimity, by be depicted as appropriate number of grid block by each piece, it is necessary to expend manpower and Time is huge.
The content of the invention
The present invention is, and it is an object of the present invention to provide a kind of Large Scale Basin grid piecemeal side in order to solving the above problems and carry out Method, this method can obtain the multi-block technique of suitable number of grid size, so as to realize the raising of watershed discretization efficiency.
The present invention to achieve these goals, employs following scheme:
The present invention provides a kind of Large Scale Basin grid method of partition, it is characterised in that comprises the following steps:
Step 1. carries out a point Heavenly Stems and Earthly Branches flow management to the fine regular grid of magnanimity:Based on river course relation, by Heavenly Stems and Earthly Branches stream intersection Node is divided into, on the basis of node, basin river course is divided into some sections by Heavenly Stems and Earthly Branches flow relation, closed according to upstream and downstream System, first mainstream is numbered, runs into node, goes to and tributary is numbered, returns and mainstream is numbered, by section according to It is secondary to be numbered, two level, three-level tributary or even more and tributary be present if running into, first number tributary section complete Return and mainstream is numbered, be derived from the section system completely encoded to the basin water system in computer capacity;
Step 2. carries out piecemeal processing to the fine regular grid of magnanimity:According to section feature, the actual grid precision that calculates needs Ask and the hardware condition such as the calculating speed of computing machine, the piecemeal regular grid quantity and size of each section are determined, to every One section carries out automatic piecemeal again, obtains the piecemeal of suitable regular grid population size;
The border of step 3. regular multi-block technique fine to magnanimity swaps:According to the characteristics of the water system of basin, by the Heavenly Stems and Earthly Branches Section and node are flowed according to spatial relation, are divided into polytype, are set corresponding border to hand over respectively according to all kinds Rule is changed, to realize that the border of multi-block technique exchanges automatically.
Further, Large Scale Basin grid method of partition provided by the invention, there can also be following characteristics:
Step 1 includes following sub-step:
The identification of step 1-1. basins water system body structure and generalization:According to basin Law of DEM Data, basin is extracted The network of waterways, according to the needs of research practical study precision, it is determined that what tributary is network of waterways fine degree needed for calculating, that is, need, press It is general to be melted into the orthogonal linkage tree of planar according to Heavenly Stems and Earthly Branches stream, upstream-downstream relationship;
The segment encoding in step 1-2. water systems river course:The orthogonal linkage tree of planar obtained according to step 1, it is first determined Heavenly Stems and Earthly Branches stream intersection is node, then block number of grid can be punished according to two three-levels (three level Four etc.) tributary, in two three-levels (3 4 Level etc.) tributary intersection increase node, and node is gone into tributary, tributary node according to upstream toward downstream, first mainstream, chance tributary Coding is completed to go back to the order number consecutively in mainstream again;Secondly river course is numbered, is a section between two nodes, according to upper Swim toward downstream, first mainstream, meet tributary and go to tributary, tributary nodes encoding is completed to go back to the order in mainstream again;Provide along basin master Mainstream direction is I directions, is increased along water (flow) direction I;Along perpendicular to main stream direction be J directions, along main stream water (flow) direction from It is right to increase toward left direction J, according to the correlation between river course and node, obtain channel section node relation table Table_Reach_N With section information table Table_Reach_M, its table structure is as shown in following table 1 and table 2;
The Segment type in step 1-3. water systems river course is set:Node and section unification are set into type according to set of rule, And give corresponding code.
The Table_Reach_N of table 1 table structure
The Table_Reach_M of table 2 table structure
Further, Large Scale Basin grid method of partition provided by the invention, there can also be following characteristics:Step 1 is wrapped Include following sub-step:In step 1-3, type information table Table_Type is seen below shown in list 3, and gives corresponding code; Section type is divided into 1,2,3,4, and node type is unified for 5, and section type setting rule is:It is orthogonal according to step 1 planar Linkage tree, select main stream direction, along main stream upstream toward downstream direction be 1, it is in opposite direction for 3 with 1, from upstream down Trip, on the left of main stream for 2, on the right side of main stream for 4.
The Table_Type of table 3 table structure
Further, Large Scale Basin grid method of partition provided by the invention, there can also be following characteristics:Step 1 is wrapped Include following sub-step:In step 2, section is characterized as the length and section width of section.
Further, Large Scale Basin grid method of partition provided by the invention, there can also be following characteristics:
Step 1 includes following sub-step:Step 2 includes following sub-step:
Step 2-1. grid property information configurations:Treating again the multi-block technique of piecemeal has all kinds of attribute informations, grid property Information table Table_Grid_A, Table_Grid_A information sees below list 4;Each piece of grid file, is stored in dat files, Prefix is abridged for river Chinese name first letter of pinyin, and main stream is expressed as XX_00N1_00N2, and 00N1 is represented main stream to prop up Flow and be segmented for boundary, the label of segmentation;00N2 represents, the numbering of each piece of multi-block technique in each section;Tributary is then expressed as XX_00N3, N3 represent the numbering of each piece of multi-block technique in tributary;Original mesh information table Table_Grid_Old is built, Table_Grid_Old tables are as shown in following table 5:In the file of each piece of grid, comprising three parts, Part I is:KIB, IJB_NEW (1, IB), IJB_NEW (2, IB), KTYPE_IB (IB), respectively KK_B (IB), IB block numbers, the block grid rise Beginning one-dimensional IJ numberings IJB_NEW (1, IB), the end one-dimensional IJ numberings IJB_NEW (2, IB) of the block grid, block place Section Segment type KTYPE_IB (IB), the row/column number KK_B (IB) contained by the block, Part I occupies a line number altogether According to;Part II is:KIP, (IJ_NN (L, IP), I_NN (L, IP), J_NN (L, IP), L=1,2), respectively each piece of row/ Column number, during L=1, for the one-dimensional entirety IJ of each row/column starting, the two-dimentional I of each row/column starting, each row/column The two-dimentional J of starting, it is the one-dimensional entirety IJ at each row/column end as L=2, the two-dimentional I of each row/column starting, The two-dimentional J of each row/column starting, is arranged in order, to KK_B (IB) OK;Part III is:IJ_GN (IJM), (IJ_LN (IJM, L), L=1,4), I_GN (IJM), J_GN (IJM), XN (IJM), YN (IJM), ZBN (IJM), each net is represented respectively The integral one-dimensional IJ numberings of lattice, the integral one-dimensional IJ numberings of the grid in the direction of adjacent position 1,2,3,4, overall two-dimentional I are compiled Number, overall two-dimentional J numberings, the X-coordinate of grid, the Y-coordinate of grid, the elevation of grid;
Step 2-2. piecemeals condition configures:Piecemeal condition is configured first, prepares configuration file, entitled PART_ TYPE, type are DAT files, complete name PART_TYPE.dat;Configuration information table Table_Grid_Type is built, Table_Grid_Type sees below list 6, and three parts information, Part I are included in table:It is related to section, MUL_IBG, KP, MU_IBG (L_P), IJH_IBG (L_P), respectively (IB_OLD (L, L_P), L=1, MU_IBG (L_P)), section number, section sequence Number, the original block number included in each section, each section grid piecemeal population size, the original block included in each section Numbering;Part II is related to node:MU_BAY, KP, IB_NU_OLD (L_P), MU_BAY_IBG (L_P), (IB_BAY_OLD (L, L_P), L_BAY_OLD (L, L_P), L=1, MU_BAY_IBG (L_P)), respectively nodes, node ID, where node Original block number, the section number adjacent with node, the section sequence number adjacent with node, the direction of the section adjacent with node, 1 is Original position, 2 be terminal position;Part III, it is related to node, it is the adjacent situation specially treated of multiple nodes:MU_ BBAY, KP, IP, KKK, (IB_BGBAY_OLD (K, IP), LB_BGBAY_NEW (K, IP), K=1, KKK), respectively exist more The connected nodes of individual node, node ID, node original block number, the nodes adjacent with this node are adjacent with this node Node original block number, this node are only 4 in the relative position of adjacent node, lower section, or 1, left;
Step 2-3. grid automatic Partitionings:According to the piecemeal condition of step 2-2 configurations, piecemeal configuration information table is obtained Table_Grid_D, Table_Grid_D information see below list 7;First, the grid sum IJ_SUM in each section L_P is counted (L_P) total row/column number M_KK and in section, according to each section of blocked file population size IJH_IBG (L_P) of setting, ask Go out the block number KT_IJ of each section automatic Partitioning, according to block number KT_IJ, calculate actual each piece after the section piecemeal be averaged Number of grid HIJ;According to each piece after piecemeal of actual grid quantity, the attribute of grid is reconfigured, with postponing List 8 is seen below to section blocking information table Table_Reach_FM, Table_Reach_FM, position will be corresponded in original every piece of grid The gridding information for putting place assigns the grid of new block correspondence position, and then obtains the three parts information that each piece of grid is new in step 1.
The Table_GridA of table 4 table structure (grid property information table)
The Table_Grid_Old of table 5 (original mesh information table)
The Table_Grid_Type of table 6 (configuration information table)
The Table_GridD of table 7 table structure (piecemeal configuration information table)
The Table_Reach_M of table 8 table structure (section blocking information table)
Further, Large Scale Basin grid method of partition provided by the invention, there can also be following characteristics:Step 3 is wrapped Include following sub-step:
Step 3-1. exchanges border and set:Provide that the border of the four direction of each piece of grid is represented with 1,2,3,4, have Body rule is as follows:Each piece of grid left margin is 1, right margin 2, coboundary 3, lower boundary 4;When block type is 1 or 3 Or when 5, the border LB of exchange is LB1=1 and LB2=2, when block type is 2 or 4, exchanging border LB is LB1=3 and LB2=4;
Step 3-2. exchanges side and set:Regulation shares 6 sides and participates in exchanging for every piece of not a node grid;For block class When type is 1, in the block I=I (MIN) while and I=I (MAX) while, ascription 3, I=I (MIN)+1 side, ascription Property be 4, I=I (MIN)+2 side, ascription 5, I=I (MAX) -2 side, ascription 1, I=I (MAX) -1 side, assign Attribute is 2;When being 3 for block type, in the block I=I (MIN) while and I=I (MAX) while, ascription 3, I=I (MIN)+1 side, ascription 2, I=I (MIN)+2 side, ascription 1, I=I (MAX) -2 side, ascription 5, I= I (MAX) -1 side, ascription 4;When being 2 for block type, J=J (MIN) side and J=J (MAX) in the block Side, ascription 3, J=J (MIN)+1 side, ascription 4, J=J (MIN)+2 side, ascription 5, J=J (MAX) -2 Side, ascription 1, J=J (MAX) -1 side, ascription 2;When being 4 for block type, J=J (MIN) in the block While and J=J (MAX) while, ascription 3, J=J (MIN)+1 side, ascription 2, J=J (MIN)+2 side, ascription Property is 1, J=J (MAX) -2 side, ascription 4, J=J (MAX) -1 side, ascription 5;For the block where node, pin To different adjacent types, the assignment mode on two sets of sides be present:When joint block and adjacent block intersect when relative position is 1 and 2, Then I=I (MIN)+1 side, ascription 4, I=I (MIN)+2 side, ascription 5, I=I (MAX) -2 side, ascription For 1, I=I (MAX) -1 side, ascription 2;When joint block and adjacent block intersect when relative position is 3 and 4, then J=J (MIN)+1 side, ascription 4, J=J (MIN)+2 side, ascription 5, J=J (MAX) -2 side, ascription 1, J= J (MAX) -1 side, ascription 2.
Step 3-3. participates in the side exchanged:
When block type is 1 or 2, for initiating terminal, LX=3,4,5 side participates in exchanging, for end, LX= 1,2,3 side participates in exchanging;When block type is 3 or 4, for initiating terminal, LX=3,2,1 side participates in exchanging, for End, LX=5,4,3 side participate in exchanging;When block type is 5, for initiating terminal, LX=4,5 side participates in exchanging, For end, LX=1,2 side participates in exchanging;
Step 3-4. sides information exchanges:
The information of exchange comprises at least integral one-dimensional IJ, overall two dimension (I, J), (X, Y, Z) coordinate and elevation information;Two Block shares a line LX=3, first piece of LX=1,2 side by information to second piece, second piece of LX=4, and 5 side is by information To first piece;Edge flip, joint block LX=1 are carried out with node, 2 side information are assigned to not a node block, not a node block LX=3,4,5 sides Information is assigned to joint block;Or joint block LX=4,5 side information are assigned to not a node block, not a node block LX=1,2,3 side information are assigned To joint block;
Step 3-5. mesh points exchange attribute configuration:
There to be an ascription MFS=2 in each piece of grid first, be expressed as interior point;Then by boundary point, i.e. grid block In J minimaxs/I minimaxs in each row/column, such as (Imin, J), (Imax, J), (I, Jmin), (I, Jmax), etc. Ascription MFS=1 again is put, represents exterior point, i.e. boundary point;Secondly, by each piece, LX=2,5 side, in addition to boundary point, Again ascription MFS=3, represent to participate in the point that information exchanges, that is, exchange a little.
The effect of invention and effect
The present invention by dividing Heavenly Stems and Earthly Branches flow management to the fine regular grid of magnanimity, hand over automatically by automatic Partitioning processing and border Change, to realize that basin large scale calculates the preparation of grid, after-treatment is carried out to the grid of drafting, it is big to obtain suitable number of grid Small multi-block technique, so as to effectively improve watershed discretization efficiency.
Brief description of the drawings
Fig. 1 is the flow chart of large-medium scale basin grid method of partition of the embodiment of the present invention;
Fig. 2 is river network of watershed relation schematic diagram in the embodiment of the present invention;
Fig. 3 is the initial mesh schematic diagram drawn in the embodiment of the present invention;
Fig. 4 is piecemeal schematic diagram in the embodiment of the present invention;
Fig. 5 is automatic Partitioning result schematic diagram in the embodiment of the present invention;
Fig. 6 is edge flip schematic diagram in the embodiment of the present invention;
Fig. 7 is that side information exchanges schematic diagram in the embodiment of the present invention.
Embodiment
The specific embodiment of Large Scale Basin grid method of partition of the present invention is carried out below in conjunction with accompanying drawing detailed Carefully illustrate.
As shown in figure 1, the Large Scale Basin grid method of partition that the present embodiment is provided comprises the following steps:
(1) section encodes
1. nodes encoding:Based on actual network of waterways relation, generalization is generally melted into the orthogonal linkage tree of planar.It is three in Fig. 2 5 tributaries such as gorge reservoir area main stream of the Yangtze and Jia Lingjiang River, the Wujiang River, Peng Xihe, Daning River and Xiang Xi rivers.Walked according in claim 2 Rapid 2 coded system, it is first determined Heavenly Stems and Earthly Branches stream intersection is node, determines that the Heavenly Stems and Earthly Branches stream node that crosses has 5, in tributary Peng Xi Before the tributaries such as river, Daning River, Xiang Xi rivers and Three Gorges Dam, as needed, increase node, according to from upstream toward the suitable of downstream Sequence, JD1, JD2 ... ... JD18 are encoded to successively.
2. section encodes:According to upstream toward downstream, first mainstream, meet tributary and go to tributary, tributary nodes encoding is completed to turn again The order in mainstream is returned, all sections are encoded successively.Therefore it is divided into 36 sections in reservoir area of Three Gorges main stream of the Yangtze and tributary, compiles Code is respectively HD1, HD2 ... ... HD36.
3. channel section node relation is built:Based on the coding of above-mentioned two step, the channel section node relation table Table_ in Fig. 2 is built The following Table I of Reach_N:
4. the original blocking information structure in section, based on the coding of above-mentioned two step, builds the channel section node relation table in Fig. 2 The following Table II of Table_Reach_M:
Table I channel section node relation table Table_Reach_N
Table II section information table Table_Reach_M
(2) automatic Partitioning
1. piecemeal is set again for section:Based on above-listed Table II section information table Table_Reach_M, first according to each piece IJB_NEW (1, IB) IJB_NEW (2, IB) in middle grid property information, count the grid sum IJKK of each section, such as following table Total grid number in III;By demand, the size of each section piecemeal is designed, piecemeal size in following Table III, you can be somebody's turn to do The new piecemeal number in section, new piecemeal number in following Table III.The initial mesh schematic diagram of drafting is shown in Fig. 3, and piecemeal schematic diagram is shown in figure 4, automatic Partitioning result schematic diagram is shown in Fig. 5.
2. piecemeal numbering is reset:According to the new piecemeal number in each section obtained in previous step, according to the suitable of section Sequence, line renumbering is entered to new piecemeal, obtain new piecemeal numbering NFK1, NFK2 ... ... NFK382.After the completion of the piecemeal of section, then According to node sequence, line renumbering is entered to joint block, numbering starting connection section piecemeal terminates numbering, i.e., joint block is newly numbered There is NFK383 to start, obtaining joint block, newly numbering is NFK383, NFK384 ... ..., NFK400.
3. blocking information reconfigures:According to each piece after piecemeal of actual grid quantity, weight is carried out to the attribute of grid New configuration, obtains section blocking information table, is shown in Table III, the three parts information in obtaining in each piece of new grid file pattern, Will the gridding information of corresponding position assigns the grid of new block correspondence position in every piece originally.
Table III section blocking information table Table_Reach_FM
(3) border exchanges automatically
According to upstream-downstream relationship, to the multi-block technique on each section and its upstream multi-block technique and downstream multi-block technique Carry out adjacent boundary and exchange grid processing:
1. exchange side to set.When block type is 1 or 2, for initiating terminal, LX=3,4,5 side participates in exchanging, For end, LX=1,2,3 side participates in exchanging.When block type is 3 or 4, for initiating terminal, LX=3,2,1 side Participate in exchanging, for end, LX=5,4,3 side participates in exchanging.When block type is 5, for initiating terminal, LX=4,5 Side participate in exchanging, for end, LX=1,2 side participates in exchanging.
2. edge flip information.The information of exchange includes integral one-dimensional IJ, overall two dimension (I, J), (X, Y, Z) coordinate and height The information such as journey.Information is given second piece, second piece of LX=4 by two pieces of shared a line LX=3, first piece of LX=1,2 side, Information is given first piece by 5 side.Edge flip, joint block LX=1 are carried out with node, 2 side information are assigned to not a node block, not a node block LX=3,4,5 side information are assigned to joint block;Or joint block LX=4,5 side information are assigned to not a node block, not a node block LX=1, 2,3 side information are assigned to joint block.Exchange information schematic diagram and see Fig. 6 and Fig. 7.
3. mesh point exchanges attribute configuration.There to be an ascription MFS=2 in each piece of grid first, be expressed as interior point; Then by boundary point, i.e., J minimaxs/I minimaxs in each row/column in grid block, such as (Imin, J), (Imax, J), (I, Jmin), (I, Jmax), etc. point ascription MFS=1 again, represent exterior point, i.e. boundary point;Secondly, by each piece, LX =2,5 side, in addition to boundary point, ascription MFS=3, represents to participate in the point that information exchanges, that is, exchanges a little again.Gridding information Exchange schematic diagram and see Fig. 7.
Above example is only the illustration done to technical solution of the present invention.Large-scale currents involved in the present invention Domain grid method of partition is not merely defined in content described in the embodiment above, but limited with claim Scope is defined.Any modification that those skilled in the art of the invention are made on the basis of the embodiment or supplement equivalent are replaced Change, all in the claimed scope of the claim of the present invention.

Claims (6)

1. a kind of Large Scale Basin grid method of partition, it is characterised in that comprise the following steps:
Step 1. carries out a point Heavenly Stems and Earthly Branches flow management to the fine regular grid of magnanimity:
Based on river course relation, Heavenly Stems and Earthly Branches stream intersection is divided into node, on the basis of node, basin river course closed by Heavenly Stems and Earthly Branches stream System is divided into some sections, and according to upstream-downstream relationship, first mainstream is numbered, runs into node, goes to and tributary is numbered, Return and mainstream is numbered, section is numbered successively, two level, three-level tributary or even more and branch be present if running into The situation of stream, first numbering complete return in tributary section is numbered to mainstream, is derived to the basin in computer capacity The section system that water system completely encodes;
Step 2. carries out piecemeal processing to the fine regular grid of magnanimity:
According to section feature, the actual hardware condition for calculating grid accuracy requirement and computing machine, dividing for each section is determined Slip gauge then number of grid and size, automatic piecemeal again is carried out to each section, obtains suitable regular grid population size Piecemeal;
The border of step 3. regular multi-block technique fine to magnanimity swaps:
According to the characteristics of the water system of basin, by Heavenly Stems and Earthly Branches stream section and node according to spatial relation, it is divided into polytype, according to All kinds set corresponding border exchange regulation respectively, to realize that the border of multi-block technique exchanges automatically.
2. Large Scale Basin grid method of partition according to claim 1, it is characterised in that:
Wherein, step 1 includes following sub-step:
The identification of step 1-1. basins water system body structure and generalization:According to basin Law of DEM Data, river network of watershed is extracted, According to the needs of research practical study precision, it is determined that network of waterways fine degree needed for calculating, according to Heavenly Stems and Earthly Branches stream, upstream-downstream relationship, generally It is melted into the orthogonal linkage tree of planar;
The segment encoding in step 1-2. water systems river course:The orthogonal linkage tree of planar obtained according to step 1, it is first determined the Heavenly Stems and Earthly Branches Stream intersection is node, then punishes block number of grid according to tributary, and in tributary, intersection increases node, and by node according to upper Swim toward downstream, first mainstream, meet tributary and go to tributary, tributary nodes encoding is completed to go back to the order number consecutively in mainstream again;Secondly River course is numbered, is a section between two nodes, according to upstream toward downstream, first mainstream, tributary is met and goes to tributary, tributary section Point coding is completed to go back to the order in mainstream again;Regulation is I directions along basin main stream direction, is increased along water (flow) direction I;Along vertically It is J directions in main stream direction, increases along main stream water (flow) direction from right toward left direction J, according to the phase between river course and node Mutual relation, obtain channel section node relation and section information;
The Segment type in step 1-3. water systems river course is set:Node and section is unified according to set of rule setting type, and give With corresponding code.
3. Large Scale Basin grid method of partition according to claim 2, it is characterised in that:
Wherein, in step 1-3, section type is divided into 1,2,3,4, and node type is unified for 5, and section type setting rule is: According to the orthogonal linkage tree of step 1 planar, select main stream direction, along main stream upstream toward downstream direction be 1, with 1 direction It is opposite for 3, from upstream toward downstream, on the left of main stream for 2, on the right side of main stream for 4.
4. Large Scale Basin grid method of partition according to claim 1, it is characterised in that:
Wherein, in step 2, section is characterized as the length and section width of section.
5. Large Scale Basin grid method of partition according to claim 1, it is characterised in that:
Wherein, step 2 includes following sub-step:
Step 2-1. grid property information configurations:
Each piece of grid file, is stored in dat files, and prefix is abridged for river Chinese name first letter of pinyin, and main stream represents Represent main stream being segmented by boundary of tributary for XX_00N1_00N2,00N1, the label of segmentation;00N2 expressions, Mei Yiduan In each piece of multi-block technique numbering;Tributary is then expressed as XX_00N3, and N3 represents the numbering of each piece of multi-block technique in tributary;
Build original mesh information table:In the file of each piece of grid, comprising three parts, Part I is:KIB, IJB_NEW (1, IB), IJB_NEW (2, IB), KTYPE_IB (IB), respectively KK_B (IB), IB block numbers, the starting of the block grid are one-dimensional Change IJ numberings IJB_NEW (1, IB), the end one-dimensional IJ numberings IJB_NEW (2, IB) of the block grid, the section where the block Segment type KTYPE_IB (IB), the row/column number KK_B (IB) contained by the block, Part I occupies data line altogether;Second Part is:KIP, respectively (IJ_NN (L, IP), I_NN (L, IP), J_NN (L, IP), L=1,2), each piece of row/column numbering, L When=1, for one-dimensional the entirety IJ, the two-dimentional I of each row/column starting, the two of each row/column starting of the starting of each row/column The J of dimension, it is the one-dimensional entirety IJ at each row/column end as L=2, the two-dimentional I of each row/column starting, each row/column The two-dimentional J of starting, is arranged in order, to KK_B (IB) OK;Part III is:IJ_GN (IJM), (IJ_LN (IJM, L), L=1, 4), I_GN (IJM), J_GN (IJM), XN (IJM), YN (IJM), ZBN (IJM), the integral one-dimensional of each grid are represented respectively Change IJ numberings, the integral one-dimensional IJ numberings of the grid in the direction of adjacent position 1,2,3,4, overall two-dimentional I numberings, overall two-dimentional J Numbering, the X-coordinate of grid, the Y-coordinate of grid, the elevation of grid;
Step 2-2. piecemeals condition configures:
Piecemeal condition is configured first, prepares configuration file, entitled PART_TYPE, type is DAT files, complete name Referred to as PART_TYPE.dat;Configuration information table is built, three parts information, Part I are included in table:It is related to section, MUL_ IBG, KP, MU_IBG (L_P), IJH_IBG (L_P), respectively (IB_OLD (L, L_P), L=1, MU_IBG (L_P)), section Count, section sequence number, the original block number included in each section, each section grid piecemeal population size, included in each section Original block numbering;Part II is related to node:MU_BAY, KP, IB_NU_OLD (L_P), MU_BAY_IBG (L_P), (IB_BAY_OLD (L, L_P), L_BAY_OLD (L, L_P), L=1, MU_BAY_IBG (L_P)), respectively nodes, node sequence Number, the original block number where node, the section number adjacent with node, the section sequence number adjacent with node, the river adjacent with node The direction of section, 1 is original position, and 2 be terminal position;Part III, it is related to node, it is that the adjacent situation of multiple nodes is special Processing:MU_BBAY, KP, IP, KKK, (IB_BGBAY_OLD (K, IP), LB_BGBAY_NEW (K, IP), K=1, KKK), respectively The connected nodes of multiple nodes, node ID, node original block number, the nodes adjacent with this node, with this section to be present The adjacent node original block number of point, this node are only 4 in the relative position of adjacent node, lower section, or 1, left;
Step 2-3. grid automatic Partitionings:
First, row/column number M_KK total in grid sum IJ_SUM (L_P) and the section in each section L_P is counted, according to setting The each section of blocked file population size IJH_IBG (L_P) put, the block number KT_IJ of each section automatic Partitioning is obtained, according to block Number KT_IJ, calculate the average meshes quantity HIJ of each piece of reality after the section piecemeal;According to each piece after piecemeal of actual net Lattice quantity, the attribute of grid is reconfigured, with postponing to obtain section blocking information, position will be corresponded in original every piece of grid The gridding information for putting place assigns the grid of new block correspondence position, and then obtains the three parts information that each piece of grid is new in step 1.
6. Large Scale Basin grid method of partition according to claim 1, it is characterised in that:
Wherein, step 3 includes following sub-step:
Step 3-1. exchanges border and set:
Provide that the border of the four direction of each piece of grid represents that specific rules are as follows with 1,2,3,4:The each piece of grid left side Boundary is 1, right margin 2, coboundary 3, lower boundary 4;When block type be 1 either 3 or 5 when, the border LB of exchange For LB1=1 and LB2=2, when block type is 2 or 4, exchange border LB is LB1=3 and LB2=4;
Step 3-2. exchanges side and set:
Regulation shares 6 sides and participates in exchanging for every piece of not a node grid;When being 1 for block type, I=I in the block (MIN) while and I=I (MAX) while, ascription 3, I=I (MIN)+1 side, ascription 4, I=I (MIN)+2 side, Ascription be 5, I=I (MAX) -2 side, ascription 1, I=I (MAX) -1 side, ascription 2;It is 3 for block type When, in the block I=I (MIN) while and I=I (MAX) while, ascription 3, I=I (MIN)+1 side, ascription 2, I =I (MIN)+2 side, ascription 1, I=I (MAX) -2 side, ascription 5, I=I (MAX) -1 side, ascription 4; When being 2 for block type, in the block J=J (MIN) while and J=J (MAX) while, ascription 3, J=J (MIN)+1 Side, ascription 4, J=J (MIN)+2 side, ascription 5, J=J (MAX) -2 side, ascription 1, J=J (MAX) - 1 side, ascription 2;When being 4 for block type, in the block J=J (MIN) while and J=J (MAX) while, ascription For 3, J=J (MIN)+1 side, ascription 2, J=J (MIN)+2 side, ascription 1, J=J (MAX) -2 side, ascription Property is 4, J=J (MAX) -1 side, ascription 5;
For the block where node, for different adjacent types, the assignment mode on two sets of sides be present:
When joint block and adjacent block intersect when relative position is 1 and 2, then I=I (MIN)+1 side, ascription 4, I=I (MIN)+2 side, ascription 5, I=I (MAX) -2 side, ascription 1, I=I (MAX) -1 side, ascription 2;When Joint block intersects with adjacent block when relative position is 3 and 4, then J=J (MIN)+1 side, ascription 4, J=J (MIN)+2 Side, ascription 5, J=J (MAX) -2 side, ascription 1, J=J (MAX) -1 side, ascription 2;
Step 3-3. participates in the side exchanged:
When block type is 1 or 2, for initiating terminal, LX=3,4,5 side participates in exchanging, for end, LX=1, and 2, 3 side participates in exchanging;When block type is 3 or 4, for initiating terminal, LX=3,2,1 side participates in exchanging, for end, LX=5,4,3 side participate in exchanging;When block type is 5, for initiating terminal, LX=4,5 side participates in exchanging, for end End, LX=1,2 side participate in exchanging;
Step 3-4. sides information exchanges:
The information of exchange comprises at least integral one-dimensional IJ, overall two dimension (I, J), (X, Y, Z) coordinate and elevation information;Two pieces altogether There is a line LX=3, first piece of LX=1,2 side by information to second piece, second piece of LX=4,5 side is by information to the One piece;Edge flip, joint block LX=1 are carried out with node, 2 side information are assigned to not a node block, not a node block LX=3,4,5 side information It is assigned to joint block;Or joint block LX=4,5 side information are assigned to not a node block, not a node block LX=1,2,3 side information are assigned to save Point block;
Step 3-5. mesh points exchange attribute configuration:
There to be an ascription MFS=2 in each piece of grid first, be expressed as interior point;Then it is by boundary point, i.e., every in grid block J minimaxs/I minimaxs in one row/column, such as (Imin, J), (Imax, J), (I, Jmin), (I, Jmax), etc. point weight New ascription MFS=1, represents exterior point, i.e. boundary point;Secondly, by each piece, LX=2,5 side, in addition to boundary point, again Ascription MFS=3, represent to participate in the point that information exchanges, that is, exchange a little.
CN201711177159.0A 2017-11-22 2017-11-22 Large Scale Basin grid method of partition Active CN107871048B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711177159.0A CN107871048B (en) 2017-11-22 2017-11-22 Large Scale Basin grid method of partition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711177159.0A CN107871048B (en) 2017-11-22 2017-11-22 Large Scale Basin grid method of partition

Publications (2)

Publication Number Publication Date
CN107871048A true CN107871048A (en) 2018-04-03
CN107871048B CN107871048B (en) 2019-08-20

Family

ID=61754579

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711177159.0A Active CN107871048B (en) 2017-11-22 2017-11-22 Large Scale Basin grid method of partition

Country Status (1)

Country Link
CN (1) CN107871048B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110751723A (en) * 2018-07-25 2020-02-04 中国水利水电科学研究院 Same sub-basin river channel grid calculation order coding method
CN115222913A (en) * 2022-03-29 2022-10-21 广州汽车集团股份有限公司 Grid generation method, grid generation device, structure simulation analysis method, structure simulation analysis device, equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090171628A1 (en) * 2007-12-31 2009-07-02 Shay Peretz Planning a sensor array in accordance with tempo-spatial path estimation of potential intruders
CN103823988A (en) * 2014-03-07 2014-05-28 华北电力大学 Method for predicating and analyzing water quantity and quality coupling simulation in oversized river basin
CN104200045B (en) * 2014-09-17 2016-01-13 武汉大学 The parallel calculating method of a kind of basin large scale water system sediments formula hydrodynamic model
CN106202265A (en) * 2016-06-29 2016-12-07 武汉大学 The basin large scale fine regular grid of Complex River magnanimity paint volume method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090171628A1 (en) * 2007-12-31 2009-07-02 Shay Peretz Planning a sensor array in accordance with tempo-spatial path estimation of potential intruders
CN103823988A (en) * 2014-03-07 2014-05-28 华北电力大学 Method for predicating and analyzing water quantity and quality coupling simulation in oversized river basin
CN104200045B (en) * 2014-09-17 2016-01-13 武汉大学 The parallel calculating method of a kind of basin large scale water system sediments formula hydrodynamic model
CN106202265A (en) * 2016-06-29 2016-12-07 武汉大学 The basin large scale fine regular grid of Complex River magnanimity paint volume method

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110751723A (en) * 2018-07-25 2020-02-04 中国水利水电科学研究院 Same sub-basin river channel grid calculation order coding method
CN110766792A (en) * 2018-07-25 2020-02-07 中国水利水电科学研究院 Grid calculation order coding method based on ArcGIS hydrological analysis tool
CN110751723B (en) * 2018-07-25 2021-03-12 中国水利水电科学研究院 Same sub-basin river channel grid calculation order coding method
CN110766792B (en) * 2018-07-25 2021-03-12 中国水利水电科学研究院 Grid calculation order coding method based on ArcGIS hydrological analysis tool
CN115222913A (en) * 2022-03-29 2022-10-21 广州汽车集团股份有限公司 Grid generation method, grid generation device, structure simulation analysis method, structure simulation analysis device, equipment and storage medium
CN115222913B (en) * 2022-03-29 2024-03-15 广州汽车集团股份有限公司 Grid generation and structure simulation analysis method, device, equipment and storage medium

Also Published As

Publication number Publication date
CN107871048B (en) 2019-08-20

Similar Documents

Publication Publication Date Title
CN110717251B (en) Distributed hydrological model sub-basin partitioning method considering multiple elements
CN107944102B (en) The grid joining method of basin large scale Complex River
CN102915227B (en) Parallel method for large-area drainage basin extraction
CN106202265B (en) Large scale Complex River magnanimity fine regular grid in basin draws volume method
CN104200045B (en) The parallel calculating method of a kind of basin large scale water system sediments formula hydrodynamic model
CN108986222B (en) Branch-free river channel digital terrain generation method
CN110689283B (en) River system and canal system staggered water supply simulation method and device based on underground water model
CN112149314B (en) Multi-sand reservoir capacity silt flushing simulation method based on virtual reservoir capacity correction
CN103236086A (en) Multiscale DEM (Digital Elevation Model) modeling method giving consideration to contents of surface hydrology
CN101158985A (en) Ultra-dimension fluvial dynamics self-adapting parallel monitoring method
CN110782526B (en) Different sub-basin river channel grid calculation order coding method
CN107871048B (en) Large Scale Basin grid method of partition
CN113392489B (en) Calculation method of distributed hydrodynamic model of river system
Lammers et al. Automating object representation of drainage basins
CN108090164B (en) A kind of basin large scale calculates the coding method of magnanimity grid
Arge et al. I/O-efficient computation of water flow across a terrain
CN103700142A (en) Multiresolution multilayer successive point adding LiDAR (Light Detection and Ranging) filtering algorithm
CN115964855B (en) Sub-watershed dividing method based on water engineering and hydrologic station
CN113128009B (en) Sub-basin unit division method considering mountain area plain landform difference
Garbrecht et al. Digital landscape parameterization for hydrological applications
Lowe et al. 1D and 2D Flow Routing on a Terrain
CN107871041A (en) The grid processing method of basin complicated landform
CN113128008B (en) Sub-basin dividing and coding method reflecting subsurface bedding surface type characteristics
CN116542580B (en) Water conservancy service system construction method and system based on variable service matrix
CN109271471A (en) A kind of hilly region in South China drainage networks construction method based on Vector Data Model

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant