CN113486430A - Batch generation method for highway cross section lines - Google Patents

Batch generation method for highway cross section lines Download PDF

Info

Publication number
CN113486430A
CN113486430A CN202110785974.5A CN202110785974A CN113486430A CN 113486430 A CN113486430 A CN 113486430A CN 202110785974 A CN202110785974 A CN 202110785974A CN 113486430 A CN113486430 A CN 113486430A
Authority
CN
China
Prior art keywords
mileage
node
point
section
cross
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110785974.5A
Other languages
Chinese (zh)
Other versions
CN113486430B (en
Inventor
王莹
汪诗奇
闻平
杨勇喜
杨彦梅
汪松
吕孟
谢飞
李泽邦
莽燕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
PowerChina Kunming Engineering Corp Ltd
Original Assignee
PowerChina Kunming Engineering Corp Ltd
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 PowerChina Kunming Engineering Corp Ltd filed Critical PowerChina Kunming Engineering Corp Ltd
Priority to CN202110785974.5A priority Critical patent/CN113486430B/en
Publication of CN113486430A publication Critical patent/CN113486430A/en
Application granted granted Critical
Publication of CN113486430B publication Critical patent/CN113486430B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T90/00—Enabling technologies or technologies with a potential or indirect contribution to GHG emissions mitigation

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Geometry (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Optimization (AREA)
  • Computational Mathematics (AREA)
  • Architecture (AREA)
  • Mathematical Analysis (AREA)
  • Structural Engineering (AREA)
  • Pure & Applied Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • General Engineering & Computer Science (AREA)
  • Civil Engineering (AREA)
  • Image Generation (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to a highway cross section line batch generation method, belongs to the technical field of highway line design and measurement, and particularly relates to a highway cross section line batch generation method. The method of the invention comprises the steps of firstly collecting and analyzing highway design center line data to obtain a node sequence DsAnd then calculating the mileage value at each node to obtain a node mileage sequence Ls, analyzing a cross section mileage parameter file to obtain a mileage parameter set Lc, calculating coordinates of a middle point, a left end point and a right end point of a section line at each mileage position according to the mileage parameters and a design center line, and finally storing the result, thereby realizing the rapid batch generation of the highway section lines. The method has the characteristics of reasonable design, high automation degree, high efficiency, good accuracy, low cost and the like.

Description

Batch generation method for highway cross section lines
Technical Field
The invention belongs to the technical field of highway line design and measurement, and particularly relates to a highway cross section line batch generation method.
Background
In the design and measurement work of highway lines, the measurement of the cross section of a highway plays an important role in highway construction. The position of the cross section is usually determined according to the mileage value on the design center line of the highway, the extending ranges of the left end and the right end of the cross section have great relation with the environment of the position, and the extending ranges of the two ends are correspondingly changed along with the difference of the surrounding environment.
The conventional method for generating the cross section threads is mainly realized on the basis of CAD software, but the conventional software mostly realizes batch generation of the cross section threads according to a fixed mileage interval and a left-right end extension range. If the cross section lines of the special mileage positions or the special left and right end extension ranges need to be obtained, the input of various parameters needs to be carried out independently, and the cross section lines are generated one by one. These operations are often labor and time intensive and not conducive to rapid engineering advances. Therefore, a technical method capable of generating cross sectional lines of arbitrary parameters in a batch is needed.
Disclosure of Invention
The invention aims to solve the problem of defects in the conventional road cross section line generation, and provides a road cross section line batch generation method.
A highway cross section line batch generation method comprises the following steps:
step 1, collecting highway design center line data, and analyzing a center line node sequence; the method comprises the following specific steps:
(1) collecting DXF-format highway design center line data;
(2) reading a highway design center line data file by using a dxflib library, and analyzing coordinates (x, y) of each node of a center line and a convexity parameter (bull);
(3) determining the initial point and initial mileage l of the central line of the road design0The nodes are sequenced according to the starting and stopping sequence to form a node sequence Ds{Ds|pi(xi，yi，0，bulgei)∈Ds}。
Step 2, calculating the mileage value at each node to obtain a node mileage sequence Ls { Ls | LskBelongs to Ls }; the method comprises the following specific steps:
(1) setting the mileage value ls of the initial node0Is 10；
(2) Sequence of slave nodes DsTake out the k-th node pk(k is more than or equal to 2 and less than or equal to N), and N is the number of the node sequences;
(3) computing the node p on the centerlinek-1To pkS, the mileage value ls of the kth nodekIs equal to ls0Adding S;
(4) and (3) repeating the processes (2) and (3) until all the node mileage is calculated.
Step 3, setting a cross section mileage parameter file format;
step 4, analyzing the mileage parameter file of the cross section to obtain the mileage value, the left end offset and the right end offset of each mileage position to form a mileage parameter set Lc; the specific process is as follows:
(1) reading each line of the cross section mileage parameter file;
(2) resolving an in-line mileage value, a left end offset and a right end offset value according to the file format to obtain parameter data L of one mileagej(lcj，LeftRangej，RightRangej)；
(3) And reading and analyzing all the row data to obtain a mileage parameter set Lc.
Step 5, calculating coordinates of a middle point, a left end point and a right end point of the section line at each mileage position according to the mileage parameters and the design center line; the method comprises the following specific steps:
(1) extracting parameter data L of a certain mileage from the mileage parameter set Lcj(lcj，LeftRangej，RightRangej) (j is more than or equal to 1 and less than or equal to M), wherein M is the number of mileage parameters;
(2) traversing the node mileage sequence Ls until Ls is satisfiedk-1≤lcj<lsk(k is more than or equal to 2 and less than or equal to N), the current mileage is indicated to be positioned at the node pk-1And pkTo (c) to (d);
(3) calculating the difference Dis of inner distance in straight (circular arc) line segmentj＝lcj-lsk-1；
(4) If p isk-1And pkBetween is a straight line segment (p)k-1Convexity is zero), processes (5) to (8) are performed, if it is a circular arc segment (p)k-1Convexity is not zero), processes (9) - (12) are executed;
(5) according to pk-1And pkIs constructed as a vector of coordinates
Figure BDA0003159226380000031
The length of the calculation vector is DL,
(6) and if the point of the current mileage on the current straight line segment is q, the vector is determined
Figure BDA0003159226380000032
Figure BDA0003159226380000033
Then according to pk-1Obtaining the coordinate of the point q;
(7) let the current straight line segment pk-1pkRight side normal vector of
Figure BDA0003159226380000034
Length of DLrLet the right end point be rpThen vector of
Figure BDA0003159226380000035
Then, the right endpoint r can be obtained according to the coordinate of the point qpThe coordinates of (a);
(8) let the left end point be lpThen vector of
Figure BDA0003159226380000036
Then, the left end point l can be obtained according to the coordinates of the point qpThe coordinates of (a);
(9) according to pk-1And pkCoordinate structure chord vector of
Figure BDA0003159226380000037
Note pk-1And pkIs Q, the coordinate of the point Q is (p)k-1+pk)/2；
(10) Note pk-1pkRight side normal vector is
Figure BDA0003159226380000038
Vector length of DLrAccording to node pk-1The positive and negative convexity of the circle is used for judging the direction of the arc, the positive convexity means that the arc is anticlockwise, the circle center is positioned on the left side, the negative convexity means that the arc is clockwise, and the circle center is positioned on the right side;
(11) the circle center is O, the radius is R, the central angle corresponding to the arc segment is theta, and the distance from the point Q to the point O can be calculated to be dHR cos (0.5 θ), and then according to the coordinates of the point Q and the normal vector
Figure BDA0003159226380000041
And the convexity can obtain the coordinate of the center O;
(12) according to the difference of mileagejAnd obtaining the coordinates of the point q of the current mileage on the arc line section according to the arc section parameters, and then calculating the coordinates of the left end point and the right end point according to the coordinates of the point q, the coordinates of the circle center O point, the left end offset and the right end offset.
(13) And (5) repeating the processes (1) to (4) until all the mileage parameters are traversed.
And 6, respectively storing coordinates of the middle point, the left end point and the right end point of the section line of each mileage according to the mileage value.
The calculation formula of the distance between the nodes in step 2 of the present invention is as follows,
Figure BDA0003159226380000042
in the formula, buryk-1Is a node pk-1The convexity parameter of thetak-1Is the central angle of the arc segment, and R is the radius of the arc segment.
In the step 3, the format of the cross-section mileage parameter file is a text format, and each line represents parameters of one mileage, including a serial number, a mileage value, a left end offset and a right end offset.
In step 5, the mileage parameter set may include a mileage value exceeding the total length of the design centerline, and the mileage value is directly skipped during processing, so as to speed up the processing.
The invention has the advantages of reasonable design, high automation degree, high efficiency, good accuracy, low cost and the like. The concrete embodiment is as follows:
1. the method and the device automatically analyze the parameters of each node by using the design center line in the DXF format, and can keep the integrity and the authenticity of the design center line.
2. According to the method, the cross section line parameters are imported in a file form, so that the quick generation of the cross section line with special mileage and special left and right end extension ranges can be realized, the operation process is simplified, and the working efficiency is improved.
3. The method for calculating the coordinates of the midpoint and the left and right end points of the cross section line by using vector operation can obtain more accurate results, and the calculation process is more convenient and faster.
4. The invention has high automation degree, does not need manual intervention in the calculation process and can directly obtain the calculation result.
Drawings
FIG. 1 is an overall process flow diagram of the present invention.
Fig. 2 is a process flow diagram of step 2.
FIG. 3 is a schematic diagram of a cross-sectional mileage parameter file.
Fig. 4 is a process flow diagram of step 5.
FIG. 5 is an exemplary graph of centerline node coordinates and convexity parameters.
FIG. 6 is a cross sectional line and a center line superimposed illustration. (dark color is central line, light color is horizontal section line)
Detailed Description
See fig. 1, fig. 2, fig. 3, fig. 4, fig. 5, fig. 6.
Example 1: a highway cross section line batch generation method comprises the following steps:
step 1, collecting highway design center line data, and analyzing a center line node sequence; the method comprises the following specific steps:
(1) collecting DXF-format highway design center line data;
(2) reading a highway design center line data file by using a dxflib library, and analyzing coordinates (x, y) of each node of a center line and a convexity parameter (bull);
(3) determining the initial point and initial mileage l of the central line of the road design0The nodes are sequenced according to the starting and stopping sequence to form a node sequence Ds{Ds|pi(xi，yi，0，bulgei)∈Ds}。
For example, fig. 5 shows the coordinates of a part of nodes and their convexity parameters obtained by the analysis of the design center line of a certain road. The design centerline length for the example data is 23.5km, comprising 5946 nodes.
Step 2, calculating the mileage value at each node to obtain a node mileage sequence Ls { Ls | LskBelongs to Ls }; the method comprises the following specific steps:
(1) setting the mileage value ls of the initial node0Is 10；
(2) Sequence of slave nodes DsTake out the k-th node pk(2. ltoreq. k.ltoreq.N), N is the number of node sequences, here 5946;
(3) computing the node p on the centerlinek-1To pkS, the mileage value ls of the kth nodekIs equal to ls0Adding S;
(4) and (3) repeating the processes (2) and (3) until all the node mileage is calculated.
Step 3, setting a cross section mileage parameter file format;
fig. 3 is a schematic diagram of a section of mileage parameter file.
Step 4, analyzing the mileage parameter file of the cross section to obtain the mileage value, the left end offset and the right end offset of each mileage position to form a mileage parameter set Lc; the specific process is as follows:
(1) reading each line of the cross section mileage parameter file;
(2) resolving an in-line mileage value, a left end offset and a right end offset value according to the file format to obtain parameter data L of one mileagej(lcj，LeftRangej，RightRangej)；
(3) And reading and analyzing all the row data to obtain a mileage parameter set Lc.
Exemplary data includes 475 cross-sectional mileage parameters, ranging from 14km to 23.480km, with a 20m cross-sectional spacing and a 50m left-right offset.
Step 5, calculating coordinates of a middle point, a left end point and a right end point of the section line at each mileage position according to the mileage parameters and the design center line; the method comprises the following specific steps:
(1) extracting parameter data L of a certain mileage from the mileage parameter set Lcj(lcj，LeftRangej，RightRangej) (j is more than or equal to 1 and less than or equal to M), wherein M is the number of mileage parameters, and is 475;
(2) traversing the node mileage sequence Ls until Ls is satisfiedk-1≤lcj<lsk(k is more than or equal to 2 and less than or equal to N), the current mileage is indicated to be positioned at the node pk-1And pkTo (c) to (d);
(3) calculating the difference Dis of inner distance in straight (circular arc) line segmentj＝lcj-lsk-1；
(4) If p isk-1And pkBetween is a straight line segment (p)k-1Convexity is zero), processes (5) to (8) are performed, if it is a circular arc segment (p)k-1Convexity is not zero), processes (9) - (12) are executed;
(5) according to pk-1And pkIs constructed as a vector of coordinates
Figure BDA0003159226380000071
The length of the calculation vector is DL,
(6) is provided withIf the point of the current mileage on the current straight line segment is q, the vector is determined
Figure BDA0003159226380000072
Figure BDA0003159226380000073
Then according to pk-1Obtaining the coordinate of the point q;
(7) let the current straight line segment pk-1pkRight side normal vector of
Figure BDA0003159226380000074
Length of DLrLet the right end point be rpThen vector of
Figure BDA0003159226380000075
Then, the right endpoint r can be obtained according to the coordinate of the point qpThe coordinates of (a);
(8) let the left end point be lpThen vector of
Figure BDA0003159226380000081
Then, the left end point l can be obtained according to the coordinates of the point qpThe coordinates of (a);
(9) according to pk-1And pkCoordinate structure chord vector of
Figure BDA0003159226380000082
Note pk-1And pkIs Q, the coordinate of the point Q is (p)k-1+pk)/2；
(10) Note pk-1pkRight side normal vector is
Figure BDA0003159226380000083
Vector length of DLrAccording to node pk-1The positive and negative convexity of the circle is used for judging the direction of the arc, the positive convexity means that the arc is anticlockwise, the circle center is positioned on the left side, the negative convexity means that the arc is clockwise, and the circle center is positioned on the right side;
(11) the circle center is O, the radius is R, the central angle corresponding to the arc segment is theta, and the Q point can be calculatedDistance d from OHR cos (0.5 θ), and then normal vector according to the coordinates of point Q
Figure BDA0003159226380000084
And the convexity can obtain the coordinate of the center O;
(12) according to the difference of mileagejAnd obtaining the coordinates of the point q of the current mileage on the arc line section according to the arc section parameters, and then calculating the coordinates of the left end point and the right end point according to the coordinates of the point q, the coordinates of the circle center O point, the left end offset and the right end offset.
(13) And (5) repeating the processes (1) to (4) until all the mileage parameters are traversed.
FIG. 6 is a partial cross sectional line and a center line superimposed illustration.
And 6, respectively storing coordinates of the middle point, the left end point and the right end point of the section line of each mileage according to the mileage value.
What has been described above is merely specific details or common sense of the known embodiments of the present invention and is not described here too much. It should be noted that the above-mentioned embodiments do not limit the present invention in any way, and all technical solutions obtained by means of equivalent substitution or equivalent transformation for those skilled in the art are within the protection scope of the present invention. The scope of the claims of the present application shall be determined by the contents of the claims, and the description of the embodiments and the like in the specification shall be used to explain the contents of the claims.

Claims (8)

1. A batch generation method of highway cross section lines is characterized by comprising the following steps:
step 1: collecting highway design center line data, and analyzing a center line node sequence;
step 2, calculating the mileage value at each node to obtain a node mileage sequence;
step 3, setting a cross section mileage parameter file format;
step 4, analyzing the mileage parameter file of the cross section to obtain the mileage value, the left end offset and the right end offset of each mileage position to form a mileage parameter set;
step 5, calculating coordinates of a middle point, a left end point and a right end point of the section line at each mileage position according to the mileage parameters and the design center line;
and 6, respectively storing coordinates of the middle point, the left end point and the right end point of the section line of each mileage according to the mileage value.
2. The mass production method of highway cross section lines according to claim 1, wherein the step 1: collecting highway design central line data, analyzing central line node sequence DsThe method comprises the following specific steps:
(1) collecting DXF-format highway design center line data;
(2) reading a highway design center line data file by using a dxflib library, and analyzing coordinates (x, y) of each node of a center line and a convexity parameter (bull);
(3) determining the initial point and initial mileage l of the central line of the road design0The nodes are sequenced according to the starting and stopping sequence to form a node sequence Ds{Ds|pi(xi，yi，0，bulgei)∈Ds}。
3. The method for batch production of highway cross section lines as claimed in claim 1, wherein in step 2, the mileage value at each node is calculated to obtain a node mileage sequence Ls { Ls | LskBelongs to Ls }, and comprises the following specific steps: (1) setting the mileage value ls of the initial node0Is 10；
(2) Sequence of slave nodes DsTake out the k-th node pk(k is more than or equal to 2 and less than or equal to N), and N is the number of the node sequences;
(3) computing the node p on the centerlinek-1To pkS, the mileage value ls of the kth nodekIs equal to ls0Adding S;
(4) and (3) repeating the processes (2) and (3) until all the node mileage is calculated.
4. The batch generation method of highway cross section lines according to claim 1, wherein the step 4 of analyzing the cross section mileage parameter file to obtain the mileage value, the left end offset and the right end offset of each mileage position to form a mileage parameter set Lc comprises the following specific steps:
(1) reading each line of the cross section mileage parameter file;
(2) resolving an in-line mileage value, a left end offset and a right end offset value according to the file format to obtain parameter data L of one mileagej(lcj，LeftRangej，RightRangej)；
(3) And reading and analyzing all the row data to obtain a mileage parameter set Lc.
5. The batch generation method of highway cross section lines according to claim 1, wherein the step 5 of calculating coordinates of a midpoint, a left end point and a right end point of the cross section line at each mileage position according to the mileage parameters and the design center line comprises the following specific steps:
(1) extracting parameter data L of a certain mileage from the mileage parameter set Lcj(lcj，LeftRangej，RightRangej) (j is more than or equal to 1 and less than or equal to M), wherein M is the number of mileage parameters;
(2) traversing the node mileage sequence Ls until Ls is satisfiedk-1≤lcj<lsk(k is more than or equal to 2 and less than or equal to N), the current mileage is indicated to be positioned at the node pk-1And pkTo (c) to (d);
(3) calculating the difference Dis of inner distance in straight (circular arc) line segmentj＝lcj-lsk-1；
(4) If p isk-1And pkBetween is a straight line segment, pk-1If the convexity is zero, executing the processes (5) - (8); if it is a segment of a circular arc, pk-1If the convexity is not zero, executing the processes (9) to (12);
(5) according to pk-1And pkIs constructed as a vector of coordinates
Figure FDA0003159226370000031
Calculating the length of the vector as DL;
(6) setting the current mileage on the current straight line segmentPoint is q, then vector
Figure FDA0003159226370000032
Figure FDA0003159226370000033
Then according to pk-1Obtaining the coordinate of the point q;
(7) let the current straight line segment pk-1pkRight side normal vector of
Figure FDA0003159226370000034
Length of DLrLet the right end point be rpThen vector of
Figure FDA0003159226370000035
Then, the right endpoint r can be obtained according to the coordinate of the point qpThe coordinates of (a);
(8) let the left end point be lpThen vector of
Figure FDA0003159226370000036
Then, the left end point l can be obtained according to the coordinates of the point qpThe coordinates of (a);
(9) according to pk-1And pkCoordinate structure chord vector of
Figure FDA0003159226370000037
Note pk-1And pkIs Q, the coordinate of the point Q is (p)k-1+pk)/2；
(10) Note pk-1pkRight side normal vector is
Figure FDA0003159226370000038
Vector length of DLrAccording to node pk-1The positive and negative convexity of the circle is used for judging the direction of the arc, the positive convexity means that the arc is anticlockwise, the circle center is positioned on the left side, the negative convexity means that the arc is clockwise, and the circle center is positioned on the right side;
(11) the circle center is marked as O, the radius is marked as R, and the arc is formedThe central angle corresponding to the segment is theta, and the distance from the point Q to the point O can be calculated to be dHR cos (0.5 θ), and then normal vector according to the coordinates of point Q
Figure FDA0003159226370000039
And the convexity can obtain the coordinate of the center O;
(12) according to the difference of mileagejObtaining the coordinates of a point q of the current mileage on the arc line section according to the arc section parameters, and then calculating the coordinates of a left end point and a right end point according to the coordinates of the point q, the coordinates of a circle center O point, and the left end offset and the right end offset;
(13) and (5) repeating the processes (1) to (4) until all the mileage parameters are traversed.
6. The mass production method of highway cross section lines according to claim 1, wherein the calculation formula of the distance between nodes in step 2 is as follows,
Figure FDA0003159226370000041
in the formula, buryk-1Is a node pk-1The convexity parameter of thetak-1Is the central angle of the arc segment, and R is the radius of the arc segment.
7. The batch generation method for highway cross section lines according to claim 1, wherein the format of the cross section mileage parameter file in the step 3 is a text format, and each line represents parameters of one mileage, including a serial number, a mileage value, a left end offset and a right end offset.
8. The batch generating method for highway cross section lines as recited in claim 1, wherein in the step 5, the mileage parameter set includes a mileage value exceeding the total length of the design center line, and the mileage value is directly skipped during processing.
CN202110785974.5A 2021-07-12 2021-07-12 Batch generation method for highway cross section lines Active CN113486430B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110785974.5A CN113486430B (en) 2021-07-12 2021-07-12 Batch generation method for highway cross section lines

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110785974.5A CN113486430B (en) 2021-07-12 2021-07-12 Batch generation method for highway cross section lines

Publications (2)

Publication Number Publication Date
CN113486430A true CN113486430A (en) 2021-10-08
CN113486430B CN113486430B (en) 2023-08-18

Family

ID=77938816

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110785974.5A Active CN113486430B (en) 2021-07-12 2021-07-12 Batch generation method for highway cross section lines

Country Status (1)

Country Link
CN (1) CN113486430B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2646258A1 (en) * 1989-04-24 1990-10-26 Digital Equipment Int Method of determining intersections of polynomial parametric curves, for computer aided design
CN106887020A (en) * 2015-12-12 2017-06-23 星际空间（天津）科技发展有限公司 A kind of road vertical and horizontal section acquisition methods based on LiDAR point cloud
CN110030972A (en) * 2019-04-24 2019-07-19 中铁八局集团第三工程有限公司 Tunnel Overbreak & Underbreak detection method based on ExcelVBA
CN111967071A (en) * 2020-07-30 2020-11-20 中交第二公路勘察设计研究院有限公司 Roadbed cross section data processing system and method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2646258A1 (en) * 1989-04-24 1990-10-26 Digital Equipment Int Method of determining intersections of polynomial parametric curves, for computer aided design
CN106887020A (en) * 2015-12-12 2017-06-23 星际空间（天津）科技发展有限公司 A kind of road vertical and horizontal section acquisition methods based on LiDAR point cloud
CN110030972A (en) * 2019-04-24 2019-07-19 中铁八局集团第三工程有限公司 Tunnel Overbreak & Underbreak detection method based on ExcelVBA
CN111967071A (en) * 2020-07-30 2020-11-20 中交第二公路勘察设计研究院有限公司 Roadbed cross section data processing system and method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
赵壮立: "浅述高速公路中心线选择", 《万方数据知识服务平台》, pages 1 - 4 *

Also Published As

Publication number Publication date
CN113486430B (en) 2023-08-18

Similar Documents

Publication Publication Date Title
KR102125959B1 (en) Method and apparatus for determining a matching relationship between point cloud data
CN110595475A (en) Tracking path fitting method and device, intelligent automobile and storage medium
CN111323037B (en) Voronoi path planning algorithm for novel framework extraction of mobile robot
CN103839228A (en) Data rarefying and smooth processing method based on vector map
CN114861500A (en) Method and system for automatically generating tunnel structure finite element model based on three-dimensional point cloud
CN109341704B (en) Map precision determination method and device
CN113486430A (en) Batch generation method for highway cross section lines
CN110717141A (en) Lane line optimization method and device and storage medium
CN110647647A (en) Closed graph similarity searching method based on time sequence complexity difference
CN112269848B (en) Crowd-sourced track data fusion method and device
CN113128307A (en) Lane line detection processing method, and related device and system
CN106202593B (en) Equidistant curve generation method
CN110619134B (en) Integrated detection and repair method for solving problem of flying spot and spot density of road network data
CN108763817B (en) Electric underground pipe network matching method based on least square modeling
CN106055669A (en) Data discretization method and system
CN116757025B (en) Automatic ship cabin pattern pickup method based on DXF format
CN117240305B (en) Pipe network topology data compression method, device and equipment and readable storage medium
CN111241221A (en) Automatic matching and high-precision repairing method for damaged terrain coordinate data
CN115311382A (en) Conversion method, device and medium for CAD multi-segment line and road element
CN116522462B (en) Computer fitting method for plane line shape of existing highway route
JP6806321B2 (en) Surface shape determination device, surface shape determination method, and surface shape determination program
CN115793675B (en) Coupling calibration method and device for unmanned ship power system and computer equipment
CN117874866A (en) Control point-based planar road generation and connection method
CN117197410B (en) Virtual splicing method, device and equipment for steel structure and storage medium
CN112417368B (en) Coordinate calculation method for road plane line

Legal Events

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