CN109740289A - A kind of road network choosing method of integrated line, surface model - Google Patents

A kind of road network choosing method of integrated line, surface model Download PDF

Info

Publication number
CN109740289A
CN109740289A CN201910079989.2A CN201910079989A CN109740289A CN 109740289 A CN109740289 A CN 109740289A CN 201910079989 A CN201910079989 A CN 201910079989A CN 109740289 A CN109740289 A CN 109740289A
Authority
CN
China
Prior art keywords
section
stroke
node
slope
road
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201910079989.2A
Other languages
Chinese (zh)
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.)
Capital Normal University
Original Assignee
Capital Normal University
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 Capital Normal University filed Critical Capital Normal University
Priority to CN201910079989.2A priority Critical patent/CN109740289A/en
Publication of CN109740289A publication Critical patent/CN109740289A/en
Pending legal-status Critical Current

Links

Abstract

The road network choosing method of a kind of integrated line, surface model, comprising steps of carrying out topology preprocessing to original road net data;Stroke is generated, and is evaluated its different degree, calculates four degree;It weights vomoni figure to generate, determines roading density threshold value;It determines and chooses length;It is ranked up according to Stroke different degree size;Choose the maximum Stroke of different degree;Judge whether roading density is less than threshold value, if it is not, into queue Q, if so, carrying out road selection;Judge whether Stroke set is empty: if so, judging whether Stroke total length is less than LS, if it is not, carrying out path connected processing;If Stroke total length is less than LS, Stroke is selected according to different degree size from queue Q, selection length is determined until meeting, later, carries out path connected processing;Result is evaluated after selection.

Description

A kind of road network choosing method of integrated line, surface model
Technical field
The present invention relates to the road network choosings of the cartographic generaliztion technical field of road network more particularly to a kind of integrated line, surface model Take method.
Background technique
Road network is one of the geographic element that cartographic generalization is paid close attention to.Choose to road network section is that road network is comprehensive One of most important step in conjunction, and influence the prerequisite of road network resultant effect.
It is the comprehensive premise of road network that road network, which is chosen, and how to promote the accuracy rate of road network selection is the key technology studied at present One of.
According to the expression pattern of road network, the comprehensive method chosen of road network can be divided into the method based on ray mode and be based on face The method of mode.Road is regarded as " street " by the former, and directly selection linear road element, the latter are right using road as " block " Road surrounds the area pattern to be formed and merges, and chooses indirectly to road network.Though the method based on line expression is easy to and schemes Combined by relevant information, but be difficult the global statistical information of integration, this result that will will cause different regions selection occur compared with Big deviation.And though the method based on face expression can preferably integrate the global statistics information of road network, it chooses road network When, be easy to cause selection after road network be not connected to, and choose result accuracy dependent on road attribute information integrity degree and The reasonability of road network division methods.
From the point of view of specific method, the road choosing method based on ray mode can be divided into Graph-theoretical Approach and Stroke method. Stroke method is better than Graph-theoretical Approach on keeping road geometric continuity and longitudinal level characteristic.
Current improved Stroke generation method is as follows:
Stroke is defined as, one extends not naturally according to the good continuity principle in perceptual grouping principle The road cut off.It mainly include that the generation of Stroke and Stroke are arranged based on the method that Stroke method carries out road network selection Sequence.The generation of Stroke is that the premise of road network selection is carried out based on Stroke method.But it is existing to randomly select section and only examine The generating algorithm for considering local deflection angle, reduces the precision of road selection to a certain extent, and then hinders based on Stroke The application of road choosing method.
It is as follows to take whole Stroke concatenate rule into account:
The generation calculation method of Stroke includes Stroke concatenate rule and connection strategy.Concatenate rule is connection strategy Premise, concatenate rule judges that can section connect, and how connection strategy regulation section connects.Stroke concatenate rule can be divided into Geometrical rule, special topic rule and mixing rule.Due in real work, being difficult to collect complete category of roads, road name Deng thematic attribute, therefore most of researchs are all constrained using geometrical rule Stroke is generated.Geometrical rule mainly considers " good continuity " principle that Gestalt is proposed.The principle mainly from the vision level of people, is specifically difficult to quantify.It is existing Some geometry concatenate rules mainly consider the deflection angle in junction section, and section of the deflection angle in threshold range can be connected It connects.The deflection angle in section refers to that the angle in initial section is deviateed in section to be connected, in the range of 0 ° to 180 °.Such as Fig. 1, section Si And Si+1The deviation angle be α.But deflection angle can only express the local message in connection section, not take into account whole between connection section Incidence relation.In fact, not only to consider the deflection angle closed in section when carrying out section connection, also to take into account subsequent company Connect the relationship in section Yu initial section, i.e., subsequent connection section constrained on the whole so that subsequent connection section and just Beginning section " deviation " on the whole is as minimum as possible.
But the method based on Stroke has the following problems:
(1) when Stroke is generated, concatenate rule is that the deflection angle in two sections to be connected needs to be less than threshold value.But deflection angle It only has been considered locally concatenate rule from section, has failed to take the concatenate rule of section on the whole into account, that is, has lacked and constrains subsequent connection The rule in section and initial section relationship.This Stroke for being unable to satisfy generation to a certain extent will have whole successional It is required that.
(2) for different Stroke generation strategies, the Stroke of global optimum cannot be generated simultaneously and determines knot The Stroke of fruit, although often falling into local optimum such as each pair of maximum Stroke for being suitble to strategy generation determining;Itself is most Though big matching strategy can generate preferable Stroke in the overall situation, its selection dependent on initial section every time, and generate Stroke it is often uncertain, need by repeatedly could generate more be satisfied with result.
And road network is comprehensive and analysis is to generate result based on determining Stroke to carry out, uncertain Stroke is raw It will affect final Model choices precision at result, to hinder application of the Stroke method in comprehensive road is chosen.
And the road based on surface model chooses the method for mainly using density of road network: the calculation method of roading density can divide For grid, divide shape, network meshes etc., but these methods have some limitations, as grid method be easy to cause section It divides, fractal method initial mesh size is difficult to judge, network meshes method depends on topological structure face etc..For this purpose, there is text at present It offers and proposes a kind of method that calculating roading density in region is divided based on Voronoi diagram, this method overcomes previous roading density meter The deficiency of calculation can preferably keep road mileage information on the whole.But when this method progress road network zoning, do not consider The weight on road, this may result in when carrying out road network selection, and important road can be deleted.
Existing document is mostly individually to be studied using ray mode or surface model, and do not consider to express two kinds Mode, which combines, carries out road network selection.
How to solve current road network choose in ray mode and surface model existing selection result precision is not when being used alone High and structure chooses unreasonable problem, and propose it is a kind of take line into account, the method that surface model selects road network, be current research Direction.
Summary of the invention
Existing selection result essence when being used alone for ray mode in solution in the prior art road network selection and surface model It spends not high and structure and chooses unreasonable problem, the present invention provides a kind of integrated lines, the road network choosing method of surface model.
A kind of road network choosing method of integrated line, surface model, including following steps:
Step 1) obtains original road net data, carries out topology preprocessing, and original road net data includes section, node, carries out Topological link relation is established between node and section after topology preprocessing;
Later, using OLS model, the slope for treating connection section is calculated, and combines the angle of junction, design Take whole Stroke concatenate rule into account;Stroke is considered as the path being made of several continuous sections;It is obtained by OLS model Path slope, the slope substantially simulated by the node on path, the value of the slope can characterize subsequent Connect the relationship in section and initial section;
The process constrained on the whole Stroke concatenate rule using slope is as follows:
The node N of n dispersioniPath R is constituted with n-1 sectioni, i=1,2 ..., n, section Si-1It indicates, the n- 1 section is that the nodal spacing dispersed by n above-mentioned is formed separately, and the coordinate of i-th of node is (xi, yi), then path Ri's The formula of slope m is as follows:
In formula (1),For n node NiAbscissa mean value,For n node NiOrdinate mean value;
2) and step 3) later, while entering step;
It includes concatenate rule and connection strategy that step 2), Stroke, which are generated,;Carry out Stroke generation treatment process include:
21) concatenate rule in section is as follows when, setting Stroke is generated:
One), from local angle rule considers that steering angle of the section to be connected in junction is less than deflection angle threshold θ, partially Corner threshold θ is generally less than 60 °;
Two), from whole angle rule considers, introduce the slope that OLS model calculates path, such as above-mentioned formula (1), selection With the initial the smallest section of section slope difference as subsequent connection section, so that the Stroke formed after connection is whole There is preferable continuity, circular is as follows on body:
If judging section S0Respectively there is a node FN at both ends0And TN0, calculation method is as follows: from node FN0It is attached, is tying Point FN0It is n that place, which meets the section number of rule one),;It is m by the slope that OLS model calculates initial section0, the optional section of n item connects It is m that path slope is formed by after connecingi(i=1,2 ..., n), enables Δ m=min | mi-m0|, then the corresponding section S of Δ mi-1Then For with S0The section of connection;When being connected next time, using newly-generated path slope as starting angular rate, even m0 =mi;One) two) continue to be attached section with rule according to rule with a node in the section newly connected, until looking for not To the section node of rule one) is met, a new Stroke is generated, which is marked;With same method pair Node TN0It is handled, then node TN can be generated0In another new Stroke of other direction, which is also carried out Label;
If judging a node SN0Three section S are connected simultaneously0、S1And S2, three section S0、S1And S2The node of the other end Respectively SN1、SN2、SN3, calculation method is as follows: setting from section S0Start to carry out Stroke connection, calculates section S1、S2With section S0The deviation angle, path (SN is calculated using OLS model1, SN0), path (SN1, SN0, SN2) and path (SN1, SN0, SN3) Slope m0、m1And m2
The slope m0Refer to node SN1With node SN0Between path (SN1, SN0) slope, at this point, node SN1With node SN0Between be straightway connection, therefore herein, slope m0It is both the slope of connected straight line, and practical road The slope of diameter;
Path (SN1, SN0, SN2) it is by two linear section (SN1, SN0) and (SN0, SN2) broken line that is formed by connecting, Its slope m1It is acquired by above-mentioned formula (1);Path (SN1, SN0, SN3) it is by two linear section (SN1, SN0) and (SN0, SN3) The broken line being formed by connecting, slope m2It is acquired by above-mentioned formula (1);
In node SN0When carrying out Stroke connection, it may appear that following three kinds of situations:
1. calculating m if deflection angle is respectively less than or is equal to threshold θ1With m0Between difference, m2With m0Between difference, if |m1-m0| < | m2-m0|, then select section S1With S0It is attached and generates Stroke, and enable m1Value be initial tilt rate, to knot Point is SN3Section carry out Stroke connection;
2. if deflection angle is all larger than threshold θ, in node SN0Place terminates connection;
3. if the deflection angle in only one section be less than or equal to threshold value, the section directly with section S0Connected It connects;
22), the connection strategy based on significance of highway segment is set:
From geometry feature and topological relation, the section number of the length and its connection that select road is as calculating section The index of different degree;The length of road is bigger, and the quantity for connecting section is more, and the importance in section is bigger, significance of highway segment Calculation method it is as follows:
In formula (2), liFor the length of section i, lmaxFor section maximum length, diFor the section number of section i connection, dmax For the maximum section number of section i connection, a diWeight, b dmaxWeight;
It is new according to the determining starting section of the different degree in section and generation one on the basis of acquisition significance of highway segment sequence New starting section after Stroke, to generate determining Stroke as a result, treatment process is as follows:
221), all sections in road network of the traversal after topology preprocessing, n are section number;
222) different degree in section, is calculated;
223), section importance is ranked up;
224), select the maximum section of different degree as initial section;
225) the initial section being selected, is marked;
226), judge whether initial section connects;
227) the adjoining section in initial section, is obtained;
228) new Stroke, is established, k represents adjacent section number, the deflection angle in adjacent section is calculated, if deflection angle Less than or equal to deflection angle threshold θ, then Δ m=| msegment-mInitial segment|, msegmentRefer to and is currently participating in calculating The slope in section, each section in road network is required to calculate its slope, therefore need to traverse each in road network Section, mInitial segmentRefer to the slope in initial section, the maximum section of different degree obtained in rapid 224 of referred to riding instead of walk Slope, msegment、mInitial segmentIt is obtained by the aforementioned formula (1) for calculating slope m;Otherwise, if deflection angle is greater than Deflection angle threshold θ, return step 224);
229) connected section, is marked;
2210) road net data, is updated;
The calculation formula of Stroke different degree is as follows:
In formula (3), tiRepresent Stroke;Weight p1、p2、p3And p4It is sought by CRITIC method;
LmaxMaximum value, D for Stroke lengthmaxMaximum value, B for Stroke degreemaxFor the maximum of Stroke intermediary degree Value, CmaxFor the maximum value of the Stroke degree of approach;
Stroke evaluation index includes:
Stroke length L, for form each section Stroke the sum of length,Wherein, likFor The length in k-th of section in i-th of Stroke;
Stroke degree D, for form Stroke section number,Wherein, section vkIf Stroke tiComponent part, then r (ti, vkOtherwise)=1 is r (ti, vk)=0;
Stroke intermediary degree B, to measure the probability value that this Stroke is between other Stroke,Wherein, j ≠ k;J ≠ i, k ≠ i, NT are network node number, network here Refer to that original road network is formed by network;njkShortest path quantity between node j and node k;njkIt (i) is knot The shortest path quantity of node i is contained between point j and node k;
Stroke degree of approach C is reflected other for the minimum connection quantity of the Stroke to all other Stroke Stroke is gathered in the possibility of the Stroke,Wherein, d (ti, vk) indicate Stroke tiWith Stroke vkBetween the shortest distance;
Later, it enters step 4);
Roading density of the step 3) based on weighted Voronoi diagrams figure zoning:
Subregion is carried out to road network and subregion roading density is combined to carry out road selection can keep road network space structure, because This, needs on the basis of road network zoning, constrains according to roading density in zoning road selection, makes the road network after choosing Difference before distribution and selection of the structure on space structure is as minimum as possible;Therefore it needs to be added according to the different degree in section Power, the Voronoi diagram for generating weighting carry out zoning to road network: the different degree in section is sought using formula (2);It is choosing with Stroke Unit is taken, the roading density for defining Stroke is to form the ratio between total length and the subregion gross area in the section Stroke;
On the basis of road network zoning, Stroke roading density calculation formula is as follows:
In formula (4), DSiFor the density of Stroke road, AiFor based on the composition section Stroke under Voronoi diagram subregion The sum of area, LiFor Stroke link length;
Roading density threshold value is determined using based on minimum visual element in law of nature theory;
Later, it enters step 4);
Step 4) determines that road network should choose section total length L according to root models;It enters step later 5);
Step 5) is ranked up according to Stroke different degree size;It enters step later 6);
Step 6) chooses the maximum Stroke of different degree;It enters step later 7);
Does step 7) judge that roading density is less than threshold value? if it is not, entering step 8), if so, entering step 9);
Step 8) enters queue Q, and is lined up enters step 10) in sequence;
Step 9) carries out road selection;It enters step later 10);
Does step 10) judge that Stroke set is empty? if so, entering step 11), if it is not, return step 6);
Step 11) judges whether Stroke total length is less than LS, if so, entering step 12), if it is not, entering step 13);
If the Stroke total length for being less than roading density threshold value is greater than or equal to Ls, then less than roading density threshold value Stroke retains, that is, the section for forming the Stroke retains;If the Stroke length for being less than roading density threshold value is less than Ls, then small It is selected, enters step later 12) first in the Stroke of roading density threshold value;
Step 12) selects Stroke according to different degree size from queue Q, determines selection length until meeting;
Stroke is arranged by importance is descending in queue Q, whether the stroke in n-th of sorting position is chosen Take, judged according to the following conditions: the total length of n Stroke before calculating determines if the total length is less than according to root model Road network should choose section total length Ls, then the stroke in n-th of sorting position is selected, that is, forms the Stroke's Section is retained;If the total length is less than Ls, then the stroke in n-th of sorting position is rejected, i.e., composition should The section of Stroke is not selected;
Later, d13 is entered step);
Step 13) carries out path connected processing;If there is disconnected situation in the road network after choosing, using minimum Spanning tree (MST) method, the node for increasing minimal amount are attached the network after selection, choose shortest path and to hang Node is attached with newly-increased node, until having handled all suspension nodes to guarantee the connectivity of road network entirety;
Later, d14 is entered step);
Step 14), selection terminate;Later, it enters step 15);
Step 15) evaluates result.
The road network choosing method of a kind of integrated line, surface model of the invention is to solve existing Stroke and generate calculation Ray mode and surface model are combined and carry out road network selection by the deficiency of method and a solution proposed, are based on Stroke Generation method improves, while carrying out Network zoning by weighted Voronoi diagrams figure, is chosen using roading density threshold value to road It is constrained, to be chosen on local detail and holding overall structure to road network.
Detailed description of the invention
Fig. 1 is that section deflection angle calculates schematic diagram;
Fig. 2 is that section slope calculates schematic diagram;
Fig. 3 is Stroke concatenate rule calculation process in the road network choosing method of integrated line of the present invention, surface model Figure;
Fig. 4 is section concatenate rule schematic diagram;
Fig. 5 is improved Stroke algorithm flow chart;
Fig. 6 is the division result contrast schematic diagram of ordinary Voronoi diagram (left figure) and weighted Voronoi diagrams figure (right figure);
Fig. 7 be a kind of integrated line of the present invention, surface model road network choosing method overall flow figure;
Fig. 8 is the calculation method flow chart of weighted Voronoi diagrams figure.
Specific embodiment
The present invention provides a kind of integrated lines, the road network choosing method of surface model, include the following steps:
1), least square method (OLS, ordinary least square) is that one kind by scatterplot obtains the best-fit line Parameter estimation model, which makes the quadratic sum of scatterplot and fitting a straight line minimum on the whole.Therefore, the technical program benefit With OLS model, the slope for treating connection section is calculated, and combines the angle of junction, and design is taken into account whole Stroke concatenate rule.Stroke is considered as the path being made of several continuous sections.Incline in the path obtained by OLS model Slope, the slope substantially simulated by the node on path, it can characterize subsequent connection section and initial section Relationship.It introduces after OLS model, has taken into account the Global Information between section, the comparison of threshold value intrinsic deflection angle relative size becomes The comparison of the difference of slope, computational efficiency are not much different, thus can guarantee computational efficiency in advance under, promoted Stroke generate Precision.Therefore, it can use slope on the whole to constrain Stroke concatenate rule.
Stroke concatenate rule is constrained on the whole using slope:
As Fig. 2, Stroke are considered as the path being made of several continuous sections, path RiThe node N dispersed by ni(i =1,2 ..., n) and n-1 section, section Si-1Indicate, the n-1 section be by n above-mentioned dispersion node between Every being separately constructed, the coordinate of i-th of node is (xi, yi), then path RiSlope m formula it is as follows:
In formula (1),For n node NiAbscissa mean value,For n node NiOrdinate mean value;
Consider that the concatenate rule in section carries out when the technical program generates Stroke from the whole concatenate rule with part Design, specific rules are as follows:
(1) consider from local angle, steering angle of the section to be connected in junction is less than threshold θ, deflection angle such as Fig. 1 institute Show;By current document it is found that deflection angle threshold θ is generally less than 60 °;
(2) consider from whole angle, (formula (1) is derived by by OLS to the slope in introducing OLS model calculating path Calculating path slope formula.It is not the formula of OLS itself.By the slope in the path that OLS model obtains, substantially The slope simulated by the node on path;
K in the general linear equation y=kx+b of OLS expression is slope, and m here is equivalent to this k. slope m Calculating using OLS fitting method calculate.Independent variable in OLS is each section node x coordinate, and dependent variable is equivalent to node Y-coordinate obtains slope m) using formula (1) estimation, selects with the initial the smallest section of section slope difference as subsequent Section is connected, so that the Stroke formed after connection has preferable continuity on the whole.Specific algorithm process is shown in figure 3: assuming that FN0And TN0For section S0Two nodes, from node FN0It is attached, in node FN0Place meets the section of regular (1) Number is n;It is m by the slope that OLS model calculates initial section0, being formed by path slope after the optional section connection of n item is mi(i=1,2 ..., n), enables Δ m=min | mi-m0|, then the corresponding section S of Δ miThen it is and S0The section of connection;Carry out under When primary connection, using newly-generated path slope as starting angular rate, even m0=mi;With one of the section newly connected Node continues to be attached section according to concatenate rule (1) and (2), until can not find the section node for meeting regular (1);With Same method is to node TN0It is handled, then another new Stroke can be generated.
Such as Fig. 4, S0、S1And S2It is node SN0Three sections of connection.Assuming that from section S0Start to carry out Stroke connection, Calculate S1、S2With S0The deviation angle, node (SN is calculated using OLS model1, SN0)、(SN1, SN0, SN2) and (SN1, SN0, SN3) slope m0、m1And m2.In node SN0When being attached, it may appear that following three kinds of situations: if 1. deflection angle be respectively less than or Person is equal to threshold θ, calculates m1With m0Between difference, m2With m0Between difference, might as well set | m1-m0| < | m2-m0|, then it selects Section S1With S0It is attached and generates Stroke, and enable m1Value be initial tilt rate, to node be SN3Section carry out Stroke connection.2. if steering angle is all larger than threshold θ, in node SN0Place terminates connection.3. if the deflection in only one section Angle be less than or equal to threshold value, then the section directly with section S0It is attached.
Connection strategy based on significance of highway segment
Previous Stroke connection strategy, the selection in new starting section after being generated to initial section and a Stroke It is random, therefore to same road network, the Stroke result of generation is often uncertain, thus it is raw repeatedly to carry out Stroke At, select preferable Stroke as a result, this will reduce road network selection efficiency.The plan that existing literature passes through setting significance of highway segment Slightly carry out Stroke generation, although this method can generate determining Stroke as a result, its concern be still section part The connection of the deflection angle in single section, and its index for calculating use to significance of highway segment is excessively complicated, and it is raw to reduce Stroke At efficiency.Since the technical program has designed part and whole concatenate rule, significance of highway segment is only used to arrange section Sequence, thus can the different degree parameter to section simplify, improve Stroke generate efficiency.In practice, road etc. The thematic attribute such as grade is difficult to obtain, therefore the technical program considers from geometry feature and topological relation, selects the length of road And its section number of connection is as the index for calculating significance of highway segment.The length of road is bigger, and the number for connecting section is more, section Importance it is bigger, the calculation method of significance of highway segment is as follows:
In formula (2), liFor the length of section i, lmaxFor section maximum length, diFor the section number of section i connection, dmaxFor The maximum section number of connection, a, b are respectively its weight.
It is new according to the determining starting section of the different degree in section and generation one on the basis of acquisition significance of highway segment sequence New starting section after Stroke determines that Stroke result, process are as follows to achieve the purpose that generate:
221), all sections in road network of the traversal after topology preprocessing, n are section number;
222) different degree in section, is calculated;
223), section importance is ranked up;
224), select the maximum section of different degree as initial section;
225) the initial section being selected, is marked;
226), judge whether initial section connects;
227) the adjoining section in initial section, is obtained;
228) new Stroke, is established, k represents adjacent section number, the deflection angle in adjacent section is calculated, if deflection angle Less than or equal to deflection angle threshold θ, then Δ m=| msegment-mInitial segment|, msegmentRefer to and is currently participating in calculating The slope in section, each section in road network is required to calculate its slope, therefore need to traverse each in road network Section, mInitial segmentRefer to the slope in initial section, the maximum section of different degree obtained in rapid 224 of referred to riding instead of walk Slope, msegment、mInitial segmentIt is obtained by the aforementioned formula (1) for calculating slope m;Otherwise, if deflection angle is greater than Deflection angle threshold θ, return step 224);
229) connected section, is marked;
2210) road net data, is updated;
Stroke importance sorting in road network selection:
Stroke sequence refers to after Stroke generation, evaluates Stroke importance.Since road network selection is What the importance according to Stroke carried out, therefore Stoke sequence is that the committed step of Model choices is carried out based on Stroke method. The method for determining Stroke importance includes regular method, parameter method of formation and method of weighting etc..Wherein, the method for weighting, i.e., to each evaluation Index Weights are a kind of more intuitive and most widely used methods.The evaluation index of building comprehensive and reasonable is that progress Stroke is important Property evaluation key.From the global and local angle combined, by integrating Stroke evaluation index in previous literature, this technology General indices Stroke intermediary degree and the Stroke degree of approach and local indexes Stroke long of the scheme selection based on the antithetic graph representation Degree and evaluation index of the Stroke degree as Stroke.The concrete meaning and calculation method of evaluation index are seen below.This technology side Case carries out tax power to four indexs using CRITIC method, and this method not only considers the property of index itself, it is also contemplated that Influencing each other between index.
The calculation formula of Stroke importance is as follows:
In formula (3), tiRepresent weight p1、p2、p3And p4It can be sought by CRITIC method;Lmax、Dmax、BmaxAnd CmaxRespectively The maximum value of Stroke length, Stroke degree, Stroke intermediary degree and the Stroke degree of approach;
CRITIC method is a kind of Objective Weighting, not only allows for the internal diversity of evaluation index itself, simultaneously Account for the correlation between index.This method basic thought is based on to the conflicting between specific strength and evaluation index To determine the weight of each index.
It is standardized that (each evaluation index is shown in original to calculating each evaluation index used in Stroke different degree first Literary 2 first row of table, i.e. Stroke length (L), Stroke degree (D), Stroke intermediary degree (B), the Stroke degree of approach (C), power P1~P4 is respectively corresponded again), formula is as follows:
In formula, xiFor the raw value of the evaluation index of a certain stroke, xmax, xminRespectively index x raw value In maximum value and minimum value, xi *For the new numerical value after standardization.
Secondly, calculating the information content that each evaluation index includes:
Wherein, CjFor the information content that index j includes, σjFor the standard deviation of index j, m is the number of Stroke evaluation index, rjkIt is the linearly dependent coefficient of index j and k.
Finally, the information content for including according to index, calculates the weight (w herein of each Stroke evaluation indexjIt is corresponding each Weight p1~p4):
Stroke evaluation index includes:
Stroke length L, for form each section Stroke the sum of length,Wherein, likIt is i-th The length in k-th of section in Stroke;
Stroke degree D, for form Stroke section number,Wherein, section vkIf tiGroup At part, then r (ti, vkOtherwise)=1 is r (ti, vk)=0;
Stroke intermediary degree B, to measure the probability value that this Stroke is between other Stroke,Wherein, j ≠ k;J ≠, k ≠ i, N are network node number, njkBetween node j and node k Shortest path quantity;njkIt (i) is that the shortest path quantity of node i is contained between node j and node k;
Stroke degree of approach C is reflected other for the minimum connection quantity of the Stroke to all other Stroke Stroke is gathered in the possibility of the Stroke,Wherein, d (ti, vk) indicate StroketiAnd Strokevk Between the shortest distance;
Roading density based on weighted Voronoi diagrams figure zoning:
Although the method based on Stroke can comprehensively consider the information of the geometry of road, topology etc., often The constraint for ignoring the road network overall situation causes road to choose result and becomes larger in the density variation of different regions, path space distribution It is unreasonable.Subregion is carried out to road network and subregion roading density is combined to carry out road selection being to maintain the basic of road network space structure Method.Therefore, it is necessary to constrain according to roading density in zoning road selection, make to choose on the basis of road network zoning Difference before distribution and selection of the road network structure afterwards on space structure is as minimum as possible.Some scholars introduce Voronoi diagram To Network zoning and the calculating of the roading density in zoning is carried out, this method can overcome the shortcomings of to calculate roading density, energy in the past Enough space structures for keeping road network on the whole.But when common Voronoi diagram carries out road network zoning, do not consider road on road Importance in net, under the constraint of density threshold, this may result in important road and is deleted.Fig. 6 is simulated roadway Subregion schematic diagram, lines represent section, and field color is deeper, show that subregion roading density is bigger.Fig. 6-a is common Voronoi division result, Fig. 6-b are the weighted Voronoi diagrams figure division result for using significance of highway segment to generate as weight.By right Than it is found that section R in ordinary Voronoi diagram1The subregion roading density at place is maximum, and road is carried out under the constraint of density threshold When selection, it is possible to be deleted.And in weighted Voronoi diagrams figure subregion, due to section R1Different degree is big, therefore, shared by point Area's area is larger, and corresponding roading density is smaller, carries out being easy to be retained when road selection.
Therefore it needs to be weighted according to the different degree in section, the Voronoi diagram for generating weighting carries out zoning to road network.
Weighted Voronoi diagrams figure considers the different degree of road, and biggish space is occupied in the big section of different degree, in density threshold Under value control, it is easy to be selected.
The different degree in section is sought using formula (2).
The calculation method of weighted Voronoi diagrams figure is as described below:
Assume initially that a generation member is only existed on the hard copy to subdivision (to be generated member and include point member, line element and a face Member), then the Voronoi diagram of generation member is hard copy;Secondly second pel is inserted into base map, with first pel " contention " base map, the line of demarcation of the two are the Voronoi diagram of two generations member to the subdivision of hard copy;Then pass through third Member is generated respectively with the one or two generation member " contention " respective Voronoi polygon, is then combined with from the one or two pel Two polygons obtained on Voronoi polygon are the Voronoi polygon that third generates member;The rest may be inferred to generation All Voronoi polygons for generating member.Its process is shown in Fig. 8, calculates and completes after all pels are all inserted into.
Due to generating weighted Voronoi diagrams figure by primitive of section, what is obtained is the Division area in each section, and this technology Scheme be using Stroke as selection unit, therefore define Stroke density be form the section Stroke total length and the total face of subregion The ratio between product.On the basis of road network zoning, Stroke roading density calculates as follows:
In formula (4), DSiFor the density of Stroke road, AiFor based on the composition section Stroke under Voronoi diagram subregion The sum of area, LiFor Stroke link length.
Roading density threshold value is determined using based on minimum visual element in law of nature theory herein;Density threshold is control Road network after selection spatially has space structure similar with original road network.The calculation formula of maximal density threshold value is as follows:
In formula, St,SsRespectively target data scale bar and source data scale bar (target data scale bar in experiment herein It is respectively 1:50000 and 1:10000 with source data scale bar).LmFor distinguishable distance minimum on target map, choose herein Lm=0.4mm.
The determination of density of road network threshold value is the key that carry out road selection according to subregion roading density.It is true by existing design The threshold value for determining subregion roading density has following methods: the method determined based on law of nature, method and base based on drawing norm In the method for master drawing statistics.Method based on drawing norm needs to obtain the drawing norm of different scale in advance, but existing Drawing norm is also difficult to determine just for principal scale for the related drawing norm of non-principal scale.It is united based on master drawing The method of meter needs to obtain the road net data of corresponding scale bar in advance, and needs to consider category of roads.Due in practical study, very The data of the difficult attribute and different scale for all obtaining road network.Method based on law of nature can not need to obtain in advance Related scale number evidence, and be easier to calculate.Therefore the technical program is utilized based on visual element minimum in law of nature theory Determine roading density threshold value.
It is chosen based on the road network of Stroke and Voronoi diagram:
The selection of road network includes that road network quantity is chosen and road network structure selection.Root model provides one for road network selection A objective quantity foundation, can eliminate artificial subjective factor satisfy the need netting index amount selection uncertainty.Previous road network structure It chooses and is mainly selected according to the height of section " qualification ", but will cause the road network after choosing and spatially there is density and do not assist The problem of tune.Therefore, the technical program introduces Voronoi diagram and divides and assist Stroke importance pair according to roading density threshold value Road network structure is selected.
The whole selection process of road network based on Stroke and Voronoi is as shown in Figure 7.
Wherein main central characteristics are as follows:
(1) Stroke generation is carried out using improved Stroke calculation method, and is used according to four indexs of Stroke CRITIC assigns power method and calculates the importance of Stroke, then evaluates Stroke.
(2) it generates weighted Voronoi diagrams figure and the density of subregion road is calculated, the method according to law of nature determines Roading density threshold value when road network is chosen.
(3) determine that road network should choose section total length L according to root models
(4) according to the size of Stroke importance, under the constraint of dasymetric threshold value, using Stroke as selection unit, Road network is selected.If the Stroke total length for being less than density threshold is greater than or equal to Ls, then less than density threshold Stroke retains, that is, the section for forming the Stroke retains.If the Stroke length for being less than density threshold is less than Ls, then it is less than close The Stroke of degree threshold value is selected first, and remaining length is still chosen according to the different degree size of Stroke, until meeting Section needed for total length.
(5) if disconnected situation occurs in the road network after choosing, minimum spanning tree (MST) algorithm is used, is increased minimum The node of number is attached the network after selection.Choosing shortest path connects suspension node with newly-increased node It connects, until having handled all suspension nodes to guarantee the connectivity of road network entirety.
Using minimum spanning tree (MST) algorithm increase minimal amount node, and choose shortest path by hanging node with Newly-increased Node connectedness, to guarantee the connectivity of entire road network after choosing.
Minimum spanning tree is generated using classical Kruskal algorithm:
Initial minimum spanning tree number of edges is 0, and every iteration once just selects the minimum cost side for meeting condition, is added to In the line set of minimum spanning tree.Specific steps:
1, all sides in figure are sorted from small to large by cost;
2, n vertex in figure is regarded as the forest of independent n tree composition;
3, select side from small to large by weight, two vertex of selected side connection should belong to two different trees, then at For a line of minimum spanning tree, and this two trees are incorporated as a tree.This step 3 is repeated, whether judges all vertex All in a tree or there is n-1 side, if so, into next step 4;If it is not, repeating step 3);
4, minimum spanning tree is generated, is terminated.
Whole Stroke concatenate rule and the connection strategy based on significance of highway segment are taken in the technical program design into account, from even It connects rule and two aspect of generation strategy improves traditional Stroke generating algorithm.
It is the comprehensive premise of road network that road network, which is chosen, how to be promoted the accuracy rate of road network selection be research key technology it One.Existing selection result precision is not high when being used alone for ray mode in road network selection and surface model and structure is chosen not Reasonable problem, the technical program propose it is a kind of take line into account, the method that surface model selects road network, take into account the whole letter in section Breath, using the generating algorithm of Stroke in OLS model refinement ray mode method, meanwhile, by weighted Voronoi diagrams figure to road network Subregion is carried out, under the control of roading density threshold value, the importance according to Stroke road selects road network.Experimental result table Bright, improved Stroke algorithm precision with higher, the road network after selection is able to maintain the global feature of original road network, and road Web frame selection is also relatively reasonable, and compared to the method that ray mode or surface model is used alone, choosing result has preferably Precision.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any Those familiar with the art in the technical scope disclosed by the present invention, can easily think of the change or the replacement, and should all contain Lid is within protection scope of the present invention.Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (1)

1. the road network choosing method of a kind of integrated line, surface model, which comprises the steps of:
Step 1) obtains original road net data, carries out topology preprocessing, includes section, node in original road net data, opened up It flutters between pretreated node and section and establishes topological link relation;
Later, using OLS model, the slope for treating connection section is calculated, and combines the angle of junction, and design is taken into account Whole Stroke concatenate rule;Stroke is considered as the path being made of several continuous sections;The road obtained by OLS model The value of the slope of diameter, the slope substantially simulated by the node on path, the slope can characterize subsequent connection The relationship in section and initial section;
The process constrained on the whole Stroke concatenate rule using slope is as follows:
The node N of n dispersioniPath R is constituted with n-1 sectioni, i=1,2 ..., n, section Si-1It indicates, the n-1 Section is that the nodal spacing dispersed by n above-mentioned is formed separately, and the coordinate of i-th of node is (xi, yi), then path RiIncline The formula of slope m is as follows:
In formula (1),For n node NiAbscissa mean value,For n node NiOrdinate mean value;
2) and step 3) later, while entering step;
It includes concatenate rule and connection strategy that step 2), Stroke, which are generated,;Carry out Stroke generation treatment process include:
21) concatenate rule in section is as follows when, setting Stroke is generated:
One), from local angle rule considers that steering angle of the section to be connected in junction is less than deflection angle threshold θ, deflection angle Threshold θ is generally less than 60 °;
Two), from whole angle rule considers, introduce the slope that OLS model calculates path, such as above-mentioned formula (1), selection with just The beginning the smallest section of section slope difference is as subsequent connection section, so that the Stroke formed after connection is on the whole With preferable continuity, circular is as follows:
If judging section S0Respectively there is a node FN at both ends0And TN0, calculation method is as follows: from node FN0It is attached, in node FN0 It is n that place, which meets the section number of rule one),;It is m by the slope that OLS model calculates initial section0, after the optional section connection of n item Being formed by path slope is mi(i=1,2 ..., n), enables Δ m=min | mi-m0|, then the corresponding section S of Δ mi-1Then for S0The section of connection;When being connected next time, using newly-generated path slope as starting angular rate, even m0=mi; One) two) continue to be attached section with rule according to rule with a node in the section newly connected, until can not find satisfaction The section node of rule one), generates a new Stroke, which is marked;With same method to node TN0 It is handled, then node TN can be generated0In another new Stroke of other direction, which is also marked;
If judging a node SN0Three section S are connected simultaneously0、S1And S2, three section S0、S1And S2The node of the other end is respectively SN1、SN2、SN3, calculation method is as follows: setting from section S0Start to carry out Stroke connection, calculates section S1、S2With section S0It is inclined To angle, path (SN is calculated using OLS model1, SN0), path (SN1, SN0, SN2) and path (SN1, SN0, SN3) inclination Rate m0、m1And m2
The slope m0Refer to node SN1With node SN0Between path (SN1, SN0) slope, at this point, node SN1With Node SN0Between be straightway connection, therefore herein, slope m0It is both the slope of connected straight line and inclining for Actual path Slope;
Path (SN1, SN0, SN2) it is by two linear section (SN1, SN0) and (SN0, SN2) broken line that is formed by connecting, inclination Rate m1It is acquired by above-mentioned formula (1);Path (SN1, SN0, SN3) it is by two linear section (SN1, SN0) and (SN0, SN3) connection and At broken line, slope m2It is acquired by above-mentioned formula (1);
In node SN0When carrying out Stroke connection, it may appear that following three kinds of situations:
1. calculating m if deflection angle is respectively less than or is equal to threshold θ1With m0Between difference, m2With m0Between difference, if | m1- m0| < | m2-m0|, then select section S1With S0It is attached and generates Stroke, and enable m1Value be initial tilt rate, be to node SN3Section carry out Stroke connection;
2. if deflection angle is all larger than threshold θ, in node SN0Place terminates connection;
3. if the deflection angle in only one section be less than or equal to threshold value, the section directly with section S0It is attached;
22), the connection strategy based on significance of highway segment is set:
From geometry feature and topological relation, the section number of the length and its connection that select road is important as section is calculated The index of degree;The length of road is bigger, and the quantity for connecting section is more, and the importance in section is bigger, the meter of significance of highway segment Calculation method is as follows:
In formula (2), liFor the length of section i, lmaxFor section maximum length, diFor the section number of section i connection, dmaxFor road The maximum section number of section i connection, a diWeight, b dmaxWeight;
It is new according to the determining starting section of the different degree in section and generation one on the basis of acquisition significance of highway segment sequence New starting section after Stroke, to generate determining Stroke as a result, treatment process is as follows:
221), all sections in road network of the traversal after topology preprocessing, n are section number;
222) different degree in section, is calculated;
223), section importance is ranked up;
224), select the maximum section of different degree as initial section;
225) the initial section being selected, is marked;
226), judge whether initial section connects;
227) the adjoining section in initial section, is obtained;
228) new Stroke, is established, k represents adjacent section number, the deflection angle in adjacent section is calculated, if deflection angle is less than Or be equal to deflection angle threshold θ, then Δ m=| msegment-mInitialsegment|, msegmentRefer to the section for currently participating in calculating Slope, each section in road network is required to calculate its slope, therefore need to traverse each section in road network, mInitialsegmentRefer to the slope in initial section, the slope in the maximum section of different degree obtained in rapid 224 of referred to riding instead of walk, msegment、mInitialsegmentIt is obtained by the aforementioned formula (1) for calculating slope m;Otherwise, if deflection angle is greater than deflection angle threshold Value θ, return step 224);
229) connected section, is marked;
2210) road net data, is updated;
The calculation formula of Stroke different degree is as follows:
In formula (3), tiRepresent Stroke;Weight p1、p2、p3And p4It is sought by CRITIC method;
LmaxMaximum value, D for Stroke lengthmaxMaximum value, B for Stroke degreemaxFor the maximum value of Stroke intermediary degree, CmaxFor the maximum value of the Stroke degree of approach;
Stroke evaluation index includes:
Stroke length L, for form each section Stroke the sum of length,Wherein, likIt is i-th The length in k-th of section in a Stroke;
Stroke degree D, for form Stroke section number,Wherein, section vkIf Stroketi's Component part, then r (ti, vkOtherwise)=1 is r (ti, vk)=0;
Stroke intermediary degree B, to measure the probability value that this Stroke is between other Stroke,Wherein, j ≠ k;J ≠ i, k ≠ i, NT are network node number, network here Refer to that original road network is formed by network;njkShortest path quantity between node j and node k;njkIt (i) is knot The shortest path quantity of node i is contained between point j and node k;
It is poly- to reflect other Stroke for the minimum connection quantity of the Stroke to all other Stroke by Stroke degree of approach C The possibility of the Stroke is combined in,Wherein, d (ti, vk) indicate Stroke tiWith Stroke vkIt Between the shortest distance;
Later, it enters step 4);
Roading density of the step 3) based on weighted Voronoi diagrams figure zoning:
Subregion is carried out to road network and subregion roading density is combined to carry out road selection can keep road network space structure, therefore, needed Road selection is constrained according to roading density in zoning, makes the road network structure after choosing on the basis of road network zoning The difference before distribution and selection on space structure is as minimum as possible;Therefore it needs to be weighted according to the different degree in section, The Voronoi diagram for generating weighting carries out zoning to road network: the different degree in section is sought using formula (2);It is to choose with Stroke Unit, the roading density for defining Stroke are to form the ratio between total length and the subregion gross area in the section Stroke;
On the basis of road network zoning, Stroke roading density calculation formula is as follows:
In formula (4), DSiFor the density of Stroke road, AiFor based on the area for forming the section Stroke under Voronoi diagram subregion The sum of, LiFor Stroke link length;
Roading density threshold value is determined using based on minimum visual element in law of nature theory;
Later, it enters step 4);
Step 4) determines that road network should choose section total length L according to root models;It enters step later 5);
Step 5) is ranked up according to Stroke different degree size;It enters step later 6);
Step 6) chooses the maximum Stroke of different degree;It enters step later 7);
Does step 7) judge that roading density is less than threshold value? if it is not, entering step 8), if so, entering step 9);
Step 8) enters queue Q, and is lined up enters step 10) in sequence;
Step 9) carries out road selection;It enters step later 10);
Does step 10) judge that Stroke set is empty? if so, entering step 11), if it is not, return step 6);
Step 11) judges whether Stroke total length is less than LS, if so, entering step 12), if it is not, entering step 13);
If the Stroke total length for being less than roading density threshold value is greater than or equal to Ls, then protected less than the Stroke of roading density threshold value It stays, that is, the section for forming the Stroke retains;If the Stroke length for being less than roading density threshold value is less than Ls, then it is close to be less than road The Stroke of degree threshold value is selected first, is entered step later 12);
Step 12) selects Stroke according to different degree size from queue Q, determines selection length until meeting;
Stroke is arranged by importance is descending in queue Q, whether the stroke in n-th of sorting position is selected, Judged according to the following conditions: the total length of n Stroke before calculating, if the total length is less than the road determined according to root model Net should choose section total length Ls, then the stroke in n-th of sorting position is selected, that is, forms the section of the Stroke It is retained;If the total length is less than Ls, then the stroke in n-th of sorting position is rejected, that is, forms the Stroke Section be not selected;
Later, d13 is entered step);
Step 13) carries out path connected processing;If disconnected situation occurs in the road network after choosing, generated using minimum (MST) method of tree, the node for increasing minimal amount are attached the network after selection, choose shortest path and to hang node It is attached with newly-increased node, until having handled all suspension nodes to guarantee the connectivity of road network entirety;
Later, d14 is entered step);
Step 14), selection terminate;Later, it enters step 15);
Step 15) evaluates result.
CN201910079989.2A 2019-01-28 2019-01-28 A kind of road network choosing method of integrated line, surface model Pending CN109740289A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910079989.2A CN109740289A (en) 2019-01-28 2019-01-28 A kind of road network choosing method of integrated line, surface model

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910079989.2A CN109740289A (en) 2019-01-28 2019-01-28 A kind of road network choosing method of integrated line, surface model

Publications (1)

Publication Number Publication Date
CN109740289A true CN109740289A (en) 2019-05-10

Family

ID=66366252

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910079989.2A Pending CN109740289A (en) 2019-01-28 2019-01-28 A kind of road network choosing method of integrated line, surface model

Country Status (1)

Country Link
CN (1) CN109740289A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111710162A (en) * 2020-07-07 2020-09-25 深圳市数字城市工程研究中心 Urban road network traffic operation condition monitoring method and system
CN111833630A (en) * 2019-12-31 2020-10-27 北京嘀嘀无限科技发展有限公司 Method and device for determining data release position, storage medium and electronic equipment
CN111985065A (en) * 2019-05-22 2020-11-24 兰州交通大学 Road automatic selection technology based on gravitational field theory
CN112035592A (en) * 2020-09-07 2020-12-04 中国测绘科学研究院 Road network isolated mesh elimination method based on stroke tip characteristics
CN113014602A (en) * 2021-03-26 2021-06-22 湖南大学 Industrial network defense method and system based on optimal communication path
CN113837421A (en) * 2020-06-23 2021-12-24 济南市公安局交通警察支队 Method for calculating information board release range

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103363999A (en) * 2013-07-30 2013-10-23 武汉大学 Iteration method for generating road network stroke
CN108388540A (en) * 2018-03-01 2018-08-10 兰州交通大学 Road network Algorithms of Selecting based on fuzzy overall evaluation

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103363999A (en) * 2013-07-30 2013-10-23 武汉大学 Iteration method for generating road network stroke
CN108388540A (en) * 2018-03-01 2018-08-10 兰州交通大学 Road network Algorithms of Selecting based on fuzzy overall evaluation

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JIANCHEN ZHANG 等: "An Improved Hybrid Method for Enhanced Road Feature Selection in Map Generalization", 《ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION》》, pages 2 - 3 *
张建辰 等: "全局与局部寻优相结合的道路网匹配方法", 《武汉大学学报·信息科学版》, vol. 43, no. 8 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111985065A (en) * 2019-05-22 2020-11-24 兰州交通大学 Road automatic selection technology based on gravitational field theory
CN111833630A (en) * 2019-12-31 2020-10-27 北京嘀嘀无限科技发展有限公司 Method and device for determining data release position, storage medium and electronic equipment
CN113837421A (en) * 2020-06-23 2021-12-24 济南市公安局交通警察支队 Method for calculating information board release range
CN111710162A (en) * 2020-07-07 2020-09-25 深圳市数字城市工程研究中心 Urban road network traffic operation condition monitoring method and system
CN112035592A (en) * 2020-09-07 2020-12-04 中国测绘科学研究院 Road network isolated mesh elimination method based on stroke tip characteristics
CN113014602A (en) * 2021-03-26 2021-06-22 湖南大学 Industrial network defense method and system based on optimal communication path
CN113014602B (en) * 2021-03-26 2022-02-18 湖南大学 Industrial network defense method and system based on optimal communication path

Similar Documents

Publication Publication Date Title
CN109740289A (en) A kind of road network choosing method of integrated line, surface model
CN115471065A (en) Health evaluation index system of single-river inflow sea river and evaluation method thereof
KR101394976B1 (en) Generating methodology of multi-scale model for the attached cadastral map
CN108520345A (en) Evaluation for cultivated-land method and system based on GA-BP neural network models
CN106875060A (en) A kind of flood real-time correction method based on global algorithms of automatic optimization
CN110428126A (en) A kind of urban population spatialization processing method and system based on the open data of multi-source
CN110008602B (en) Road network selection method considering multi-feature coordination under large scale
CN106844979B (en) Interactive combined design system and method for urban virtual park
CN107315813A (en) A kind of tree-like river networks hierarchical relationship of stroke feature constraints is built and method for simplifying
CN107169878A (en) A kind of method based on information independence collection space load basic data of increasing income
CN113610301A (en) Prediction algorithm for representing ground settlement time sequence evolution
CN110111561A (en) A kind of road network method for dynamically partitioning based on SOM-PAM clustering algorithm
CN112037107A (en) Method for quantifying boundary overlapping features of natural protected area
CN115936422A (en) Ecological risk evaluation method and system based on scale optimization
CN112990661A (en) Small watershed ecological space health assessment system and method
Gartsman et al. Structural-hydrographic and morphometric analysis of river systems: Theoretical aspects
Hu et al. Analysis of landscape influencing factors of urban waterfront greenways based on the scenic beauty estimation method, taking Tongjian lake in Hangzhou as an example
CN116402951A (en) Digital twinning-based side slope safety management method and system
Vanderhaegen et al. Developing urban metrics to describe the morphology of urban areas at block level
Menduni et al. A non‐conventional watershed partitioning method for semi‐distributed hydrological modelling: the package ALADHYN
Zhang et al. A generative design method for the functional layout of town planning based on multi-agent system
CN114357558A (en) Traditional village space texture parameterization construction method
JP3860138B2 (en) Debris flow warning area generation device and program thereof
Chen et al. Application of the cloud model synthesis method in ecological evaluation of waterways
Min et al. Landscape Evaluation of Forest Park Based on Analytic Hierarchy Process

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