CN104200501A - Rail transit train flow diagram automatic preparation method - Google Patents
Rail transit train flow diagram automatic preparation method Download PDFInfo
- Publication number
- CN104200501A CN104200501A CN201410417641.7A CN201410417641A CN104200501A CN 104200501 A CN104200501 A CN 104200501A CN 201410417641 A CN201410417641 A CN 201410417641A CN 104200501 A CN104200501 A CN 104200501A
- Authority
- CN
- China
- Prior art keywords
- row
- summit
- stream
- abutment points
- line segments
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Traffic Control Systems (AREA)
Abstract
The invention discloses a rail transit train flow diagram automatic preparation method. Compared with the prior art, the method overcomes the shortcomings of traditional train flow diagram in long term. A theory and the method for train transit train flow diagram automatic preparation are provided systematically, a train flow line is compact and neat in arrangement, the drawing space is saved, and the computer technology is fully utilized. By means of the rail transit train flow diagram automatic preparation method, the train flow diagram automatic preparation is achieved.
Description
Technical field
The present invention relates to a kind of track traffic row flow graph and automatically work out theory and method.
Background technology
Row flow charting is rail vehicle transportation planning and the important process of organizing, row flow graph represents as the visual picture of marshaling plan of train and starting scheme, for the decision-makings such as track traffic enlarging technical equipment and configuration locomotive and rolling stock provide scientific basis, to station technical operation, workload, and route map of train etc. has material impact.Through Literature Consult, there is not yet the achievement in research in this field abroad, at present domestic only have some pieces of documents of railway train flow graph to look into, and the achievement in research in this field of track traffic is had no.Authorized strength work is at present mainly by designer's hand weaving, and designer's labour intensity is large, modification difficulty, lacks unified standard and not attractive in appearance.Particularly when road network is complicated, different track traffic modes are changed to, row fluxion amount is when many, the workload of hand weaving is very large.The domestic railway train flow charting software of looking into seldom, although indivedual software can Substitute For Partial hand-designed, but that all in all aspect robotization, does is thorough not, still there is more manual operations, authorized personnel is had to larger workload, particularly core---still there is more problem in the capable drawing of row levelling aspect, and lack unified standard.
Summary of the invention
Object of the present invention provides a kind of track traffic row flow graph automatic preparation method with regard to being in order to address the above problem.
The present invention is achieved through the following technical solutions above-mentioned purpose:
The present invention includes the capable drawing algorithm of row flow path road vertex search algorithm and row levelling.
Described row flow path road vertex search algorithm comprises that the described row flow path road vertex search algorithm without endless chain situation comprises the following steps without endless chain situation and have endless chain situation:
(1) establish all labels not of initial vertax set (except starting point), have D[i, 1]=0, D[s, 1]=1, D[i, 2]=s; S is added to B;
(2) take out successively summit in B, establishing current summit is j; According to D[i, 1] scan the not summit i of label, and check successively A[i, j], if A[i, j]=1, make D[i, 1]=1, D[i, 2]=j; Judgement t=i? if equate, represent also label of terminal t, turn (4); If etc., i is not added to NB;
(3) after B has scanned, the starting point set NB of next round is assigned to B, goes to step (2);
(4) by t → ... → D[i, 2] → ... summit is found in association between → s, by its anti-order rearrangement, obtains row flow path road vertex set TP;
Described have the row flow path road vertex search algorithm of endless chain situation to have following two kinds: one: the number order on road network summit is carried out to " manual intervention ", preferentially select the path of appointment; Its two: according to first generate row flow path road without endless chain, if indivedual pathway does not meet finger prosthesis provisioning request, more artificial adjustment;
The capable drawing algorithm of described row levelling comprises being listed as flows through by location determination and the capable drawing algorithm of row levelling on summit, described row are flowed through by the location determination on summit: according to track circuit " left driving " rule, the trend on continuous two summits on row flow path road, can be divided into 4 kinds of situations, be designated as F, F=1 represents from top to bottom, F=2 represents from bottom to up, F=3 represents from right to left, F=4 represents from left to right; Analyze row stream sending out AT STATION, to, by situation, with station rectangle frame, defined 12 kinds of positions; Wherein position 9～12 for following 4 kinds of row flow away to time need to consider: from position 2 to position 5, from position 8 to position 3, from position 6 to position 1, from position 4 to position 7.
The capable drawing algorithm of row levelling basic thought: during row stream drawing, if trend changes, row stream comprises many line segments; Row flow to outer translation, are exactly to the inspection of each line segment outwards translation in fact;
Before describing the capable drawing algorithm of row levelling, be defined as follows:
Definition " exterior point " represents that row stream is by way of summit when (being station) and the intersection point of rectangle frame; " interior point " represents that row flow away to the turning point changing;
Definition Three-Dimensional Dynamic array X[i, j, k], for recording the k of the Wai Yi unit place of the position j of summit i, there is row stream; Along the track circuit between each summit, row flow path road, outwards check successively, if this position column free stream have space to exist, drawing row stream; If the existing stream that is listed as in this position, outwards translation, until position column free flows, can be flowed by drawing row;
Definition PD represents row levelling row wiring distance, and OU represents Lie Liuwaiyi unit, and the centre coordinate of row flow graph summit i rectangle frame is designated as (Xi, Yi);
Outer point coordinate is calculated as follows:
Definition PF represents the F value of last line segment of row stream, checks the relationship of the two of F and PF, and whether judgement row flow away to changing, and when F ≠ PF, consider interior point,
Interior point coordinate is calculated as follows:
Row stream is comprised of some line segments (1 or many), is 1 line segment, is many line segments while having at interior during wherein without interior; The capable drawing of row levelling, key will be determined the coordinate of abutment points exactly.
Definition abutment points represents that row stream is from the end points of each line segment of origin-to-destination, and abutment points comprises exterior point or interior point.
Definition two dimension dynamically array Pn * 2 records the abutment points information of the sets of line segments of single trend, P[i, 0] record the numbering on the summit at abutment points place; P[i, 1] record the position on the summit at abutment points place.Definition two dimension is the upper all of its neighbor dot information of array Ln * 2 record row stream dynamically, and Ln * 2 can be regarded as and respectively move towards the comprehensive of Pn * 2.L[i, 0] record numbering, the L[i on the summit at abutment points place, 1] record position, the L[i on the summit at abutment points place, 2] record the horizontal ordinate of abutment points; L[i, 3] record the ordinate of abutment points;
The capable drawing algorithm steps of described row levelling is as follows:
(A) scan columns stream table, takes out when prostatitis stream record, and this row stream starting point is designated as s, row stream terminal is designated as t, adopts row flow path road vertex search algorithm, obtains pathway vertex set TP;
(B) scanning TP, calculates F by the coordinate on current summit and last summit, obtains thus the homeposition on last summit and the in-position on current summit; If last summit is s (being initial segment), turn (E); Otherwise, judgement F=PF? if so, row flow away to constant, turn (E); Otherwise row flow away to change, turn (C);
(C) scan columns flows away to all of its neighbor dot information Pn * 2 of sets of line segments before changing, and checks successively the X[i of abutment points, j, k], judged whether row stream? if have, OU=OU+1, returns to (C); If nothing, draws OU, turn (D);
(D), if this sets of line segments is not the initial trend of row stream, the starting point of this sets of line segments (point) information is added to Ln * 2; Add OU to the X[i of this sets of line segments abutment points, j, k], and other abutment points information except terminal adds Ln * 2 by this sets of line segments; Empty Pn * 2 and OU, turn (E);
(E) two abutment points information of the new trend of row stream are added to Pn * 2, the numbering on the summit at place adds P[i, 0], the position on the summit at two abutment points places adds P[i, 1]; Make PF=F; Check whether TP has scanned, and if not, turns (B); If so, turn (F);
(F) sets of line segments of finally moving towards of row stream is processed again, is scanned its all of its neighbor dot information Pn * 2, check successively the X[i of abutment points, j, k], judged whether row stream? if have, OU=OU+1, returns to (F); If nothing, draws OU; If this sets of line segments is not the initial trend of row stream, the starting point of this sets of line segments (point) information is added to Ln * 2; Add OU to the X[i of this sets of line segments abutment points, j, k], and this sets of line segments abutment points information is added to Ln * 2; Turn (G);
(G) according to Ln * 2 coordinate figure drawing, work as prostatitis stream.In row stream starting point and terminal, add row fluxion quantitative character, and draw arrow at terminal; Has row stream table scanned? if so, algorithm finishes; If nothing, moves 1 after current record, turn (A).
Beneficial effect of the present invention is:
The present invention is the automatic preparation method of a kind of track traffic row flow graph, compared with prior art, the present invention is directed to the long-term deficiency existing aspect traditional row flow charting, systematically propose track traffic row flow graph and automatically worked out theory and method, row streamline compact in design is clean and tidy, has saved paper space, makes full use of computer technology, utilize the automatic preparation method of track traffic row flow graph proposing, realize the automatic establishment of row flow graph.
Accompanying drawing explanation
Fig. 1 is row flow graph vertex style of the present invention;
Fig. 2 is certain transportation network summit and numbering without endless chain situation of the present invention;
Fig. 3 is the adjacency matrix A result of embodiment mono-of the present invention;
Fig. 4 is the row flow path road vertex search schematic diagram of embodiment mono-of the present invention;
Fig. 5 is the network summit numbering pattern card that has endless chain situation of embodiment bis-of the present invention;
Fig. 6 is 12 kinds of position situations on row flow path summit;
Fig. 7 is position 9～12,4 kinds of row stream situation pattern cards that are only applicable to;
Fig. 8 is that interior point, exterior point and the row of embodiment tri-of the present invention flow to outer translation figure;
Fig. 9 is illustrating by the definite abutment points of the capable drawing algorithm of row levelling of embodiment tetra-of the present invention.
Figure 10 is the automatic establishment achievement of certain Regional Rail Transit row flow graph of embodiment five of the present invention
Embodiment
Below in conjunction with accompanying drawing, the invention will be further described:
The present invention includes the capable drawing algorithm of row flow path road vertex search algorithm and row levelling, described row flow path road vertex search algorithm comprises that the described row flow path road vertex search algorithm without endless chain situation comprises the following steps without endless chain situation and have endless chain situation:
(1) establish all labels not of initial vertax set (except starting point), have D[i, 1]=0, D[s, 1]=1, D[i, 2]=s; S is added to B;
(2) take out successively summit in B, establishing current summit is j; According to D[i, 1] scan the not summit i of label, and check successively A[i, j], if A[i, j]=1, make D[i, 1]=1, D[i, 2]=j; Judgement t=i? if equate, represent also label of terminal t, turn (4); If etc., i is not added to NB;
(3) after B has scanned, the starting point set NB of next round is assigned to B, goes to step (2);
(4) by t → ... → D[i, 2] → ... summit is found in association between → s, by its anti-order rearrangement, obtains row flow path road vertex set TP;
Described have the row flow path road vertex search algorithm of endless chain situation to have following two kinds: one: the number order on road network summit is carried out to " manual intervention ", preferentially select the path of appointment; Its two: according to first generate row flow path road without endless chain, if indivedual pathway does not meet finger prosthesis provisioning request, more artificial adjustment;
The capable drawing algorithm of described row levelling comprises being listed as flows through by location determination and the capable drawing algorithm of row levelling on summit, described row are flowed through by the location determination on summit: according to track circuit " left driving " rule, the trend on continuous two summits on row flow path road, can be divided into 4 kinds of situations, be designated as F, F=1 represents from top to bottom, F=2 represents from bottom to up, F=3 represents from right to left, F=4 represents from left to right; Analyze row stream sending out AT STATION, to, by situation, with station rectangle frame, defined 12 kinds of positions; Wherein position 9～12 for following 4 kinds of row flow away to time need to consider: from position 2 to position 5, from position 8 to position 3, from position 6 to position 1, from position 4 to position 7.
The capable drawing algorithm of row levelling basic thought: during row stream drawing, if trend changes, row stream comprises many line segments; Row flow to outer translation, are exactly to the inspection of each line segment outwards translation in fact;
Before describing the capable drawing algorithm of row levelling, be defined as follows:
Definition " exterior point " represents that row stream is by way of summit when (being station) and the intersection point of rectangle frame; " interior point " represents that row flow away to the turning point changing;
Definition Three-Dimensional Dynamic array X[i, j, k], for recording the k of the Wai Yi unit place of the position j of summit i, there is row stream; Along the track circuit between each summit, row flow path road, outwards check successively, if this position column free stream have space to exist, drawing row stream; If the existing stream that is listed as in this position, outwards translation, until position column free flows, can be flowed by drawing row;
Row stream is comprised of some line segments (1 or many), is 1 line segment, is many line segments while having at interior during wherein without interior; Row stream drawing, key will be determined the coordinate of abutment points exactly;
Definition PD represents row levelling row wiring distance, and OU represents Lie Liuwaiyi unit, and the centre coordinate of row flow graph summit i rectangle frame is designated as (Xi, Yi);
Outer point coordinate is calculated as follows:
Definition PF represents the F value of last line segment of row stream, checks the relationship of the two of F and PF, and whether judgement row flow away to changing, and when F ≠ PF, consider interior point,
Interior point coordinate is calculated as follows:
Row stream is comprised of some line segments (1 or many), is 1 line segment, is many line segments while having at interior during wherein without interior: the capable drawing of row levelling, crucially to determine the coordinate of abutment points exactly.
Definition abutment points represents that row stream is from the end points of each line segment of origin-to-destination, and abutment points comprises exterior point or interior point.
Definition two dimension dynamically array Pn * 2 records the abutment points information of the sets of line segments of single trend, P[i, 0] record the numbering on the summit at abutment points place; P[i, 1] record the position on the summit at abutment points place.Definition two dimension is the upper all of its neighbor dot information of array Ln * 2 record row stream dynamically, and Ln * 2 can be regarded as and respectively move towards the comprehensive of Pn * 2.L[i, 0] record numbering, the L[i on the summit at abutment points place, 1] record position, the L[i on the summit at abutment points place, 2] record the horizontal ordinate of abutment points; L[i, 3] record the ordinate of abutment points;
The capable drawing algorithm steps of described row levelling is as follows:
(A) scan columns stream table, takes out when prostatitis stream record, and this row stream starting point is designated as s, row stream terminal is designated as t, adopts row flow path road vertex search algorithm, obtains pathway vertex set TP;
(B) scanning TP, calculates F by the coordinate on current summit and last summit, obtains thus the homeposition on last summit and the in-position on current summit; If last summit is s (being initial segment), turn (E); Otherwise, judgement F=PF? if so, row flow away to constant, turn (E); Otherwise row flow away to change, turn (C);
(C) scan columns flows away to all of its neighbor dot information Pn * 2 of sets of line segments before changing, and checks successively the X[i of abutment points, j, k], judged whether row stream? if have, OU=OU+1, returns to (C); If nothing, draws OU, turn (D);
(D), if this sets of line segments is not the initial trend of row stream, the starting point of this sets of line segments (point) information is added to Ln * 2; Add OU to the X[i of this sets of line segments abutment points, j, k], and other abutment points information except terminal adds Ln * 2 by this sets of line segments; Empty Pn * 2 and OU, turn (E);
(E) two abutment points information of the new trend of row stream are added to Pn * 2, the numbering on the summit at place adds P[i, 0], the position on the summit at two abutment points places adds P[i, 1]; Make PF=F; Check whether TP has scanned, and if not, turns (B); If so, turn (F);
(F) sets of line segments of finally moving towards of row stream is processed again, is scanned its all of its neighbor dot information Pn * 2, check successively the X[i of abutment points, j, k], judged whether row stream? if have, OU=OU+1, returns to (F); If nothing, draws OU; If this sets of line segments is not the initial trend of row stream, the starting point of this sets of line segments (point) information is added to Ln * 2; Add OU to the X[i of this sets of line segments abutment points, j, k], and this sets of line segments abutment points information is added to Ln * 2; Turn (G);
(G) according to Ln * 2 coordinate figure drawing, work as prostatitis stream.In row stream starting point and terminal, add row fluxion quantitative character, and draw arrow at terminal; Has row stream table scanned? if so, algorithm finishes; If nothing, moves 1 after current record, turn (A).
Embodiment mono-:
Without endless chain situation row flow path road vertex search.
As shown in Figure 2: the row flow graph for this without endless chain situation, carry out row flow path road vertex search.Definition adjacency matrix An * n, wherein represents when summit i and summit j have limit to be directly connected A[i, j]=1; When summit i and summit j do not have limit to be directly connected or during i=j, A[i, j]=0.Adjacency matrix An * n is symmetric matrix, during actual input, only need to input lower triangular unit, then with diagonal line, carries out symmetrical assignment, and gained adjacency matrix A as shown in Figure 3.In pathway search procedure, based on " two labeling method " thinking definition two-dimensional array Dn * 2.D[i, 1] whether record summit by label, if summit i label, D[i, 1]=1; Otherwise, D[i, 1]=0.D[i, 2] record row stream starting point s to the previous summit on i row flow path road, current summit.Row stream terminal is designated as t, and TP is certain row flow path road vertex set.Array B is the starting point set when previous round, the starting point set that NB is next round.According to the row flow path road vertex search algorithm without endless chain, the row flow path road vertex search flow process of the starting point of Fig. 2 (7) → terminal (11), as shown in Figure 4.
Embodiment bis-:
There is endless chain situation row flow path road vertex search.
As shown in Figure 5: for this, have the row flow graph of endless chain situation, carry out row flow path road vertex search.To summit, the row flow path road of (6) has 2 on summit (1), is respectively: { 1,2,3,5,6}, { 1,2,4,5,6}.Suppose to stipulate according to Transportation Organization, can only select the 1st row flow path road.Can, in application before the row flow path road vertex search algorithm without endless chain, to summit number sorting in figure, artificially arrange so.Because stipulate that this row flow path road will be by way of outward around point (3), thus arrange outer around a numbering be less than another pathway by way of Station XXX (4).
Embodiment tri-:
Interior point, exterior point and row flow to outer translation signal
As shown in Figure 8: if having three row streams via certain station, be designated as respectively row stream 1, row stream 2, row stream 3.By way of the situation of station rectangle frame, row stream 1:{ 2., 1. }, row stream 2:{ 4., 1. }, row stream 3:{ 2., 9.,
, 5. }." exterior point " is illustrated as " * ", and " interior point " is illustrated as " ◆ ".Drawing row stream 1 o'clock, at X[i, j, k] middle retrieval, in the position of this station rectangle frame, 2. locate, because of existing row stream 3, so be listed as stream 12 units of outside translation.Same, drawing row stream 2 o'clock, 1. locates in the position of this station rectangle frame, because of existing row stream 1, so row stream 22 units of outside translation.
Embodiment tetra-:
Press the definite abutment points signal of the capable drawing algorithm of row levelling
As shown in Figure 9: on the existing row stream of this case basis, if new drawing summit (3) to summit the row stream of (7), adopt the capable drawing algorithm of row levelling automatically to generate row stream.I, II in figure ..., X is for representing the abutment points of this row stream drawing time institute foundation.
Embodiment five:
The automatic establishment achievement of certain Regional Rail Transit row flow graph
The automatic preparation method of track traffic row flow graph proposing based on this patent, adopts advanced language programming software completion code to write.Start AutoCAD, import compilation script command, can automatic generator orbital traffic row flow graph.As shown in figure 10: the automatic establishment achievement of the passenger-cargo row flow graph of certain Regional Rail.
Claims (1)
1. the automatic preparation method of track traffic row flow graph, is characterized in that: comprise the capable drawing algorithm of row flow path road vertex search algorithm and row levelling;
Described row flow path road vertex search algorithm comprises that the described row flow path road vertex search algorithm without endless chain situation comprises the following steps without endless chain situation and have endless chain situation:
(1) establish all labels not of initial vertax set (except starting point), have D[i, 1]=0, D[s, 1]=1, D[i, 2]=s; S is added to B;
(2) take out successively summit in B, establishing current summit is j; According to D[i, 1] scan the not summit i of label, and check successively A[i, j], if A[i, j]=1, make D[i, 1]=1, D[i, 2]=j; Judgement t=i? if equate, represent also label of terminal t, turn (4); If etc., i is not added to NB;
(3) after B has scanned, the starting point set NB of next round is assigned to B, goes to step (2);
(4) by t → ... → D[i, 2] → ... summit is found in association between → s, by its anti-order rearrangement, obtains row flow path road vertex set TP;
Described have the row flow path road vertex search algorithm of endless chain situation to have following two kinds: one: the number order on road network summit is carried out to " manual intervention ", preferentially select the path of appointment; Its two: according to first generate row flow path road without endless chain, if indivedual pathway does not meet finger prosthesis provisioning request, more artificial adjustment;
The capable drawing algorithm of described row levelling comprises being listed as flows through by location determination and the capable drawing algorithm of row levelling on summit, described row are flowed through by the location determination on summit: according to track circuit " left driving " rule, the trend on continuous two summits on row flow path road, can be divided into 4 kinds of situations, be designated as F, F=1 represents from top to bottom, F=2 represents from bottom to up, F=3 represents from right to left, F=4 represents from left to right; Analyze row stream sending out AT STATION, to, by situation, with station rectangle frame, defined 12 kinds of positions; Wherein position 9～12 for following 4 kinds of row flow away to time need to consider: from position 2 to position 5, from position 8 to position 3, from position 6 to position 1, from position 4 to position 7;
The capable drawing algorithm of row levelling basic thought: during row stream drawing, if trend changes, row stream comprises many line segments; Row flow to outer translation, are exactly to the inspection of each line segment outwards translation in fact;
Before describing the capable drawing algorithm of row levelling, be defined as follows:
Definition " exterior point " represents that row stream is by way of summit when (being station) and the intersection point of rectangle frame; " interior point " represents that row flow away to the turning point changing;
Definition Three-Dimensional Dynamic array X[i, j, k], for recording the k of the Wai Yi unit place of the position j of summit i, there is row stream; Along the track circuit between each summit, row flow path road, outwards check successively, if this position column free stream have space to exist, drawing row stream; If the existing stream that is listed as in this position, outwards translation, until position column free flows, can be flowed by drawing row;
Definition PD represents row levelling row wiring distance, and OU represents Lie Liuwaiyi unit, and the centre coordinate of row flow graph summit i rectangle frame is designated as (Xi, Yi);
Outer point coordinate is calculated as follows:
Definition PF represents the F value of last line segment of row stream, checks the relationship of the two of F and PF, and whether judgement row flow away to changing, and when F ≠ PF, consider interior point,
Interior point coordinate is calculated as follows:
Row stream is comprised of some line segments (1 or many), is 1 line segment, is many line segments while having at interior during wherein without interior; The capable drawing of row levelling, key will be determined the coordinate of abutment points exactly;
Definition abutment points represents that row stream is from the end points of each line segment of origin-to-destination, and abutment points comprises exterior point or interior point;
Definition two dimension dynamically array Pn * 2 records the abutment points information of the sets of line segments of single trend, P[i, 0] record the numbering on the summit at abutment points place; P[i, 1] record the position on the summit at abutment points place; Definition two dimension is the upper all of its neighbor dot information of array Ln * 2 record row stream dynamically, and Ln * 2 can be regarded as and respectively move towards the comprehensive of Pn * 2; L[i, 0] record numbering, the L[i on the summit at abutment points place, 1] record position, the L[i on the summit at abutment points place, 2] record the horizontal ordinate of abutment points; L[i, 3] record the ordinate of abutment points;
The capable drawing algorithm steps of described row levelling is as follows:
(A) scan columns stream table, takes out when prostatitis stream record, and this row stream starting point is designated as s, row stream terminal is designated as t, adopts row flow path road vertex search algorithm, obtains pathway vertex set TP;
(B) scanning TP, calculates F by the coordinate on current summit and last summit, obtains thus the homeposition on last summit and the in-position on current summit; If last summit is s (being initial segment), turn (E); Otherwise, judgement F=PF? if so, row flow away to constant, turn (E); Otherwise row flow away to change, turn (C);
(C) scan columns flows away to all of its neighbor dot information Pn * 2 of sets of line segments before changing, and checks successively the X[i of abutment points, j, k], judged whether row stream? if have, OU=OU+1, returns to (C); If nothing, draws OU, turn (D);
(D), if this sets of line segments is not the initial trend of row stream, the starting point of this sets of line segments (point) information is added to Ln * 2; Add OU to the X[i of this sets of line segments abutment points, j, k], and other abutment points information except terminal adds Ln * 2 by this sets of line segments; Empty Pn * 2 and OU, turn (E);
(E) two abutment points information of the new trend of row stream are added to Pn * 2, the numbering on the summit at place adds P[i, 0], the position on the summit at two abutment points places adds P[i, 1]; Make PF=F; Check whether TP has scanned, and if not, turns (B); If so, turn (F);
(F) sets of line segments of finally moving towards of row stream is processed again, is scanned its all of its neighbor dot information Pn * 2, check successively the X[i of abutment points, j, k], judged whether row stream? if have, OU=OU+1, returns to (F); If nothing, draws OU; If this sets of line segments is not the initial trend of row stream, the starting point of this sets of line segments (point) information is added to Ln * 2; Add OU to the X[i of this sets of line segments abutment points, j, k], and this sets of line segments abutment points information is added to Ln * 2; Turn (G);
(G) according to Ln * 2 coordinate figure drawing, work as prostatitis stream; In row stream starting point and terminal, add row fluxion quantitative character, and draw arrow at terminal; Has row stream table scanned? if so, algorithm finishes; If nothing, moves 1 after current record, turn (A).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410417641.7A CN104200501A (en) | 2014-08-25 | 2014-08-25 | Rail transit train flow diagram automatic preparation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410417641.7A CN104200501A (en) | 2014-08-25 | 2014-08-25 | Rail transit train flow diagram automatic preparation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104200501A true CN104200501A (en) | 2014-12-10 |
Family
ID=52085787
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410417641.7A Pending CN104200501A (en) | 2014-08-25 | 2014-08-25 | Rail transit train flow diagram automatic preparation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104200501A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105608140A (en) * | 2015-12-20 | 2016-05-25 | 河南思维自动化设备股份有限公司 | Graphical automatic compilation method for LKJ basic data |
| CN107944195A (en) * | 2017-07-05 | 2018-04-20 | 大连民族大学 | A kind of complexity passage formula Mobile partition system track layout optimization method |
| CN112562036A (en) * | 2020-12-10 | 2021-03-26 | 卡斯柯信号(成都)有限公司 | Method for drawing configuration system turnout icon by linear polygon |
| CN115329417A (en) * | 2022-03-30 | 2022-11-11 | 西南交通大学 | Method and system for compiling pivot column flow graph |
-
2014
- 2014-08-25 CN CN201410417641.7A patent/CN104200501A/en active Pending
Non-Patent Citations (5)
| Title |
|---|
| 程学庆 等: "列流线偏移描绘自动化", 《西南交通大学学报》 * |
| 程学庆 等: "旅客列车列流图计算机辅助设计系统的开发与应用", 《铁道运输与经济》 * |
| 程学庆 等: "车流表数据库系统的设计与实现", 《铁路信息系统》 * |
| 程学庆 等: "铁路列流图自动生成算法", 《中国铁道科学》 * |
| 程学庆: "列流图自动生成与空车调配相关问题研究", 《中国博士学位论文全文数据库 工程科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105608140A (en) * | 2015-12-20 | 2016-05-25 | 河南思维自动化设备股份有限公司 | Graphical automatic compilation method for LKJ basic data |
| CN105608140B (en) * | 2015-12-20 | 2019-02-22 | 河南思维自动化设备股份有限公司 | The graphical automatic preparation method of LKJ basic data |
| CN107944195A (en) * | 2017-07-05 | 2018-04-20 | 大连民族大学 | A kind of complexity passage formula Mobile partition system track layout optimization method |
| CN107944195B (en) * | 2017-07-05 | 2021-07-09 | 大连民族大学 | Complex push type movable partition system track layout optimization method |
| CN112562036A (en) * | 2020-12-10 | 2021-03-26 | 卡斯柯信号(成都)有限公司 | Method for drawing configuration system turnout icon by linear polygon |
| CN115329417A (en) * | 2022-03-30 | 2022-11-11 | 西南交通大学 | Method and system for compiling pivot column flow graph |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107192393B (en) | A kind of maintenance system and method for road-map-data | |
| CN104794663A (en) | Automatic itinerary generation system and method | |
| CN104200501A (en) | Rail transit train flow diagram automatic preparation method | |
| CN105160708B (en) | A kind of engineering geology inside and outside trade integration information system | |
| CN103309988A (en) | Method for automatically generating rail traffic line database | |
| CN102169591B (en) | Line selecting method and drawing method of text note in drawing | |
| CN102419927B (en) | Map road annotating method of navigation terminal | |
| CN109993064B (en) | Method for extracting connection path between road network nodes in picture | |
| CN104392037B (en) | City scene parameterization modeling system | |
| CN111754610A (en) | Method for automatically drawing railway station signal plane layout | |
| CN105608140A (en) | Graphical automatic compilation method for LKJ basic data | |
| CN104036020A (en) | MapX-based GIS bus information visualization method | |
| CN104298705A (en) | Converting method of relational data and unstructured data | |
| CN109002582A (en) | A kind of one key drawing methods of rail traffic escalator construction drawing of data-driven | |
| CN113696942B (en) | Depth-first-based train route acquisition method and system | |
| CN109726475A (en) | A kind of method and device for outer packing modeling | |
| CN113696935A (en) | Signal equipment primitive data model establishing method and system | |
| CN103488844B (en) | A kind of Net Frame of Electric Network figure automatic wiring method based on plant stand geography information | |
| CN113158316A (en) | Electric single-hole tunnel parametric modeling method | |
| CN103065009A (en) | Intelligent design system and method of traffic sign lines | |
| CN109190255B (en) | Three-dimensional reconstruction method for urban three-dimensional property space | |
| CN105488271B (en) | A kind of oil gas module shaped steel automatic matching method | |
| CN101739497A (en) | Method for automatically computing figure labeling position | |
| CN111651799A (en) | Automatic generation system of train control engineering data table | |
| CN115688341A (en) | Distribution network thematic map layout method based on multi-branch tree collision detection and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20141210 |
|
| WD01 | Invention patent application deemed withdrawn after publication |