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

Large Scale Basin grid method of partition Download PDF

Info

Publication number
CN107871048B
CN107871048B CN201711177159.0A CN201711177159A CN107871048B CN 107871048 B CN107871048 B CN 107871048B CN 201711177159 A CN201711177159 A CN 201711177159A CN 107871048 B CN107871048 B CN 107871048B
Authority
CN
China
Prior art keywords
block
section
node
grid
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.)
Active
Application number
CN201711177159.0A
Other languages
Chinese (zh)
Other versions
CN107871048A (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 by comprising: step 1. is based on river relationship, Heavenly Stems and Earthly Branches stream intersection is divided into node, on the basis of node, basin river is divided into several sections by Heavenly Stems and Earthly Branches flow relation, according to upstream-downstream relationship, first mainstream is numbered, encounter node, it goes 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 according to section feature, practical calculating grid accuracy requirement and computing machine hardware condition, carries out automatic piecemeal again to each section, obtains the piecemeal of suitable regular grid population size;The characteristics of step 3. is according to basin water system, by Heavenly Stems and Earthly Branches stream section and node according to spatial relation, there are many types, corresponding boundary exchange regulation are respectively set according to various types, the boundary of Lai Shixian multi-block technique exchanges automatically.

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 that integral unit discretization is carried out the premise of finite element numerical simulation calculating.With with finite element numerical The continuous development of hydrodynamics method based on calculating and two three-dimensional hydrodynamic force water quality models, the unit of calculating is from part It is gradually extended to Watershed Scale, the simulation computational accuracy demand of Watershed Scale is higher and higher, and basin calculating grid is more and more, into How basin magnanimity fine grid blocks are divided into point of suitable size by the difference of row the simulation hardware condition calculated and computing capability Block grid, the feature and design conditions in the basin Lai Shiying, reaches the maximization of computational efficiency, is 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 drawing for orthogonal grid as the computing unit in numerical value calculating, the current business software for having maturation System, also have Mesh Smoothing, it is orthogonal, the methods of delete etc. and can be used to that the quality of grid is tested or edited.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 drawn in basin perimeter When processed, the quantity of grid is magnanimity, by being depicted as appropriate number of grid block for each piece, the manpower for needing to expend and Time is huge.
Summary of the invention
The present invention is to carry out to solve the above-mentioned problems, and it is an object of the present invention to provide a kind of Large Scale Basin grid piecemeal side Method, this method can obtain the multi-block technique of suitable number of grid size, to realize the raising of watershed discretization efficiency.
The present invention to achieve the goals above, uses following scheme:
The present invention provides a kind of Large Scale Basin grid method of partition, which comprises the following steps:
Step 1. carries out a point Heavenly Stems and Earthly Branches flow management to the fine regular grid of magnanimity: river relationship is based on, by Heavenly Stems and Earthly Branches stream intersection It is divided into node, on the basis of node, basin river is divided into several sections by Heavenly Stems and Earthly Branches flow relation, is closed according to upstream and downstream System, first mainstream is numbered, encounters node, goes to and tributary is numbered, returns and mainstream is numbered, by section according to It is secondary to be numbered, if encountering the case where there are second level, three-level tributary or even more and tributaries, first tributary section is numbered complete It returns and mainstream is numbered, thus to obtain 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 practical grid precision that calculates is needed It asks and the hardware conditions such as the calculating speed of computing machine, the piecemeal regular grid quantity and size of each section is determined, to every One section carries out automatic piecemeal again, obtains the piecemeal of suitable regular grid population size;
Step 3. swaps the boundary of the fine regular multi-block technique of magnanimity: the characteristics of according to basin water system, by the Heavenly Stems and Earthly Branches Section and node are flowed according to spatial relation, and there are many types, and corresponding boundary is respectively set according to various types and hands over Rule is changed, the boundary of Lai Shixian multi-block technique exchanges automatically.
Further, Large Scale Basin grid method of partition provided by the invention, can also have the feature that
Step 1 includes following sub-step:
The identification and generalization of the basin step 1-1. water system body structure: according to basin Law of DEM Data, basin is extracted The network of waterways determines network of waterways fine degree needed for calculating, that is, what tributary is needed, is pressed according to the needs of research practical study precision According to Heavenly Stems and Earthly Branches stream, upstream-downstream relationship is general to be melted into the orthogonal linkage tree of planar;
The segment encoding in step 1-2. water system river: 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 Grade etc.) tributary intersection increases node, and by node according to upstream toward downstream, first mainstream meets tributary and goes to tributary, tributary node Coding completes the sequence number consecutively for going back to mainstream again;Secondly river is numbered, is a section between two nodes, according to upper It swims toward downstream, first mainstream, meets tributary and go to tributary, tributary nodes encoding completes the sequence for going back to mainstream again;Regulation is along basin master Mainstream direction is the direction I, is increased along water (flow) direction I;Along perpendicular to main stream direction be the direction J, along main stream water (flow) direction from It is right to increase toward left direction J, according to the correlation between river and node, obtain channel section node relation table Table_Reach_N With section information table Table_Reach_M, table structure is as shown in following table 1 and table 2;
The Segment type in step 1-3. water system river is arranged: type is arranged according to set of rule in node and section unification, And give corresponding code.
The table structure of 1 Table_Reach_N of table
The table structure of 2 Table_Reach_M of table
Further, Large Scale Basin grid method of partition provided by the invention can also have the feature that 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, section type setting rule are as follows: orthogonal according to step 1 planar Linkage tree, select main stream direction, along main stream upstream toward downstream direction be 1, contrary with 1 is 3, down from upstream Trip, is 2 on the left of main stream, is 4 on the right side of main stream.
The table structure of 3 Table_Type of table
Further, Large Scale Basin grid method of partition provided by the invention can also have the feature that step 1 is wrapped Include following sub-step: in step 2, section feature is the length and section width of section.
Further, Large Scale Basin grid method of partition provided by the invention, can also have the feature that
Step 1 includes following sub-step: step 2 includes following sub-step:
Step 2-1. grid property information configuration: the multi-block technique to piecemeal again 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 file, Prefix is the abbreviation of river Chinese name first letter of pinyin, and main stream is expressed as XX_00N1_00N2, and 00N1 is indicated main stream to prop up Stream is that boundary is segmented, the label of segmentation;00N2 indicates, the number of each piece of multi-block technique in each section;Tributary is then expressed as XX_00N3, N3 indicate the number of each piece of multi-block technique in tributary;Original mesh information table Table_Grid_Old is constructed, Table_Grid_Old table is as shown in following table 5: including three parts, first part in the file of each piece of grid are as follows: KIB, IJB_NEW (1, IB), IJB_NEW (2, IB), KTYPE_IB (IB), KK_B (IB), respectively IB block number, the block grid rise Beginning one-dimensional IJ number IJB_NEW (1, IB), the end one-dimensional IJ number IJB_NEW (2, IB) of the block grid, block place Section Segment type KTYPE_IB (IB), row/column number KK_B (IB) contained by the block, first part occupies a line number altogether According to;Second part are as follows: KIP, (IJ_NN (L, IP), I_NN (L, IP), J_NN (L, IP), L=1,2), respectively each piece of row/ Column number, when L=1, for the one-dimensional entirety IJ of each row/column starting, the two-dimensional I of each row/column starting, each row/column The two-dimensional J of starting is the one-dimensional entirety IJ at each row/column end as L=2, the two-dimensional I of each row/column starting, The two-dimensional J of each row/column starting, is arranged successively, until KK_B (IB) row;Part III are as follows: IJ_GN (IJM), (IJ_LN (IJM, L), L=1,4), I_GN (IJM), J_GN (IJM), XN (IJM), YN (IJM), ZBN (IJM) respectively indicates each net The integral one-dimensional IJ of lattice is numbered, and the integral one-dimensional IJ number of the grid in 1,2,3,4 direction of adjacent position, whole two dimension I is compiled Number, whole two dimension J number, the X-coordinate of grid, the Y-coordinate of grid, the elevation of grid;
The configuration of step 2-2. piecemeal condition: first configuring piecemeal condition, prepares configuration file, entitled PART_ TYPE, type are DAT file, complete name PART_TYPE.dat;Configuration information table Table_Grid_Type is constructed, Table_Grid_Type sees below list 6, includes three parts information in table, first part:, MUL_IBG, KP related to section, MU_IBG (L_P), IJH_IBG (L_P), (IB_OLD (L, L_P), L=1, MU_IBG (L_P)), respectively section number, section sequence Number, the original block number for including in each section, each section grid piecemeal population size, the original block for including in each section Number;Second part 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 number of nodes, node ID, where node Original block number, the section number adjacent with node, the section serial number adjacent with node, the direction of the section adjacent with node, 1 is Initial 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 number of nodes of a node, node ID, the original block number of node, the number of nodes adjacent with this node are adjacent with this node The original block number of node, this node are only 4 in the relative position of adjacent node, lower section or 1, left;
Step 2-3. grid automatic Partitioning: according to the piecemeal condition of step 2-2 configuration, piecemeal configuration information table is obtained Table_Grid_D, Table_Grid_D information see below list 7;Firstly, counting the grid sum IJ_SUM in each section L_P (L_P) total row/column number M_KK and in section is asked according to each section of blocked file population size IJH_IBG (L_P) of setting The block number KT_IJ of each section automatic Partitioning out calculates after the section piecemeal practical each piece and is averaged according to block number KT_IJ 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 at the place of setting assigns the grid of new block corresponding position, and then obtains the three parts information that each piece of grid is new in step 1.
The table structure (grid property information table) of 4 Table_GridA of table
5 Table_Grid_Old of table (original mesh information table)
6 Table_Grid_Type of table (configuration information table)
The table structure (piecemeal configuration information table) of 7 Table_GridD of table
The table structure (section blocking information table) of 8 Table_Reach_M of table
Further, Large Scale Basin grid method of partition provided by the invention can also have the feature that step 3 is wrapped Include following sub-step:
Step 3-1. exchange boundary setting: the boundary of the four direction of each piece of grid of regulation indicates have with 1,2,3,4 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 boundary LB of exchange is LB1=1 and LB2=2, and when block type is 2 or 4, exchange boundary LB is LB1=3 and LB2=4;
Step 3-2. exchanges side setting: regulation shares 6 sides and participates in exchange 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, the side of I=I (MIN)+1, ascription Property be 4, the side of I=I (MIN)+2, ascription 5, the side of I=I (MAX) -2, ascription 1, the side of I=I (MAX) -1, 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, the side of I=I (MIN)+2, ascription 1, the side of I=I (MAX) -2, ascription 5, I= The side of I (MAX) -1, ascription 4;When being 2 for block type, the side of J=J (MIN) and J=J (MAX) in the block Side, ascription 3, the side of J=J (MIN)+1, ascription 4, the side of J=J (MIN)+2, ascription 5, J=J (MAX) -2 Side, ascription 1, the side of J=J (MAX) -1, ascription 2;When being 4 for block type, J=J (MIN) in the block While and J=J (MAX) while, ascription 3, the side of J=J (MIN)+1, ascription 2, the side of J=J (MIN)+2, ascription Property is 1, the side of J=J (MAX) -2, ascription 4, the side of J=J (MAX) -1, ascription 5;For the block where node, needle To different adjacent types, there are the assignment modes on two sets of sides: when joint block and adjacent block intersect when relative position is 1 and 2, The then side of I=I (MIN)+1, ascription 4, the side of I=I (MIN)+2, ascription 5, the side of I=I (MAX) -2, ascription For the side of 1, I=I (MAX) -1, ascription 2;When joint block and adjacent block intersect when relative position is 3 and 4, then J=J (MIN)+1 side, ascription 4, the side of J=J (MIN)+2, ascription 5, the side of J=J (MAX) -2, ascription 1, J= The side of J (MAX) -1, ascription 2.
Step 3-3. participates in the side of exchange:
When block type is 1 or 2, for starting point, LX=3,4,5 side participates in exchange, for end, LX= 1,2,3 side participates in exchange;When block type is 3 or 4, for starting point, LX=3,2,1 side participates in exchange, for End, LX=5,4,3 side participate in exchange;When block type is 5, for starting point, LX=4,5 side participates in exchange, For end, LX=1,2 side participates in exchange;
The exchange of step 3-4. side information:
The information of exchange includes at least integral one-dimensional IJ, whole two dimension (I, J), (X, Y, Z) coordinate and elevation information;Two Block shares the side of a line LX=3, first piece of LX=1,2 for 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 informations are assigned to not a node block, not a node block LX=3,4,5 sides Information is assigned to joint block;Alternatively, joint block LX=4,5 side informations are assigned to not a node block, not a node block LX=1, and 2,3 side informations are assigned To joint block;
Step 3-5. mesh point exchanges attribute configuration:
First by all the points ascription MFS=2 in each piece of grid, it is expressed as interior point;Then by boundary point, i.e. grid block In J minimax/I minimax in each row/column, such as (Imin, J), (Imax, J), (I, Jmin), (I, Jmax), etc. Ascription MFS=1 again is put, indicates exterior point, i.e. boundary point;Secondly, by each piece, LX=2,5 side, in addition to boundary point, Again ascription MFS=3 indicates the point of participation information exchange, i.e. exchange point.
The action and effect of invention
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 boundary It changes, the basin Lai Shixian large scale calculates the preparation of grid, carries out secondary treatment to the grid of drafting, it is big to obtain suitable number of grid Small multi-block technique, to effectively improve watershed discretization efficiency.
Detailed description of the invention
Fig. 1 is the flow chart of large-medium scale basin of embodiment of the present invention grid method of partition;
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.
Specific embodiment
It is carried out below in conjunction with specific embodiment of the attached drawing to Large Scale Basin grid method of partition of the present invention detailed Carefully illustrate.
As shown in Figure 1, Large Scale Basin grid method of partition provided by the present embodiment the following steps are included:
(1) section encodes
1. nodes encoding: being based on practical network of waterways relationship, 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 the river Xiang Xi.It is walked according in claim 2 Rapid 2 coding mode, 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, the river Xiang Xi and Three Gorges Dam, as needed, increase node, according to from upstream toward the suitable of downstream Sequence is successively encoded to JD1, JD2 ... ... JD18.
2. section encodes: according to upstream toward downstream, first mainstream meets tributary and goes to tributary, and nodes encoding completion in tributary turns again The sequence for going back to mainstream, successively encodes all sections.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 relationship constructs: the coding based on above-mentioned two step, the channel section node relation table Table_ in structure figures 2 The following Table I of Reach_N:
4. the building of the original blocking information in section, the channel section node relation table based on the coding of above-mentioned two step, in structure figures 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 arranged again for section: above-listed Table II section information table Table_Reach_M is based on, first according to each piece IJB_NEW (1, IB) IJB_NEW (2, IB) in middle grid property information counts 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, this can be obtained in piecemeal size in following Table III The new piecemeal number in section, new piecemeal number in following Table III.The initial mesh schematic diagram of drafting is shown in that Fig. 3, piecemeal schematic diagram are shown in figure 4, automatic Partitioning result schematic diagram is shown in Fig. 5.
2. piecemeal number is reset: each new piecemeal number in section according to obtained in previous step, according to the suitable of section Sequence renumbers new piecemeal, obtains new piecemeal number NFK1, NFK2 ... ... NFK382.After the completion of the piecemeal of section, then According to node sequence, joint block is renumberd, number starting connection section piecemeal terminates number, i.e., joint block is newly numbered There is NFK383 to start, obtains joint block newly to number being NFK383, NFK384 ... ..., NFK400.
3. blocking information reconfigures: according to each piece after piecemeal of actual grid quantity, carrying out weight to the attribute of grid New configuration, obtains section blocking information table, is shown in Table III, obtain in three parts information in each piece of new grid file pattern, The grid of new block corresponding position will be assigned by the gridding information of corresponding position in original every piece.
Table III section blocking information table Table_Reach_FM
(3) boundary exchanges automatically
According to upstream-downstream relationship, to the multi-block technique and its upstream multi-block technique and downstream multi-block technique on each section Carry out adjacent boundary exchange grid processing:
1. exchanging side setting.When block type is 1 or 2, for starting point, LX=3,4,5 side participates in exchange, For end, LX=1,2,3 side participates in exchange.When block type is 3 or 4, for starting point, LX=3,2,1 side Exchange is participated in, for end, LX=5,4,3 side participates in exchange.When block type is 5, for starting point, LX=4,5 Side participate in exchange, for end, LX=1,2 side participates in exchange.
2. edge flip information.The information of exchange includes integral one-dimensional IJ, whole 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 the side of two pieces of shared a line LX=3, first piece of LX=1,2, Information is given first piece by 5 side.Edge flip, joint block LX=1 are carried out with node, 2 side informations are assigned to not a node block, not a node block LX=3,4,5 side informations are assigned to joint block;Alternatively, joint block LX=4,5 side informations are assigned to not a node block, not a node block LX=1, 2,3 side informations are assigned to joint block.Exchange information schematic diagram is shown in Fig. 6 and Fig. 7.
3. mesh point exchanges attribute configuration.First by all the points ascription MFS=2 in each piece of grid, it is expressed as interior point; Then by boundary point, i.e., J minimax/I minimax in each row/column in grid block, such as (Imin, J), (Imax, J), (I, Jmin), (I, Jmax), etc. point ascription MFS=1 again, indicate exterior point, i.e. boundary point;Secondly, by each piece, LX =2,5 side, in addition to boundary point, ascription MFS=3, indicates the point of participation information exchange, i.e. exchange point again.Gridding information Exchange schematic diagram is shown in Fig. 7.
Above embodiments are only the illustration done to technical solution of the present invention.Large-scale currents according to the present invention Domain grid method of partition is not merely defined in described content in the embodiment above, but defined by claim Subject to range.Any modify or supplement that those skilled in the art of the invention are done on the basis of the embodiment equivalent is replaced It changes, all in claim range claimed of the invention.

Claims (1)

1. a kind of Large Scale Basin grid method of partition, which 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 relationship, Heavenly Stems and Earthly Branches stream intersection is divided into node, on the basis of node, basin river is closed by Heavenly Stems and Earthly Branches stream System is divided into several sections, according to upstream-downstream relationship, is first numbered to mainstream, encounters node, goes to and tributary is numbered, It returns and mainstream is numbered, section is successively numbered, there are second level, three-level tributary or even more and branch if encountering Tributary section number is first completely returned and mainstream is numbered, thus to obtain to the basin in computer capacity by the case where stream The section system that water system completely encodes;Including following sub-step:
The identification and generalization of the basin step 1-1. water system body structure: according to basin Law of DEM Data, extracting river network of watershed, According to the needs of research practical study precision, network of waterways fine degree needed for calculating is determined, 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 system river: 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 It swims toward downstream, first mainstream, meets tributary and go to tributary, tributary nodes encoding completes the sequence number consecutively for going back to mainstream again;Secondly River is numbered, is a section between two nodes, according to upstream toward downstream, first mainstream meets tributary and goes to tributary, tributary section Point coding completes the sequence for going back to mainstream again;Regulation is the direction I along basin main stream direction, is increased along water (flow) direction I;Along vertical It is the direction J in main stream direction, increases from right toward left direction J along main stream water (flow) direction, according to the phase between river and node Mutual relation obtains channel section node relationship and section information;
The Segment type in step 1-3. water system river is arranged: node and section is unified according to set of rule setting type, and give With corresponding code: section type is divided into 1,2,3,4, and node type is unified for 5, section type setting rule are as follows: according to step 1 The orthogonal linkage tree of planar, select main stream direction, along main stream upstream toward downstream direction be 1, contrary with 1 is 3, It is 2 on the left of main stream from upstream toward downstream, is 4 on the right side of main stream;
Step 2. carries out piecemeal processing to the fine regular grid of magnanimity:
According to the length and section width of section, the practical hardware condition for calculating grid accuracy requirement and computing machine is determined The piecemeal regular grid quantity and size of each section carry out automatic piecemeal again to each section, obtain suitable rule mesh The piecemeal of lattice population size;Including following sub-step:
Step 2-1. grid property information configuration:
Each piece of grid file, is stored in dat file, and prefix is the abbreviation of river Chinese name first letter of pinyin, and main stream indicates For XX_00N1_00N2, main stream is segmented by 00N1 expression by boundary of tributary, the label of segmentation;00N2 expression, Mei Yiduan In each piece of multi-block technique number;Tributary is then expressed as XX_00N3, and N3 indicates the number of each piece of multi-block technique in tributary;
It constructs original mesh information table: including three parts, first part are as follows: KIB, IJB_NEW in the file of each piece of grid (1, IB), IJB_NEW (2, IB), KTYPE_IB (IB), KK_B (IB), respectively IB block number, the starting of the block grid are one-dimensional Change IJ number IJB_NEW (1, IB), the end one-dimensional IJ number IJB_NEW (2, IB) of the block grid, the section where the block Segment type KTYPE_IB (IB), row/column number KK_B (IB) contained by the block, first part occupies data line altogether;Second Part are as follows: KIP, (IJ_NN (L, IP), I_NN (L, IP), J_NN (L, IP), L=1,2), respectively each piece of row/column number, L When=1, for one-dimensional the entirety IJ, the two-dimensional I of each row/column starting, the two of each row/column starting of the starting of each row/column The J of dimension is the one-dimensional entirety IJ at each row/column end as L=2, the two-dimensional I of each row/column starting, each row/column The two-dimensional J of starting, is arranged successively, until KK_B (IB) row;Part III are as follows: IJ_GN (IJM), (IJ_LN (IJM, L), L=1, 4), I_GN (IJM), J_GN (IJM), XN (IJM), YN (IJM), ZBN (IJM) respectively indicate the integral one-dimensional of each grid Change IJ number, the integral one-dimensional IJ number of the grid in 1,2,3,4 direction of adjacent position, whole two dimension I number, whole two dimension J Number, the X-coordinate of grid, the Y-coordinate of grid, the elevation of grid;
The configuration of step 2-2. piecemeal condition:
Piecemeal condition is configured first, prepares configuration file, entitled PART_TYPE, type is DAT file, complete name Referred to as PART_TYPE.dat;Configuration information table is constructed, includes three parts information, first part:, MUL_ related to section in table IBG, KP, MU_IBG (L_P), IJH_IBG (L_P), (IB_OLD (L, L_P), L=1, MU_IBG (L_P)), respectively section It counts, section serial number, the original block number for including in each section, each section grid piecemeal population size, includes in each section Original block number;Second part 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 number of nodes, node sequence Number, the original block number where node, the section number adjacent with node, the section serial number adjacent with node, the river adjacent with node The direction of section, 1 is initial 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 For there are the number of nodes that multiple nodes are connected, node ID, the original block number of node, the number of nodes adjacent with this node, with this section The adjacent original block number of node of point, this node are only 4 in the relative position of adjacent node, lower section or 1, left;
Step 2-3. grid automatic Partitioning:
Firstly, count row/column number M_KK total in grid sum IJ_SUM (L_P) and the section in each section L_P, according to setting The each section of blocked file population size IJH_IBG (L_P) set, finds out the block number KT_IJ of each section automatic Partitioning, according to block Number KT_IJ calculates practical each piece of average meshes quantity HIJ after the section piecemeal;According to each piece after piecemeal of practical net Lattice quantity reconfigures the attribute of grid, with postponing to obtain section blocking information, will correspond to position in original every piece of grid The gridding information at the place of setting assigns the grid of new block corresponding position, and then obtains the three parts information that each piece of grid is new in step 1;
Step 3. swaps the boundary of the fine regular multi-block technique of magnanimity:
The characteristics of according to basin water system, by Heavenly Stems and Earthly Branches stream section and node according to spatial relation, there are many type, according to Corresponding boundary exchange regulation is respectively set in various types, and the boundary of Lai Shixian multi-block technique exchanges automatically;Including following sub-step It is rapid:
Step 3-1. exchanges boundary setting:
Provide that the boundary of the four direction of each piece of grid indicates that specific rules are as follows with 1,2,3,4: each piece of grid left side Boundary is 1, right margin 2, coboundary 3, lower boundary 4;When block type is 1 or 3 or 5, the boundary LB of exchange For LB1=1 and LB2=2, when block type is 2 or 4, exchange boundary LB is LB1=3 and LB2=4;
Step 3-2. exchanges side setting:
Regulation shares 6 sides and participates in exchange 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, the side of I=I (MIN)+1, ascription 4, the side of I=I (MIN)+2, Ascription is the side of 5, I=I (MAX) -2, ascription 1, the side of I=I (MAX) -1, ascription 2;It is 3 for block type When, in the block I=I (MIN) while and I=I (MAX) while, ascription 3, the side of I=I (MIN)+1, ascription 2, I The side of=I (MIN)+2, ascription 1, the side of I=I (MAX) -2, ascription 5, the side of I=I (MAX) -1, 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, the side of J=J (MIN)+2, ascription 5, the side of J=J (MAX) -2, 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 the side of 3, J=J (MIN)+1, ascription 2, the side of J=J (MIN)+2, ascription 1, the side of J=J (MAX) -2, ascription Property is 4, the side of J=J (MAX) -1, ascription 5;
For the block where node, for different adjacent types, there are the assignment modes on two sets of sides:
When joint block and adjacent block intersect when relative position is 1 and 2, then the side of I=I (MIN)+1, ascription 4, I=I (MIN)+2 side, ascription 5, the side of I=I (MAX) -2, ascription 1, the side of I=I (MAX) -1, ascription 2;When Joint block intersects with adjacent block when relative position is 3 and 4, then the side of J=J (MIN)+1, ascription 4, J=J (MIN)+2 Side, ascription 5, the side of J=J (MAX) -2, ascription 1, the side of J=J (MAX) -1, ascription 2;
Step 3-3. participates in the side of exchange:
When block type is 1 or 2, for starting point, LX=3,4,5 side participates in exchange, for end, LX=1, and 2, 3 side participates in exchange;When block type is 3 or 4, for starting point, LX=3,2,1 side participates in exchange, for end, LX=5,4,3 side participate in exchange;When block type is 5, for starting point, LX=4,5 side participates in exchange, for end End, LX=1,2 side participate in exchange;
The exchange of step 3-4. side information:
The information of exchange includes at least integral one-dimensional IJ, whole two dimension (I, J), (X, Y, Z) coordinate and elevation information;Two pieces altogether There are the side of a line LX=3, first piece of LX=1,2 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 informations are assigned to not a node block, not a node block LX=3,4,5 side informations It is assigned to joint block;Alternatively, joint block LX=4,5 side informations are assigned to not a node block, not a node block LX=1, and 2,3 side informations are assigned to save Point block;
Step 3-5. mesh point exchanges attribute configuration:
First by all the points ascription MFS=2 in each piece of grid, it is expressed as interior point;Then by boundary point, i.e., every in grid block J minimax/I minimax in one row/column, such as (Imin, J), (Imax, J), (I, Jmin), (I, Jmax), etc. point weight New ascription MFS=1, indicates exterior point, i.e. boundary point;Secondly, by each piece, LX=2,5 side, in addition to boundary point, again Ascription MFS=3 indicates the point of participation information exchange, i.e. exchange point.
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 CN107871048A (en) 2018-04-03
CN107871048B true 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)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109285219B (en) * 2018-07-25 2019-11-05 中国水利水电科学研究院 A kind of grid type hydrological model grid calculation order encoding method based on DEM
CN115222913B (en) * 2022-03-29 2024-03-15 广州汽车集团股份有限公司 Grid generation and structure simulation analysis method, device, equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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

Family Cites Families (1)

* 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

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
吴俊林 等.分区对接网格在跨流域气体运动论统一算法的应用研究.《空气动力学学报》.2015,第33卷(第5期),第625-629页.

Also Published As

Publication number Publication date
CN107871048A (en) 2018-04-03

Similar Documents

Publication Publication Date Title
CN103092572B (en) The parallel method of distributing numerical control under a kind of cluster environment
CN107944102B (en) The grid joining method of basin large scale Complex River
CN102346795B (en) Automatic quick wiring method for electric and electronic virtual experiments
CN106202265B (en) Large scale Complex River magnanimity fine regular grid in basin draws volume method
CN110717251B (en) Distributed hydrological model sub-basin partitioning method considering multiple elements
CN104200045B (en) The parallel calculating method of a kind of basin large scale water system sediments formula hydrodynamic model
CN108563867A (en) A method of WRF and CFD coupled simulation wind fields are realized based on OpenFOAM
CN110689283B (en) River system and canal system staggered water supply simulation method and device based on underground water model
Acharya et al. A parallel and memory efficient algorithm for constructing the contour tree
CN102496168B (en) Complicated river channel gridding method used for simulation of river channel hydrological numerical value
CN111768502A (en) Non-structural grid two-dimensional flood simulation system based on GPU acceleration technology
CN104635262B (en) A kind of positive reversed fault isopleth automatic generation method based on extended rectangular grid
CN102915227A (en) Parallel method for large-area drainage basin extraction
CN104978451A (en) Complex plain river network area hydrological model processing method based on ArcGIS
CN107871048B (en) Large Scale Basin grid method of partition
CN107239657A (en) A kind of hydrodynamics modeling factors management method of object-oriented
CN101158985A (en) Ultra-dimension fluvial dynamics self-adapting parallel monitoring method
CN108614915B (en) Hydrological model free construction strategy method based on scene driving
CN104268243B (en) A kind of position data processing method and processing device
CN109101732A (en) Based on features of terrain boundary line without distributary road two dimensional structured grids subdivision method
CN106777302A (en) The conversion method and device of space and geographical coordinate
Arge et al. I/O-efficient computation of water flow across a terrain
CN108090164B (en) A kind of basin large scale calculates the coding method of magnanimity grid
CN110766792B (en) Grid calculation order coding method based on ArcGIS hydrological analysis tool
CN112801838B (en) Urban wetland ecological unit division method and device and storage medium thereof

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