Road route stake mark positioning method and device based on geographic data file

Abstract

The embodiment of the invention discloses a road route stake mark positioning method and device based on a geographic data file. A specific embodiment of the method comprises the following steps: in response to a received file uploading instruction initiated by a user, obtaining geographic data information corresponding to the file uploading instruction, and storing the geographic data information; determining a coordinate point set contained in the geographic data file; according to the distance between every two adjacent coordinate points, generating a line segment-by-segment sub-line segment length set; in response to the received to-be-positioned pile number distance input by the user, determining an along-route distance value between the to-be-positioned pile number distance and the starting point pile number distance; according to the line segment-by-segment sub-line segment length set and the distance value along the line, to-be-positioned pile number coordinates are generated; and generating a rectangular block diagram according to the to-be-positioned pile number coordinates, and performing superposition display on the rectangular block diagram and the geographic data file. According to the embodiment, the accuracy of pile number positioning can be improved, and road construction errors are reduced.

Description

Technical Field

[0001] The embodiments of the present disclosure relate to the field of computer technology, and more particularly to a method and device for locating a road route stake number based on a geographic data file. Background Art

[0002] A KML file is an XML-based geographic data exchange file used to define geographic features such as locations and routes. In transportation engineering, stake numbers (such as "K1+234.56") are a commonly used method for locating locations along a route. However, KML files do not directly contain the total length of the route or the correspondence between stake numbers and path points. Therefore, a stake number positioning method for KML route files is necessary. Currently, when locating road stake numbers, the commonly used method is to determine the longitude and latitude of the stake number to be located based on the longitude and latitude of the known stake number.

[0003] However, when using the above method to locate road pile numbers, a technical problem that often occurs is that the elevation difference of the road is not taken into account, and it is difficult to adapt to the curves and slopes in complex road routes, which will lead to inaccurate positioning of the pile numbers and increase road construction errors.

[0004] The above information disclosed in this Background section is only for enhancement of understanding of the background of the present disclosure concept and therefore it may contain information that does not form the prior art that is already known in this country to a person of ordinary skill in the art. Summary of the Invention

[0005] The content of this disclosure is used to briefly introduce concepts that will be described in detail in the detailed description section below. The content of this disclosure is not intended to identify key features or essential features of the claimed technical solution, nor is it intended to limit the scope of the claimed technical solution.

[0006] Some embodiments of the present disclosure provide a method and apparatus for positioning a road route stake number based on a geographic data file to solve one or more of the technical problems mentioned in the above background technology section.

[0007] In a first aspect, some embodiments of the present disclosure provide a road route pile number positioning method based on a geographic data file, the method comprising: in response to receiving a file upload instruction initiated by a user, obtaining geographic data information corresponding to the above file upload instruction, and storing the above geographic data information, wherein the above geographic data information includes route name information, starting pile number distance, end pile number distance, and geographic data file; determining a coordinate point set contained in the above geographic data file; generating a route segment-by-segment length set based on the distance between every two adjacent coordinate points in the above coordinate point set; in response to receiving a pile number distance to be positioned input by a user, determining an along-route distance value between the above pile number distance to be positioned and the above starting pile number distance; generating the coordinates of the pile number to be positioned based on the above route segment-by-segment length set and the above along-route distance value; generating a rectangular frame diagram based on the above pile number coordinates to be positioned, and superimposing and displaying the rectangular frame diagram and the above geographic data file.

[0008] In a second aspect, some embodiments of the present disclosure provide a road route pile number positioning device based on a geographic data file, the device comprising: an acquisition unit, configured to, in response to receiving a file upload instruction initiated by a user, acquire geographic data information corresponding to the file upload instruction, and store the geographic data information, wherein the geographic data information includes route name information, starting pile number distance, end pile number distance, and geographic data file; a first determination unit, configured to determine a coordinate point set contained in the geographic data file; a first generation unit, configured to generate a route segment-by-segment length set based on the distance between every two adjacent coordinate points in the coordinate point set; a second determination unit, configured to, in response to receiving a to-be-positioned pile number distance input by a user, determine an along-route distance value between the to-be-positioned pile number distance and the starting pile number distance; a second generation unit, configured to generate the to-be-positioned pile number coordinates based on the to-be-positioned pile number coordinates and the along-route distance value; a third generation unit, configured to generate a rectangular frame diagram based on the to-be-positioned pile number coordinates, and to superimpose and display the rectangular frame diagram and the geographic data file.

[0009] In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by one or more processors, the one or more processors implement the method described in any implementation of the first aspect above.

[0010] In a fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having a computer program stored thereon, wherein when the program is executed by a processor, the method described in any implementation of the first aspect is implemented.

[0011] The above-described various embodiments of the present disclosure have the following beneficial effects: The road route stake location method based on geographic data files, as described in some embodiments of the present disclosure, can reduce road construction errors. Specifically, increased road construction errors are caused by not considering elevation differences in the road and failing to adapt to curves and slopes in complex road routes, which can lead to inaccurate stake location. Based on this, the road route stake location method based on geographic data files in some embodiments of the present disclosure first obtains geographic data information corresponding to the file upload instruction in response to receiving a file upload instruction initiated by a user, and then stores the geographic data information. The geographic data information includes route name information, starting stake distance, ending stake distance, and geographic data file. By caching the user-uploaded file, the response time of subsequent positioning can be shortened. Second, a set of coordinate points contained in the geographic data file is determined. Thus, the coordinate data of the road route can be obtained from the geographic data file. Then, a set of sub-segment lengths for the route is generated based on the distance between each two adjacent coordinate points in the coordinate point set. Based on the above coordinate point set, the road is divided into multiple sub-segments, and the length of each sub-segment is accurately calculated, avoiding errors caused by curves and slope changes in the road. Subsequently, in response to receiving the user-inputted distance of the pile number to be located, the along-route distance value between the distance of the pile number to be located and the distance of the starting pile number is determined. Next, based on the above segment-by-segment length set and the above along-route distance values, the coordinates of the pile number to be located are generated. Using this segment-by-segment length set and the along-route distance values, the actual coordinates of the pile number in complex road morphology can be accurately calculated. Finally, based on the coordinates of the pile number to be located, a rectangular box diagram is generated and superimposed on the above-mentioned geographic data file. This allows the specific location of the pile number to be intuitively presented on a visual interface, helping construction personnel accurately identify the pile number location and reducing errors during actual construction. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] The above and other features, advantages, and aspects of the various embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that components and elements are not necessarily drawn to scale.

[0013] Figure 1 is a flow chart of some embodiments of a road route stake number positioning method based on a geographic data file according to the present disclosure;

[0014] Figure 2 is a schematic diagram of a file upload window according to some embodiments of the road route pile number positioning method based on geographic data files disclosed herein;

[0015] Figure 3 is a schematic diagram of visualization information of positioning pile numbers according to some embodiments of the road route pile number positioning method based on geographic data files disclosed herein;

[0016] Figure 4 1 is a schematic structural diagram of some embodiments of a road route pile number positioning device based on a geographic data file according to the present disclosure;

[0017] Figure 5 It is a structural diagram of an electronic device suitable for implementing some embodiments of the present disclosure. DETAILED DESCRIPTION

[0018] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of protection of the present disclosure.

[0019] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure may be combined with each other.

[0020] It should be noted that the concepts of "first" and "second" mentioned in this disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0021] It should be noted that the modifications of "one" and "multiple" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, they should be understood as "one or more".

[0022] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0023] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0024] Figure 1 The process 100 of some embodiments of the road route pile number positioning method based on geographic data files according to the present disclosure is shown. The road route pile number positioning method based on geographic data files includes the following steps:

[0025] Step 101: In response to receiving a file upload instruction initiated by a user, obtaining geographic data information corresponding to the file upload instruction and storing the geographic data information.

[0026] In some embodiments, the execution entity (e.g., a computing device) of the road route pile number positioning method based on geographic data files can obtain geographic data information corresponding to the file upload instruction in response to receiving a file upload instruction initiated by a user, and store the geographic data information.

[0027] In some optional implementations of some embodiments, the execution entity, in response to receiving a file upload instruction initiated by a user, obtains geographic data information corresponding to the file upload instruction, and stores the geographic data information, which may include the following steps:

[0028] The first step is to receive the file upload instruction initiated by the user through the preset file upload window. The above file upload window can be a window component deployed on the road route pile number positioning web page based on the geographic data file. The schematic diagram of the above window component is as follows Figure 2 As shown. The above-mentioned road route pile number positioning web page based on the geographic data file can be a web page that is communicatively connected to the above-mentioned execution entity. The above-mentioned file upload instruction can include geographic data information. The above-mentioned geographic data information can include route name information, starting pile number distance, end pile number distance, and geographic data file. The above-mentioned starting pile number distance and the above-mentioned end pile number distance can be the actual distance value of the pile number along the road curve direction. The above-mentioned distance value can be in the format of "12+345.67", where "12" represents kilometers and "345.67" represents meters. The above-mentioned geographic data file can be a geographic data exchange file, which is used to define geographic features such as locations and paths. The above-mentioned geographic data file can be a KML file.

[0029] As an example, Figure 2 As shown, users can fill in the route name, starting station distance, and ending station distance in the file upload window. They can also add geographic data files to the file upload window by clicking or dragging. Afterwards, users can click the OK button to send the file upload instruction to the file upload window.

[0030] The second step is to obtain the geographic data corresponding to the file upload instruction via a preset file upload component in response to receiving the file upload instruction initiated by the user. In practice, when the execution entity receives the file upload instruction from the file upload window, the preset file upload component can be used to obtain the geographic data corresponding to the file upload instruction. The file upload component can be a software module for receiving user-uploaded files. For example, the file upload component can be an HTML file upload control or a JavaScript file upload component.

[0031] The third step is to store the geographic data information in a preset project platform server. The project platform server can be a cloud server that is communicatively connected to the execution entity. The project platform server can be used to store, process, and manage the geographic data information.

[0032] Step 102: Determine the coordinate point set contained in the geographic data file.

[0033] In some embodiments, the execution entity may determine a set of coordinate points contained in the geographic data file. The geographic data file may contain at least one road route information. For one of the at least one road route information, the road route information may be represented by at least one route coordinate. The road route information may correspond to a road route tag in the geographic data file, and the road route tag may be <linestring>The at least one route coordinate may correspond to a coordinate tag in the geographic data file, for example, <coordinates>Tag. In practice, first, the geographic data file can be parsed through a preset parsing library. The parsing library can be an algorithm for parsing geographic data files. The parsing library can be the xml.etree.ElementTree parsing library in Python, or the lxml parsing library. Secondly, the coordinate tags can be searched from the parsed geographic data file to obtain at least one coordinate tag. Afterwards, the route coordinates corresponding to each coordinate tag in the at least one coordinate tag can be determined as coordinate points to obtain a coordinate point set. Here, each coordinate point in the coordinate point set is a route coordinate in the at least one route coordinate. The coordinate points can be represented by longitude, latitude and elevation.

[0034] Step 103 : generating a set of lengths of sub-segments of the route segment by segment based on the distance between every two adjacent coordinate points in the coordinate point set.

[0035] In some embodiments, the execution entity may generate a set of lengths of route sub-segments according to the distance between every two adjacent coordinate points in the coordinate point set.

[0036] In some optional implementations of some embodiments, the execution entity may generate a set of lengths of sub-segments of the route segment by segment based on the distance between every two adjacent coordinate points in the coordinate point set, which may include the following steps:

[0037] The first step is to determine the coordinate point distance corresponding to each two adjacent coordinate points in the above coordinate point set to obtain a coordinate point distance set. The coordinate points in the above coordinate point set can be arranged in the order of the route. In practice, first, each coordinate point in the above coordinate point set and its corresponding next coordinate point can be determined as two adjacent coordinate points. Secondly, for each two adjacent coordinate points determined, the coordinate point distance between each coordinate point in the above two adjacent coordinate points is determined to obtain a coordinate point distance set. Here, each coordinate point distance in the above coordinate point distance set corresponds to two adjacent coordinate points, and the above coordinate point distance can be the sub-segment length of the next coordinate point corresponding to the above two adjacent coordinate points. Each coordinate point in the above coordinate point set, except the first coordinate point, corresponds to a sub-segment length. The number of coordinate point distances in the above coordinate point distance set can be the number of coordinate points in the above coordinate point set minus 1.

[0038] In the second step, for each coordinate point in the above coordinate point set, perform the following steps:

[0039] In the first sub-step, in response to determining that the coordinate point is the first coordinate point in the coordinate point set, the starting point pile number distance is determined as the length of the route segment corresponding to the coordinate point.

[0040] In the second sub-step, in response to determining that the coordinate point is not the first coordinate point in the coordinate point set, the sum of the starting point stake distance and the distances to each coordinate point in the coordinate point distance set corresponding to the coordinate point is determined as the route segment-by-segment sub-segment length corresponding to the coordinate point. In practice, first, the sub-segment lengths corresponding to each coordinate point in the coordinate point set and the sub-segment lengths of the coordinate points preceding the coordinate point can be determined to obtain a sub-segment length set. Subsequently, the sum of the sub-segment lengths in the sub-segment length set can be determined as the total sub-segment length. Finally, the sum of the starting point stake distance and the total sub-segment length is determined as the route segment-by-segment sub-segment length corresponding to the coordinate point.

[0041] In the third step, the determined lengths of each route segment-by-segment sub-line segment are determined as a route segment-by-segment sub-line segment length set, wherein each route segment-by-segment sub-line segment length in the route segment-by-segment sub-line segment length set corresponds to a coordinate point in the coordinate point set.

[0042] In practice, we discovered that using the above technical solution to locate road stakes presents a technical problem: mountain roads and tunnels have numerous slopes and curves. Using the straight-line distance between two coordinate points to generate sub-segment lengths can result in significant distance errors. Therefore, we decided to adopt the following solution.

[0043] In some other optional implementations of some embodiments, the execution entity determines, for each two adjacent coordinate points in the coordinate point set, the coordinate point distance corresponding to the two adjacent coordinate points to obtain the coordinate point distance set, which may include the following steps:

[0044] In the first step, the coordinate point corresponding to the first and the coordinate point corresponding to the second in the coordinate point set are respectively determined as the first coordinate point and the second coordinate point.

[0045] In the second step, the distance between the first coordinate point and the second coordinate point is determined as the first straight line coordinate point distance. In practice, the distance between the first coordinate point and the second coordinate point can be determined using the Euclidean distance formula.

[0046] In the third step, for each coordinate point in the above coordinate point set except the first coordinate point and the second coordinate point, perform the following processing steps:

[0047] The first sub-step is, in response to determining that the above-mentioned coordinate point is not collinear with the first coordinate point and the second coordinate point, determining both the second coordinate point and the above-mentioned coordinate point as curve coordinate points, and determining the second coordinate point and the above-mentioned coordinate point as the first coordinate point and the second coordinate point, respectively, and performing the above-mentioned processing steps again. In practice, first, the vector between the above-mentioned second coordinate point and the above-mentioned first coordinate point can be determined as the first vector. Then, the vector between the above-mentioned coordinate point and the above-mentioned second coordinate point can be determined as the second vector. Thereafter, the cross product between the above-mentioned first vector and the above-mentioned second vector can be determined. When the modulus of the above-mentioned cross product is less than or equal to the preset collinearity threshold, it is determined that the above-mentioned coordinate point is collinear with the above-mentioned first coordinate point and the above-mentioned second coordinate point. When the modulus of the above-mentioned cross product is greater than the preset collinearity threshold, it is determined that the above-mentioned coordinate point is not collinear with the above-mentioned first coordinate point and the above-mentioned second coordinate point.

[0048] In a second sub-step, in response to determining that the coordinate point is collinear with the first coordinate point and the second coordinate point, determining a straight-line coordinate point distance between the coordinate point and the second coordinate point, determining the second coordinate point and the coordinate point as the first coordinate point and the second coordinate point, and performing the above processing steps again. In practice, the straight-line coordinate point distance between the coordinate point and the second coordinate point can be determined using the above-mentioned Euclidean distance formula.

[0049] In the fourth step, a set consisting of the determined distances between each straight line coordinate point and the first straight line coordinate point distance is determined as a straight line coordinate point distance set.

[0050] In the fifth step, each curve coordinate point that satisfies a preset continuity condition among the obtained curve coordinate points is identified as a continuous curve coordinate point group, thereby generating a set of continuous curve coordinate point groups. The continuity condition is that at least two curve coordinate points included in each curve coordinate point are adjacent in the set of coordinate points. In practice, at least two adjacent curve coordinate points among each curve coordinate point can first be identified as a continuous curve coordinate point group. This can generate the continuous curve coordinate point groups corresponding to each curve coordinate point. Finally, each of the continuous curve coordinate point groups can be identified as a set of continuous curve coordinate point groups.

[0051] The sixth step is to determine the three-dimensional curve corresponding to each continuous curve coordinate point group in the continuous curve coordinate point group set, thereby obtaining a three-dimensional curve set. In practice, for each continuous curve coordinate point group in the continuous curve coordinate point group set, a three-dimensional curve can be obtained based on each continuous curve coordinate point in the continuous curve coordinate point group using a preset curve fitting algorithm. The curve fitting algorithm can be a polynomial interpolation method or a Bezier curve method.

[0052] In the seventh step, for each continuous curve coordinate point group in the continuous curve coordinate point group set, the arc length distance between every two continuous curve coordinate points in the continuous curve coordinate point group is determined based on the three-dimensional curve set, thereby obtaining an arc length distance set. In practice, for each continuous curve coordinate point group in the continuous curve coordinate point group set, the arc length distance between every two continuous curve coordinate points in the continuous curve coordinate point group can be determined using the arc length integral formula based on the equation of the corresponding three-dimensional curve. The obtained arc length distances can then be determined as an arc length distance set.

[0053] In step 8, a coordinate point distance set is generated based on the arc length distance set and the line coordinate point distance set. In practice, each arc length distance in the arc length distance set can be determined as a coordinate point distance, and each line coordinate point distance in the line coordinate point distance set can be determined as a coordinate point distance to obtain a coordinate point distance set.

[0054] Steps 1 through 8 and their related content, as an inventive feature of an embodiment of the present disclosure, address the aforementioned technical issue of "causing large distance errors." The factors contributing to this technical issue are often as follows: Mountain roads or tunnels often have numerous ramps and curves, and the length of a sub-segment is generated by the straight-line distance between two coordinate points. Resolving these factors can reduce distance errors. To achieve this, each coordinate point in the coordinate point set is first traversed and, based on whether they are collinear, the coordinate points are classified as straight-line coordinate points and curved-line coordinate points. The distances between straight-line coordinate points and the distances between curved-line coordinate points are then calculated separately. When coordinate points are on the same straight line, straight-line calculations can be performed between them, reducing the amount of computation required. By identifying and screening continuous curved-line coordinate points, continuous curved sections on the road can be accurately identified, ensuring that large errors caused by ignoring the curvature of ramps or curves during the calculation process are not generated. This improves the accuracy of distance calculations on complex mountain roads or tunnels, thereby reducing errors during construction.

[0055] Step 104 : In response to receiving the to-be-positioned stake distance input by the user, determining the along-route distance value between the to-be-positioned stake distance and the starting stake distance.

[0056] In some embodiments, the execution entity may determine, in response to receiving a user input of a distance to be located, a distance along the route between the distance to be located and the starting point distance. The distance to be located may represent the actual cumulative distance of the distance along the road curve. The data format of the distance to be located is the same as the data format of the starting point distance and the ending point distance.

[0057] In some optional implementations of some embodiments, the execution entity, in response to receiving the to-be-positioned stake distance input by the user, determines the along-route distance between the to-be-positioned stake distance and the starting stake distance, which may include the following steps:

[0058] The first step is to obtain the distance to the stake to be located, input by the user, through a preset query window. In practice, the user can first enter the distance to be located into the preset query window. This query window can be a window component deployed on the webpage for road route stake location based on the geographic data file. Secondly, the user can click the OK button in the query window to send the distance to the execution entity.

[0059] In the second step, the difference between the to-be-located pile distance and the starting pile distance is determined as the along-route distance value. In practice, when the execution subject receives the to-be-located pile distance, the difference between the to-be-located pile distance and the starting pile distance can be determined as the along-route distance value.

[0060] Step 105 : generating the coordinates of the stake number to be located according to the length set of each sub-line segment of the route and the distance value along the route.

[0061] In some embodiments, the execution entity may generate the stake coordinates to be located based on the segment length set of each sub-line segment of the route and the distance value along the route.

[0062] In some optional implementations of some embodiments, the execution entity generates the stake coordinates to be located based on the segment-by-segment length set of the route and the distance value along the route, which may include the following steps:

[0063] In the first step, for each route segment-by-segment length in the above route segment-by-segment length set, perform the following steps:

[0064] In the first sub-step, in response to determining that the distance along the route is equal to the length of the segment-by-segment sub-line segment of the route, a coordinate point corresponding to the length of the segment-by-segment sub-line segment of the route is determined as the coordinate of the stake to be located.

[0065] In the second sub-step, in response to determining that the length of the segment-by-segment sub-line of the route is greater than the along-route distance value, the following steps are performed:

[0066] Sub-step 1: determining the difference between the length of each sub-segment of the route and the distance value along the route as the excess distance value.

[0067] Sub-step 2: determining the coordinate points corresponding to the lengths of the sub-segments of the route as the upper boundary coordinates of the pile numbers to be located.

[0068] Sub-step three: determining the coordinate point corresponding to the length of the previous route segment-by-segment sub-segment corresponding to the route segment-by-segment sub-segment length as the lower boundary coordinate of the pile number to be located.

[0069] Sub-step 4: Generate the coordinates of the pile number to be located corresponding to the distance of the pile number to be located based on the above-mentioned excess distance value, the upper limit coordinates of the pile number to be located, and the lower limit coordinates of the pile number to be located. In practice, the coordinates of the pile number to be located corresponding to the distance of the pile number to be located can be generated by the following formula.

[0070]

[0071] Among them, CoordX represents the coordinates of the pile number to be located. CoordA represents the lower limit coordinates of the pile number to be located. CoordB represents the upper limit coordinates of the pile number to be located. i It represents the length of the sub-line segment corresponding to the upper boundary coordinate of the pile number to be located, that is, the coordinate point distance between the upper boundary coordinate of the pile number to be located and the lower boundary coordinate of the pile number to be located. Dx represents the excess distance value.

[0072] Step 106 : generating a rectangular frame diagram according to the coordinates of the stake number to be located, and superimposing and displaying the rectangular frame diagram and the geographic data file.

[0073] In some embodiments, the execution entity may generate a rectangular frame diagram according to the coordinates of the stake number to be located, and overlay and display the rectangular frame diagram and the geographic data file.

[0074] In some optional implementations of some embodiments, the execution entity generates a rectangular frame diagram according to the coordinates of the stake number to be located, and overlays and displays the rectangular frame diagram and the geographic data file, which may include the following steps:

[0075] The first step is to graphically render the geographic data file to obtain a geographic data image. The geographic data image can be used to represent geographic features such as locations and paths in the geographic data file. In practice, the execution entity can render the geographic data file using a preset image conversion algorithm to obtain the geographic data image, and then display the geographic data image using the webpage for positioning the road route number based on the geographic data file. The image conversion algorithm can be a KML to PNG Converter algorithm.

[0076] The second step is to generate a normal vector of the rectangular plane based on the upper boundary coordinates of the pile number to be located and the lower boundary coordinates of the pile number to be located. In practice, the vector difference between the upper boundary coordinates of the pile number to be located and the lower boundary coordinates of the pile number to be located can be determined as the normal vector of the rectangular plane.

[0077] The third step is to generate a rectangular frame diagram based on the normal vector of the rectangular plane. In practice, the plane whose normal vector is the normal vector of the rectangular plane and whose center point is the coordinate of the pile number to be located can be determined as a rectangular plane. The height and width of the rectangular plane can be preset length values, such as 1000m, which are not specifically limited here. Afterwards, the rectangular plane can be rendered to obtain a rectangular frame diagram. The color of the rectangular frame diagram can be translucent white, such as Figure 3 As shown in the semi-transparent box in the figure.

[0078] The fourth step is to superimpose the above rectangular frame diagram on the above geographic data image to obtain the visualization information of the positioning pile number, and to display the visualization information of the positioning pile number. In practice, the center point of the above rectangular frame diagram can be aligned with the coordinates of the pile number to be located contained in the above geographic data image, so as to superimpose the above rectangular frame diagram on the above geographic data image to obtain the visualization information of the positioning pile number. Afterwards, the visualization information of the positioning pile number can be displayed through the above-mentioned road route pile number positioning web page based on the geographic data file. The schematic diagram of the visualization information of the positioning pile number is shown as follows: Figure 3 shown.

[0079] In practice, we discovered that the technical problem with the above solution is that due to errors in road data collection equipment or sensor data loss, there are often large gaps between coordinate points in the geographic data file, resulting in missing road route data, which in turn affects the accuracy and efficiency of road construction and maintenance. Therefore, we decided to adopt the following solution.

[0080] In some optional implementations of some embodiments, the above execution entity may further perform the following steps:

[0081] In the first step, two curve coordinate points corresponding to each arc length distance in the arc length distance set that exceeds a preset fracture distance threshold are identified as fracture curve coordinate point pairs, thereby obtaining a fracture curve coordinate point pair set. The fracture distance threshold can be a length. For example, the fracture distance threshold can be 2 meters, which is not specifically limited herein. Each fracture curve coordinate point pair in the fracture curve coordinate point pair set can correspond to one arc length distance.

[0082] In the second step, based on the three-dimensional curve set, nonlinear interpolation is performed on each fracture curve coordinate point pair in the fracture curve coordinate point pair set to generate an interpolated curve coordinate point sequence, thereby obtaining an interpolated curve coordinate point sequence set. In practice, for each fracture curve coordinate point pair in the fracture curve coordinate point set, each interpolated coordinate point between the two curve coordinate points contained in the fracture curve coordinate point pair can be determined according to a preset step size and the equation of the corresponding three-dimensional curve to obtain the interpolated curve coordinate point sequence.

[0083] Step 3: For each straight line coordinate point distance in the above straight line coordinate point distance set, perform the following steps:

[0084] In the first sub-step, in response to determining that the distance between the straight line coordinate points is greater than the break distance threshold, two straight line coordinate points corresponding to the distance between the straight line coordinate points are determined as a break straight line coordinate point pair.

[0085] The second sub-step is to generate a target step length based on the fracture distance threshold and the distance between the straight line coordinate points. In practice, the target step length can be generated based on the fracture distance threshold and the distance between the straight line coordinate points using the following formula.

[0086] D step =min(D max , max(2m,0.1×D)).

[0087] Among them, D step Indicates the target step length. D max Indicates the fracture distance threshold. D indicates the distance between the straight line coordinate points.

[0088] The third sub-step is to interpolate the broken straight line coordinate point pairs according to the target step size to generate an interpolated straight line coordinate point sequence.

[0089] The fourth step is to update the above-mentioned interpolation curve coordinate point sequence set and the generated interpolation line coordinate point sequences to obtain an updated coordinate point set. In practice, for each interpolation curve coordinate point sequence in the above-mentioned interpolation curve coordinate point sequence set, each interpolation curve coordinate point in the above-mentioned interpolation curve coordinate point sequence can be inserted into the above-mentioned coordinate point set; and for each interpolation line coordinate point sequence in the above-mentioned interpolation line coordinate point sequence, each interpolation line coordinate point in the above-mentioned interpolation line coordinate point sequence can be inserted into the above-mentioned coordinate point set to obtain the updated coordinate point set.

[0090] The fifth step is to generate an updated geographic data file based on the updated coordinate point set.

[0091] Steps 1 through 5, as well as their related content, constitute an inventive feature of the embodiments of the present disclosure and address the aforementioned technical issue of "impacting construction accuracy and efficiency in road construction and maintenance." Factors contributing to this technical issue are often as follows: Due to errors in road data collection equipment or sensor data loss, coordinate points in geographic data files often exhibit significant gaps, leading to missing road route data. Addressing these factors can improve the accuracy and efficiency of road construction and maintenance. To achieve this, the distance between each coordinate point greater than a preset threshold must be determined and the corresponding two preceding and succeeding coordinate points must be found. Next, different interpolation methods are employed based on straight and curved coordinate points to ensure smooth and accurate transition points are generated where data is missing, avoiding inaccuracies caused by data jumps or sudden changes. A dynamic step size determination method is employed to reduce the deviations caused by a single step size. This improves the accuracy of road construction, thereby effectively enhancing construction quality. By ensuring the integrity and smoothness of coordinate data, construction teams can plan and construct based on more accurate routes, reducing construction delays, repeated revisions, and replanning due to data errors or missing data, significantly improving construction efficiency.

[0092] The above-described various embodiments of the present disclosure have the following beneficial effects: The road route stake location method based on geographic data files, as described in some embodiments of the present disclosure, can reduce road construction errors. Specifically, increased road construction errors are caused by not considering elevation differences in the road and failing to adapt to curves and slopes in complex road routes, which can lead to inaccurate stake location. Based on this, the road route stake location method based on geographic data files in some embodiments of the present disclosure first obtains geographic data information corresponding to the file upload instruction in response to receiving a file upload instruction initiated by a user, and then stores the geographic data information. The geographic data information includes route name information, starting stake distance, ending stake distance, and geographic data file. By caching the user-uploaded file, the response time of subsequent positioning can be shortened. Second, a set of coordinate points contained in the geographic data file is determined. Thus, the coordinate data of the road route can be obtained from the geographic data file. Then, a set of sub-segment lengths for the route is generated based on the distance between each two adjacent coordinate points in the coordinate point set. Based on the above coordinate point set, the road is divided into multiple sub-segments, and the length of each sub-segment is accurately calculated, avoiding errors caused by curves and slope changes in the road. Subsequently, in response to receiving the user-inputted distance of the pile number to be located, the along-route distance value between the distance of the pile number to be located and the distance of the starting pile number is determined. Next, based on the above segment-by-segment length set and the above along-route distance values, the coordinates of the pile number to be located are generated. Using this segment-by-segment length set and the along-route distance values, the actual coordinates of the pile number in complex road morphology can be accurately calculated. Finally, based on the coordinates of the pile number to be located, a rectangular box diagram is generated and superimposed on the above-mentioned geographic data file. This allows the specific location of the pile number to be intuitively presented on a visual interface, helping construction personnel accurately identify the pile number location and reducing errors during actual construction.

[0093] Further references Figure 4 As an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of a road route pile number positioning device based on a geographic data file. These device embodiments are similar to Figure 1 Corresponding to the method embodiments shown, the device can be specifically applied to various electronic devices.

[0094] like Figure 4 As shown, in some embodiments, a road route pile number positioning device 400 based on a geographic data file includes: an acquisition unit 401 , a first determination unit 402 , a first generation unit 403 , a second determination unit 404 , a second generation unit 405 , and a third generation unit 406 . The acquisition unit 401 is configured to, in response to receiving a file upload instruction initiated by a user, acquire geographic data information corresponding to the file upload instruction and store the geographic data information, wherein the geographic data information includes route name information, starting point pile distance, end point pile distance, and geographic data file; the first determination unit 402 is configured to determine a coordinate point set contained in the geographic data file; the first generation unit 403 is configured to generate a set of route segment-by-segment lengths based on the distance between every two adjacent coordinate points in the coordinate point set; the second determination unit 404 is configured to, in response to receiving a to-be-located pile distance input by the user, determine an along-route distance value between the to-be-located pile distance and the starting point pile distance; the second generation unit 405 is configured to generate the to-be-located pile coordinates based on the to-be-located pile coordinates and the along-route distance value; the third generation unit 406 is configured to generate a rectangular frame diagram based on the to-be-located pile coordinates, and to superimpose and display the rectangular frame diagram and the geographic data file.

[0095] It is understood that the units described in the device 400 are similar to those in the reference Figure 1 Therefore, the operations, features and beneficial effects described above for the method are also applicable to the device 400 and the units included therein, and will not be repeated here.

[0096] Reference below Figure 5 , which shows a structural schematic diagram of an electronic device (eg, a computing device) 500 suitable for implementing some embodiments of the present disclosure. Figure 5 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0097] like Figure 5 As shown, the electronic device 500 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory 502 or a program loaded from a storage device 508 into a random access memory 503. Various programs and data required for the operation of the electronic device 500 are also stored in the random access memory 503. The processing device 501, the read-only memory 502, and the random access memory 503 are connected to each other via a bus 504. An input / output interface 505 is also connected to the bus 504.

[0098] Typically, the following devices may be connected to the I / O interface 505: an input device 506 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 508 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 509. The communication device 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 5 The electronic device 500 is shown with various devices, but it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed instead. Figure 5 Each block shown in the figure may represent one device, or may represent multiple devices as needed.

[0099] In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program carried on a computer-readable medium, the computer program comprising program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from a network via the communication device 509, or installed from the storage device 508, or installed from the read-only memory 502. When the computer program is executed by the processing device 501, the above-mentioned functions defined in the method of some embodiments of the present disclosure are performed.

[0100] It should be noted that the computer-readable medium described in some embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In some embodiments of the present disclosure, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, device, or device. In some embodiments of the present disclosure, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium may be transmitted using any suitable medium, including but not limited to wires, optical cables, RF (radio frequency), etc., or any suitable combination thereof.

[0101] In some embodiments, the client and server can communicate using any currently known or future developed network protocol, such as HTTP (Hypertext Transfer Protocol), and can be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0102] The computer-readable medium may be included in the electronic device, or may exist independently and not be incorporated into the electronic device. The computer-readable medium carries one or more programs. When executed by the electronic device, the electronic device: in response to receiving a file upload instruction initiated by a user, obtains geographic data information corresponding to the file upload instruction, and stores the geographic data information, wherein the geographic data information includes route name information, starting point pile distance, end point pile distance, and a geographic data file; determines a set of coordinate points included in the geographic data file; generates a set of lengths of sub-segments of the route based on the distance between each two adjacent coordinate points in the set of coordinate points; in response to receiving a to-be-located pile distance input by the user, determines the along-route distance between the to-be-located pile distance and the starting point pile distance; generates the to-be-located pile coordinates based on the set of sub-segments of the route and the along-route distance; generates a rectangular block diagram based on the to-be-located pile coordinates, and displays the rectangular block diagram superimposed on the geographic data file.

[0103] Computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages, or a combination thereof, including object-oriented programming languages such as Java, Smalltalk, C++, and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0104] The flowcharts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, program segment, or a part of code, and the module, program segment, or a part of code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order than that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of the boxes in the block diagram and / or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0105] The units described in some embodiments of the present disclosure may be implemented in software or hardware. The units described may also be provided in a processor. For example, they may be described as follows: a processor includes an acquisition unit, a first determination unit, a first generation unit, a second determination unit, a second generation unit, and a third generation unit. The names of these units do not, in some cases, limit the units themselves. For example, the acquisition unit may also be described as a "unit for acquiring geographic data information corresponding to a file upload instruction."

[0106] The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, and without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip (SOCs), complex programmable logic devices (CPLDs), and the like.

[0107] The above description is only an illustration of some preferred embodiments of the present disclosure and the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by the specific combination of the above-mentioned technical features, but should also cover other technical solutions formed by any combination of the above-mentioned technical features or their equivalent features without departing from the above-mentioned inventive concept. For example, the above-mentioned features are replaced with (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure.< / coordinates> < / linestring>

Claims

1. A road route stake number positioning method based on a geographic data file, comprising: In response to receiving a file upload instruction initiated by a user, obtaining geographic data information corresponding to the file upload instruction, and storing the geographic data information, wherein the geographic data information includes route name information, starting point pile number distance, ending point pile number distance, and geographic data file; Determining a set of coordinate points contained in the geographic data file; Generating a set of sub-segment lengths of the route segment by segment according to the distance between every two adjacent coordinate points in the coordinate point set; In response to receiving the to-be-positioned stake distance input by the user, determining a distance along the route between the to-be-positioned stake distance and the starting stake distance; Generate the coordinates of the stake number to be located according to the segment length set of each segment of the route and the distance value along the route; A rectangular frame diagram is generated according to the coordinates of the stake number to be located, and the rectangular frame diagram and the geographic data file are superimposed and displayed.

2. The method according to claim 1, wherein The step of obtaining geographic data information corresponding to the file upload instruction in response to receiving the file upload instruction initiated by the user, and storing the geographic data information includes: Receive file upload instructions initiated by users through the preset file upload window; In response to receiving a file upload instruction initiated by a user, obtaining geographic data information corresponding to the file upload instruction through a preset file upload component; The geographic data information is stored in a preset project platform server.

3. The method according to claim 1, wherein The step of generating a set of sub-segment lengths of the route according to the distance between every two adjacent coordinate points in the coordinate point set includes: For every two adjacent coordinate points in the coordinate point set, determining the coordinate point distance corresponding to the two adjacent coordinate points to obtain a coordinate point distance set; For each coordinate point in the coordinate point set, perform the following steps: In response to determining that the coordinate point is the first coordinate point in the coordinate point set, determining the starting point stake distance as the length of the route segment-by-segment sub-line corresponding to the coordinate point; In response to determining that the coordinate point is not the first coordinate point corresponding to the coordinate point set, determining the sum of the starting point stake distance and the distances to each coordinate point in the coordinate point distance set corresponding to the coordinate point as the segment-by-segment length of the route corresponding to the coordinate point; The determined lengths of the route segment-by-segment sub-line segments are determined as a route segment-by-segment sub-line segment length set.

4. The method according to claim 1, wherein The determining, in response to receiving the to-be-positioned stake distance input by the user, a distance along the route between the to-be-positioned stake distance and the starting stake distance, comprises: Obtain the distance of the stake to be positioned input by the user through the preset query window; The difference between the to-be-positioned pile number distance and the starting pile number distance is determined as the along-route distance value.

5. The method according to claim 1, wherein The step of generating the stake coordinates to be located according to the segment length set of each sub-line segment of the route and the distance value along the route includes: For each route segment-by-segment sub-segment length in the route segment-by-segment sub-segment length set, perform the following steps: In response to determining that the along-route distance value is equal to the length of the segment-by-segment sub-line segment of the route, determining the coordinate point corresponding to the length of the segment-by-segment sub-line segment of the route as the stake coordinate to be located; In response to determining that the route segment-by-segment sub-segment length is greater than the along-route distance value, performing the following steps: Determine the difference between the length of the route segment-by-segment sub-line segment and the along-route distance value as the excess distance value; Determine the coordinate points corresponding to the lengths of the sub-segments of the route as the upper bound coordinates of the stake number to be positioned; Determine the coordinate point corresponding to the previous route segment-by-segment length corresponding to the route segment-by-segment length as the lower boundary coordinate of the stake number to be positioned; The coordinates of the pile number to be positioned corresponding to the distance of the pile number to be positioned are generated according to the exceeding distance value, the upper boundary coordinates of the pile number to be positioned and the lower boundary coordinates of the pile number to be positioned.

6. The method according to claim 5, wherein: The generating of a rectangular frame diagram according to the coordinates of the stake number to be located, and superimposing and displaying the rectangular frame diagram and the geographic data file, includes: Performing graphic rendering on the geographic data file to obtain a geographic data image; Generate a normal vector of a rectangular plane according to the upper boundary coordinates of the pile number to be located and the lower boundary coordinates of the pile number to be located; Generate a rectangular frame image according to the rectangular plane normal vector; The rectangular frame diagram is superimposed on the geographic data image to obtain positioning pile number visualization information, and the positioning pile number visualization information is displayed.

7. A road route pile number positioning device based on a geographic data file, comprising: an acquiring unit configured to, in response to receiving a file upload instruction initiated by a user, acquire geographic data information corresponding to the file upload instruction and store the geographic data information, wherein the geographic data information includes route name information, starting pile number distance, ending pile number distance, and geographic data file; A first determining unit is configured to determine a coordinate point set included in the geographic data file; A first generating unit is configured to generate a set of lengths of route sub-segments according to the distance between every two adjacent coordinate points in the coordinate point set; A second determining unit is configured to determine, in response to receiving a to-be-positioned stake distance input by a user, a distance along the route between the to-be-positioned stake distance and the starting stake distance; A second generating unit is configured to generate the to-be-located stake coordinates according to the segment-by-segment length set of the route and the distance value along the route; The third generating unit is configured to generate a rectangular frame diagram according to the coordinates of the stake number to be located, and to overlay and display the rectangular frame diagram and the geographic data file.

8. An electronic device comprising: one or more processors; a storage device having one or more programs stored thereon; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 6.

9. A computer-readable medium having a computer program stored thereon, wherein: When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images