Search method and device for intersection points of survey grids in leveling of aerogravity anomaly cutting lines

Abstract

Embodiments of the present disclosure disclose a method, apparatus, and electronic device for searching for intersection points of a measurement network in leveling of an airborne gravity anomaly cutting line. A specific implementation manner of the method includes: loading measurement network data, judging and reading measurement line and cutting line data; calculating the position of an approximate intersection point of the measurement line and the cutting line; judging whether the measurement line and the cutting line actually intersect through the position coordinates of the approximate intersection point; if they actually intersect, searching for and calculating the position of the intersection point, calculating the gravity field difference at the intersection point, and caching the information of the position of the intersection point and the gravity field difference. Thereby, a new method for searching for intersection points of a measurement network in leveling of an airborne gravity anomaly cutting line is provided.

Description

Technical Field

[0001] The present disclosure relates to the field of airborne gravity measurement, and particularly to a method and device for searching for intersection points of survey networks in the leveling of cutting lines of airborne gravity anomalies. Background Art

[0002] Airborne gravity measurement collects airborne gravity anomaly data on the flight trajectory of an aircraft through an airborne gravimeter and a global navigation satellite system.

[0003] Before using the collected airborne gravity data, it is necessary to perform leveling processing of the cutting line on the data based on the potential field difference at the intersection of the survey line and the cutting line in the survey network, so as to compensate for the random horizontal errors mainly caused by positioning errors, flight altitude changes, etc.

[0004] Due to the actual flight situation of the aircraft, affected by factors such as airflows and terrain, the flight track is not a completely regular straight line. Therefore, quickly and accurately locating all the intersection points of the survey lines and the cutting lines in the survey network is a very important part of the leveling of the cutting line of airborne gravity anomalies.

[0005] In related technologies, the commonly used methods for searching for intersection points of the leveling survey network of airborne gravity anomaly data cutting lines are traversal search method, jump search method, polynomial fitting method, etc. These methods are either inefficient for large survey networks or have insufficient applicability and accuracy for irregular survey networks and survey networks with segmented connection situations of survey lines or cutting lines. Summary of the Invention

[0006] This part of the disclosure content is provided to introduce concepts in a brief form, and these concepts will be described in detail in the subsequent detailed implementation part. This part of the disclosure content is not intended to identify the key features or essential features of the claimed technical solution, nor is it intended to limit the scope of the claimed technical solution.

[0007] In a first aspect, an embodiment of the present disclosure provides a method for searching for intersection points of a survey network in the leveling of a cutting line of an airborne gravity anomaly. The method includes: loading survey network data, judging and reading survey line and cutting line data; calculating the position of an approximate intersection point of the survey line and the cutting line; judging whether the survey line and the cutting line actually intersect through the position coordinates of the approximate intersection point; if they actually intersect, searching for and calculating the position of the intersection point, calculating the gravity field difference at the intersection point, and caching the position of the intersection point and the gravity field difference information.

[0008] In a second aspect, an embodiment of the present disclosure provides an electronic device, including: one or more processors; a storage device for storing one or more programs, and when the one or more programs are executed by the one or more processors, enabling the one or more processors to implement the method for searching for intersection points of a survey network in the leveling of a cutting line of an airborne gravity anomaly as described in the first aspect. Description of the Drawings

[0009] In combination with the accompanying drawings and with reference to the following specific embodiments, the above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic and the original components and elements are not necessarily drawn to scale.

[0010] Figure 1 is a flowchart of an embodiment of a method for searching for the intersection points of a measurement network in the leveling of an airborne gravity anomaly cutting line according to the present disclosure;

[0011] Figure 2 is a flowchart of an implementation manner of a method for searching for the intersection points of a measurement network in the leveling of an airborne gravity anomaly cutting line according to the present disclosure;

[0012] Figure 3 is a schematic flowchart of a method for quickly locating and searching for the intersection points of a measurement network in the leveling of an airborne gravity anomaly cutting line;

[0013] Figure 4 is a flowchart of calculating the actual intersection points in the method for quickly locating and searching for intersection points;

[0014] Figure 5 is a schematic diagram of calculating the intersection points of the step segments on the measurement line and the step segments on the cutting line and determining whether they are real intersection points;

[0015] Figure 6 is a schematic diagram of the basic structure of an electronic device provided according to an embodiment of the present disclosure. Specific Embodiments

[0016] The embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although some embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. On the contrary, these embodiments are provided to more thoroughly and completely understand the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not used to limit the protection scope of the present disclosure.

[0017] It should be understood that the steps recited in the method embodiments of the present disclosure can be executed in a different order and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this regard.

[0018] As used herein, the term "including" and its variations are open-ended, i.e., "including but not limited to". The term "based on" means "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0019] It should be noted that the concepts such as "first", "second", etc. 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.

[0020] It should be noted that the modification of "one" and "multiple" mentioned in this disclosure is illustrative rather than restrictive. Those skilled in the art should understand that unless otherwise clearly specified in the context, it should be understood as "one or more".

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

[0022] Example 1

[0023] Please refer to Figure 1 , which shows the flow of an embodiment of the method for searching for the intersection points of the survey network in the leveling of the airborne gravity anomaly cutting line according to this disclosure. As Figure 1 shown, the method for searching for the intersection points of the survey network in the leveling of the airborne gravity anomaly cutting line includes the following steps:

[0024] Step 101, load the survey network data, and judge and read the survey line and cutting line data.

[0025] In this embodiment, the execution subject (such as a server and / or a terminal device) of the method for searching for the intersection points of the survey network in the leveling of the airborne gravity anomaly cutting line can load the survey network data, and judge and read the survey line and cutting line data.

[0026] Here, from the loaded survey network information, the data of each line of the survey network can be read, and the cutting line and the survey line can be extracted separately.

[0027] Step 102, calculate the position of the approximate intersection point of the survey line and the cutting line.

[0028] Step 103, judge whether the survey line and the cutting line actually intersect through the position coordinates of the approximate intersection point.

[0029] Step 104, if they actually intersect, search for and calculate the position of the intersection point, calculate the gravity field difference at this intersection point, and cache the position of the intersection point and the information of its gravity field difference.

[0030] It should be noted that the method provided by the embodiment of the present disclosure, by loading the survey network information, uses a double loop to determine in turn whether there is an intersection between each cutting line and each survey line. If so, searches and calculates the intersection position, calculates the gravity field difference at the intersection, caches the intersection position and its gravity field difference information, and finally completes the search for all intersections; it has stronger universality, higher accuracy and efficiency, and can adapt to various irregular aerial gravity survey networks, as well as survey networks with segmented wiring of survey lines and cutting lines.

[0031] In some embodiments, step 102 may include: establishing a first straight line equation using the projection coordinates of the two starting points of the measuring line; establishing a second straight line equation using the projection coordinates of the two starting points of the cutting line; combining the first straight line equation and the second rectangular equation to obtain the intersection point of the two straight lines as the position of the approximate intersection point of the measuring line and the cutting line.

[0032] As an example, the projection plane rectangular coordinates of the starting point and the end point of the survey line are (x ls ,y ls )、(x le ,y le ), establish the first straight line equation of the survey line a1x+b1y+c1=0, and calculate a1=y ls -y le , b1=x le -x ls , c1=x ls y le -x le y ls ; The projection coordinates of the starting point and the end point of the cutting line are (x ts ,y ts )、(x te ,y te ), establish the second straight line equation of the cutting line a2x+b2y+c2=0, and calculate a2=y ts -y te , b2=x te -x ts , c2=x ts y te -x te y ts ; Combine the two straight line equations to find the coordinates of the intersection point of the two straight lines (x I ,y I )for

[0033] In some embodiments, the projection plane rectangular coordinates of the starting point and the end point of the measurement line are respectively (x ls ,y ls )、(x le, y le ), the distance d from the starting point to the ending point lse is The projected coordinates of the starting point and the ending point of the cutting line are (x ts , y ts ), (x te , y te ), the distance d from the starting point to the ending point tse is The approximate intersection point coordinates of the survey line and the cutting line have been obtained as (x I , y I ).

[0034] The above step 103 may include: calculating the distances from the starting point and the ending point of the survey line to the approximate intersection point respectively Then calculating the distances from the starting point and the ending point of the cutting line to the approximate intersection point respectively If d lsI ≤ d lse , d leI ≤ d lse , d tsI ≤ d tse , d teI ≤ d tse are all satisfied, then it is determined that this survey line and this cutting line truly intersect.

[0035] In some embodiments, as Figure 2 shown, the above step 104 may include:

[0036] Step 1041, respectively locate the points on the survey line and the cutting line that are closest to the approximate intersection point of the survey line and the cutting line, as the search starting points for searching for the true intersection point on the corresponding survey line and cutting line.

[0037] Step 1042, take the line segments between every two adjacent measurement points on the survey line and the cutting line as search step line segments. With the two search starting points on the above survey line and cutting line as the centers, determine whether the step line segment adjacent to the search starting point on the survey line and the step line segment adjacent to the search starting point on the cutting line truly intersect.

[0038] Step 1043, if not, respectively on the survey line and the cutting line, starting from their respective search starting points in the direction away from the starting point, sequentially select the step line segments on the survey line and the step line segments on the cutting line, and determine whether they truly intersect until the step line segments on the survey line and the step line segments on the cutting line that truly intersect are found.

[0039] Step 1044, take the intersection point of the truly intersecting step line segment on the survey line and the step line segment on the cutting line as the true intersection point of the survey line and the cutting line, and cache the calculated true intersection point position coordinates and the gravity field difference.

[0040] In some embodiments, step 1041 includes: using the projection coordinates of the point on the survey line and the approximate intersection point to calculate the distance between the point on the survey line and the approximate intersection point; comparing and determining the point on the survey line closest to the approximate intersection point; using the projection coordinates of the point on the cutting line and the approximate intersection point to calculate the distance between the point on the cutting line and the approximate intersection point; comparing and determining the point on the cutting line closest to the approximate intersection point.

[0041] As an example, the method for locating the point on the survey line and the cutting line that is closest to the approximate intersection point includes: calculating the distance between the point on the survey line and the approximate intersection point one by one through the projection coordinates of each point on the survey line and the approximate intersection point, comparing and determining the point on the survey line that is closest to the approximate intersection point, and obtaining the reference point number of the point; calculating the distance between the point on the cutting line and the approximate intersection point one by one through the projection coordinates of each point on the cutting line and the approximate intersection point, comparing and determining the point on the cutting line that is closest to the approximate intersection point, and obtaining the reference point number of the point.

[0042] The stepping line segment is: the line segment between two adjacent measuring points (two measuring points with a reference point number difference of 1) on the measuring line or cutting line is defined as the stepping line segment.

[0043] In some embodiments, the step of determining whether the stepping line segment on the survey line and the stepping line segment on the cutting line truly intersect in step 1042 and step 1043 includes: using the projection coordinates of two adjacent surveying points to establish a third straight line equation of the stepping line segment on the survey line, wherein the stepping line segment on the survey line is a line segment between two adjacent surveying points on the survey line; using the projection coordinates of two adjacent surveying points to establish a fourth straight line equation of the stepping line segment on the cutting line, wherein the stepping line segment on the cutting line is a line segment between two adjacent surveying points on the cutting line; combining the third straight line equation and the fourth straight line equation to obtain the intersection point of the two straight lines; determining whether the position of the intersection point is simultaneously on the corresponding stepping line segment on the survey line and the corresponding stepping line segment on the cutting line; if so, the stepping line segment on the survey line and the stepping line segment on the cutting line truly intersect.

[0044] As an example, the step of determining whether the stepping line segment on the measuring line actually intersects with the stepping line segment on the cutting line includes: the projection coordinates of the two end points of the stepping line segment on the measuring line are respectively (x l1 ,y l1 )、(x l2 ,y l2 ), establish the straight line equation a of the step line segment on the survey line l x+b l y+c l =0, and we get a l =y l1 -y l2 , b l =xl2 -x l1 ,c l =x l1 y l2 -x l2 y l1 ; The projection coordinates of the two endpoints of the stepping segment on the cutting line are (x t1 , y t1 ), (x t2 , y t2 ). Establish the linear equation ax t +by t +c t =0 of the stepping segment on this cutting line, and calculate to get a t =y t1 -y t2 , b t =x t2 -x t1 , c t =x t1 y t2 -x t2 y t1 ; Solve the coordinates (x int , y int ) of the intersection point of the two stepping segments by simultaneously solving the two linear equations as ); The distance d ls between the two endpoints of the stepping segment on the measuring line is The distance d ts between the two endpoints of the stepping segment on the cutting line is Calculate the distances from the two endpoints of the stepping segment on the measuring line to the intersection point respectively Then calculate the distances from the two endpoints of the stepping segment on the cutting line to the intersection point respectively If d li1 ≤d ls , d li2 ≤d ls , d ti ≤d ts , d ti ≤d ts are all satisfied, then the intersection point of the straight line where the stepping segment on the measuring line is located and the straight line where the stepping segment on the cutting line is located is on these two stepping segments, and these two stepping segments truly intersect.

[0045] In some embodiments, in the step of determining whether the step segments on the measurement line and the step segments on the cutting line truly intersect, the determination of whether the intersection point is simultaneously on the corresponding step segment on the measurement line and the corresponding step segment on the cutting line includes: using the projection coordinates of the two endpoints of the first line segment and the intersection point to calculate the distances from the two endpoints to the intersection point respectively; using the projection coordinates of the two endpoints of the first line segment to calculate the length of the first line segment; using the projection coordinates of the two endpoints of the second line segment and the intersection point to calculate the distances from the two endpoints to the intersection point respectively; using the projection coordinates of the two endpoints of the second line segment to calculate the length of the second line segment; if both are satisfied, that is, the distances from the two endpoints of the first line segment to the intersection point are both less than or equal to the length of the first line segment, and the distances from the two endpoints of the second line segment to the intersection point are both less than or equal to the length of the second line segment, then the intersection point of the two straight lines where the two line segments are located is simultaneously on the two line segments.

[0046] As an example, the method for determining whether the intersection point of two line segments is simultaneously on the two line segments is: using the projection coordinates of the two endpoints of line segment 1 and the intersection point to calculate the distances from the two endpoints to the intersection point respectively; using the projection coordinates of the two endpoints of line segment 1 to calculate the length of line segment 1; using the projection coordinates of the two endpoints of line segment 2 and the intersection point to calculate the distances from the two endpoints to the intersection point respectively; using the projection coordinates of the two endpoints of line segment 2 to calculate the length of line segment 2; if both are satisfied, that is, the distances from the two endpoints of line segment 1 to the intersection point are both less than or equal to the length of line segment 1, and the distances from the two endpoints of line segment 2 to the intersection point are both less than or equal to the length of line segment 2, then the intersection point of the two straight lines where the two line segments are located is simultaneously on the two line segments, and the two line segments truly intersect.

[0047] In some embodiments, on the measurement line and the cutting line respectively, starting from their respective search starting points in the direction away from the starting points, successively select the step segments on the measurement line and the step segments on the cutting line, and determine whether they truly intersect until the step segments on the measurement line and the step segments on the cutting line that truly intersect are found, including: the reference point number of the search starting point on the line is lc, and the reference point number of the search starting point on the cutting line is tc; use the reference point numbers S of the two endpoints of the step segment (a、b) to represent the step segment; in the first stage, select the step segments S (lc-1、lc) and S (lc、lc+1) on the measurement line that are adjacent to the search starting point on the measurement line, and successively determine whether they truly intersect with the step segments S (tc-1、tc) S (tc、tc+1) on the cutting line that are adjacent to the search starting point on the cutting line, one group of two step segments at a time; if none of them truly intersect, enter the second stage: select the step segments S (lc-2、lc-1) and S (lc+1、lc+2) on the measurement line that are one step segment away from the search starting point on the measurement line in the direction away from the starting point, respectively and successively with the step segments S within 1 step segment from the starting point of the search on the cutting line along the cutting line (tc-2、tc-1) 、S (tc-1、tc) 、S (tc、tc+1) 、S (tc+、tc+2) , judge whether two step segments in a group really intersect, and select the step segment S on the cutting line that is 1 step segment away from the starting point of the search on the cutting line in the direction away from the starting point (tc-2、tc-1) 、S (tc+1、tc+) , respectively and successively with the step segments S adjacent to the starting point of the search on the measuring line on the measuring line (lc-1、lc) 、S (lc、lc+1) judge whether two step segments in a group really intersect; if none of them really intersect, enter the third stage: select the step segment S on the measuring line that is 2 step segments away from the starting point of the search on the measuring line in the direction away from the starting point (lc-3、lc-2) 、S (lc+2、lc+3) , respectively and successively with the step segments S within 2 step segments from the starting point of the search on the cutting line along the cutting line (tc-3、tc-2) 、S (tc-2、tc-1) 、S (tc-1、tc) 、S (tc、tc+) 、S (tc+1、tc+2) 、S (tc+2、tc+3) , judge whether two step segments in a group really intersect, and select the step segment S on the cutting line that is 2 step segments away from the starting point of the search on the cutting line in the direction away from the starting point, that is, S (tc-3、tc-2) 、S (tc+、tc+) , respectively and successively with the step segments S within 1 step segment from the starting point of the search on the measuring line along the measuring line (lc-2、lc-1) 、S (lc-1、lc) 、S (lc、lc+1) 、S (lc+1、lc+2) judge whether two step segments in a group really intersect; if none of them really intersect, and so on, if entering the nth stage: select the step segment S on the measuring line that is n - 1 step segments away from the starting point of the search on the measuring line in the direction away from the starting point, that is, S (lc-n、lc-n+) 、S (lc+n-1、lc+n) , respectively and successively with the step segments S within n - 1 step segments from the starting point of the search on the cutting line along the cutting line (tc-n、tc-n+1) 、S (tc-n+1、tc-n+2) 、……、S (tc+n-2、tc+n-1) 、S (tc+n-1、tc+n) 、S (tc+2、tc+3) , judge whether two step segments in a group really intersect, and select the step segment S on the cutting line that is n - 1 step segments away from the starting point of the search on the cutting line in the direction away from the starting point (tc-n、tc-n+1) 、S (tc+n-1、tc+n), respectively and successively with the step segments S within n - 2 step segments away from the search starting point on the survey line (lc-n+1、lc-n+2) 、S (lc-n+2、lc-n+3) 、……、S (lc+n-3、lc+n-2) 、S (lc+n-2、lc+n-1) Judge whether they truly intersect in groups of two step segments until the step segment on the survey line that truly intersects and the step segment on the cutting line are found.

[0048] Example 2

[0049] As Figure 3 shown, a method for quickly locating and searching the intersection points of a survey network in the leveling of an airborne gravity anomaly cutting line. First, load the survey network information, and use a double loop to successively judge whether there are intersection points between each cutting line and each survey line; if there are, search and calculate the position of the intersection point, calculate the gravity field difference at this intersection point, cache the position of the intersection point and its gravity field difference information, and finally complete the search for all intersection points.

[0050] The step of loading the survey network information is to read the data of each line of the survey network and extract the cutting lines and survey lines respectively.

[0051] The method for judging whether there are intersection points between the cutting line and the survey line is: calculate the position of the approximate intersection point of the survey line and the cutting line, and judge whether this survey line and this cutting line truly intersect through the position coordinates of the approximate intersection point, and there are intersection points.

[0052] The method for calculating the position of the approximate intersection point of the survey line and the cutting line is: the projected plane rectangular coordinates of the starting point and the ending point of the survey line are (x ls 、y ls ), (x le 、y le ), establish the straight line equation a1x + b1y + c1 = 0 of this survey line, and calculate to get a1 = y ls - y le , b1 = x le - x ls , c1 = x ls y le - x le y ls ; the projected coordinates of the starting point and the ending point of the cutting line are (x ts 、y ts ), (x te 、y te ), establish the straight line equation a2x + b2y + c2 = 0 of this cutting line, and calculate to get a2 = y ts - y te , b2 = x te - x ts , c2 = x ts yte -x te y ts ; By simultaneously solving two linear equations, the coordinates of the intersection point of the two lines (x I and y I ) are

[0053] The method for determining whether the survey line and the cutting line truly intersect and have an intersection point is as follows: The projected plane rectangular coordinates of the starting point and the ending point of the survey line are respectively (x ls and y ls ), (x le and y le ). The distance d lse from the starting point to the ending point is The projected coordinates of the starting point and the ending point of the cutting line are respectively (x ts and y ts ), (x te and y te ). The distance d tse from the starting point to the ending point is The approximate intersection point coordinates of the survey line and the cutting line have been obtained as (x I and y I ). Calculate the distances from the starting point and the ending point of the survey line to the approximate intersection point respectively Then calculate the distances from the starting point and the ending point of the cutting line to the approximate intersection point respectively If d lsI ≤ d lse , d leI ≤ d lse , d tsI ≤ d tse , and d teI ≤ d tse are simultaneously satisfied, then it is determined that this survey line and this cutting line truly intersect and there is an intersection point.

[0054] The method for calculating the position of the intersection point of the measurement line and the cutting line includes: respectively locating the points on the measurement line and the cutting line that are closest to the approximate intersection point of the measurement line and the cutting line, and caching the reference point numbers of these two points in a group, respectively serving as the starting points for searching for the true intersection point on the corresponding measurement line and cutting line; taking the line segments between every two adjacent measurement points (the reference point numbers of the two measurement points differ by 1) on the measurement line and the cutting line as the search step line segments, and taking the two search starting points on the measurement line and the cutting line as the centers, judging whether the step line segment adjacent to the search starting point on the measurement line and the step line segment adjacent to the search starting point on the cutting line truly intersect; if not, respectively on the measurement line and the cutting line, starting from their respective search starting points and moving in the direction away from the starting point, gradually select the step line segments on the measurement line and the step line segments on the cutting line to judge whether they truly intersect until the step line segments on the measurement line and the step line segments on the cutting line that truly intersect are found; the intersection point of the truly intersecting step line segments on the measurement line and the cutting line is the true intersection point of the measurement line and the cutting line, and cache the calculated position coordinates of the true intersection point and the gravity field difference.

[0055] The method for locating the point on the measurement line and the cutting line that is closest to the approximate intersection point includes: respectively calculating the distances between the points on the measurement line and the approximate intersection point through the projection coordinates of each point on the measurement line and the approximate intersection point, comparing and determining the point on the measurement line that is closest to the approximate intersection point, and obtaining the reference point number of this point; respectively calculating the distances between the points on the cutting line and the approximate intersection point through the projection coordinates of each point on the cutting line and the approximate intersection point, comparing and determining the point on the cutting line that is closest to the approximate intersection point, and obtaining the reference point number of this point.

[0056] The step line segment is defined as: the line segment between two adjacent measurement points (two measurement points with a difference of 1 in reference point number) on the measurement line or the cutting line.

[0057] The method for judging whether the step line segment on the measurement line and the step line segment on the cutting line truly intersect is: the projection coordinates of the two endpoints of the step line segment on the measurement line are respectively (x l1 、y l1 ), (x l2 、y l2 ), establish the straight line equation a l x + b l y + c l =0 of this step line segment on the measurement line, calculate to obtain a l =y l1 -y l2 , b l =x l2 -x l1 , c l =x l1 y l2 -x l2 yl1 ; The projection coordinates of the two end points of the step line segment on the cutting line are (x t1 ,y t1 )、(x t2 ,y t2 ), establish the straight line equation a of the step line segment on the cutting line t x+b t y+c t =0, and we get a t =y t1 -y t2 , b t =x t2 -x t1 , c t =x t1 y t2 -x t2 y t1 ; Combine the two straight line equations to obtain the coordinates of the intersection point of the two step line segments (x int ,y int )for The distance d between the two end points of the step line segment on the survey line ls for The distance d between the two end points of the step line segment on the cutting line ts for Calculate the distances from the two endpoints of the step line segment on the survey line to the intersection point respectively Then calculate the distance from the two endpoints of the step line segment on the cutting line to the intersection point If both d li1 ≤d ls ,d li2 ≤d ls ,d ti1 ≤d ts ,d ti2 ≤d ts , then the intersection point of the straight line where the step line segment on the measuring line is located and the straight line where the step line segment on the cutting line is located is on the two step line segments, and the two step line segments truly intersect.

[0058] Stepping line segments on the selected survey line and the selected stepping line segments on the cutting line are respectively stepped from their respective search starting points toward the direction away from the starting points until two truly intersecting stepping line segments (a stepping line segment on a survey line and a stepping line segment on a cutting line) are found, i.e., step 1044, including: the reference point number of the search starting point on the survey line is lc, and the reference point number of the search starting point on the cutting line is tc; the reference point numbers of the two end points of the stepping line segment are used to represent the stepping line segment, for example, if the reference point numbers of the two end points of the stepping line segment are a and b respectively, then S is used. (a、b)to represent the step segment; the first stage is to select the step segment on the survey line that is adjacent to the search starting point on the survey line (i.e., S (lc-1、lc) 、S (lc、lc+1) ), and respectively and sequentially compare them with the step segments on the cutting line that are adjacent to the search starting point on the cutting line (i.e., S (tc-1、tc) 、S (tc、tc+1) ). One group consists of two step segments (it must be a step segment on the survey line and a step segment on the cutting line forming a group) to determine whether they truly intersect; if none of them truly intersect, enter the second stage. Select the step segments on the survey line that are one step segment away from the search starting point on the survey line in the direction away from the starting point (including leaving in the reverse direction and the positive direction) (i.e., S (lc-2、lc-1) 、S (lc+、lc+) ), and respectively and sequentially compare them with the step segments on the cutting line that are within one step segment (including the step segment adjacent to the search starting point on the cutting line) away from the search starting point on the cutting line (i.e., S (tc-2、tc-1) 、S (tc-1、tc) 、S (tc、tc+1) 、S (tc+1、tc+2) ). One group consists of two step segments (it must be a step segment on the survey line and a step segment on the cutting line forming a group) to determine whether they truly intersect, and select the step segments on the cutting line that are one step segment away from the search starting point on the cutting line in the direction away from the starting point (including leaving in the reverse direction and the positive direction) (i.e., S (tc-2、tc-1) 、S (tc+1、tc+2) ), and respectively and sequentially compare them with the step segments on the survey line that are adjacent to the search starting point on the survey line (i.e., S (lc-1、lc) 、S (lc、lc+1) ). One group consists of two step segments (it must be a step segment on the survey line and a step segment on the cutting line forming a group) to determine whether they truly intersect; if none of them truly intersect, enter the third stage. Select the step segments on the survey line that are two step segments away from the search starting point on the survey line in the direction away from the starting point (including leaving in the reverse direction and the positive direction) (i.e., S (lc-3、lc-2) 、S (lc+2、lc+3) ), and respectively and sequentially compare them with the step segments on the cutting line that are within two step segments away from the search starting point on the cutting line (i.e., S (tc-3、tc-2) 、S (tc-2、tc-1) 、S (tc-1、tc) 、S (tc、tc+1) 、S (tc+1、tc+2) 、S (tc+、tc+3) ). One group consists of two step segments (it must be a step segment on the survey line and a step segment on the cutting line forming a group) to determine whether they truly intersect, and select the step segments on the cutting line that are two step segments away from the search starting point on the cutting line in the direction away from the starting point (including leaving in the reverse direction and the positive direction) (i.e., S (tc-3、tc-2) 、S(tc+、tc+3) ), respectively and successively with the stepping segments within 1 stepping segment from the search starting point on the survey line on the survey line (i.e., S (lc-2、lc-1) 、S (lc-1、lc) 、S (lc、lc+1) 、S (lc+1、lc+2) ), judge whether they really intersect in groups of two stepping segments (it must be a group composed of a stepping segment on the survey line and a stepping segment on the cutting line); if they do not really intersect, and so on. If entering the nth stage, select the stepping segment on the survey line from the search starting point on the survey line in the direction away from the starting point (including leaving in the reverse direction and the positive direction), and separated from the starting point by n - 1 stepping segments (i.e., S (lc-n、lc-n+1) 、S (lc+n-1、lc+n) ), respectively and successively with the stepping segments within n - 1 stepping segments from the search starting point on the cutting line on the cutting line (i.e., S (tc-n、tc-n+1) 、S (tc-n+1、tc-n+2) 、……、S (tc+n-2、tc+n-1) 、S (tc+n-1、tc+n) 、S (tc+2、tc+3) ), judge whether they really intersect in groups of two stepping segments (it must be a group composed of a stepping segment on the survey line and a stepping segment on the cutting line), and select the stepping segment on the cutting line from the search starting point on the cutting line in the direction away from the starting point (including leaving in the reverse direction and the positive direction), and separated from the starting point by n - 1 stepping segments (i.e., S (tc-n、tc-n+) 、S (tc+n-1、tc+n) ), respectively and successively with the stepping segments within n - 2 stepping segments from the search starting point on the survey line on the survey line (i.e., S (lc-n+1、lc-n+2) 、S (lc-n+2、lc-n+3) 、……、S (lc+n-3、lc+n-2) 、S (lc+n-2、lc+n-1) ), judge whether they really intersect in groups of two stepping segments (it must be a group composed of a stepping segment on the survey line and a stepping segment on the cutting line) until the stepping segment on the survey line and the stepping segment on the cutting line that really intersect are found.

[0059] Example 3

[0060] This embodiment can be programmed in any programming language (such as C++) to implement the method for quickly locating and searching the intersection points of the survey network in the leveling of the airborne gravity anomaly cutting line described in Embodiment 1 and / or Embodiment 2, and is successfully compiled and debugged based on a software platform (such as Visual Studio 2013).

[0061] Establish a data type of a survey line class for loading survey line - related information. The survey line - related information includes: survey line type (survey line or cutting line), survey line (cutting line) number, data information group name, number of survey points, survey point position information (projection coordinates: east - ward distance X, north - ward distance Y), and field value of the survey point.

[0062] Design and calculate the function for the position coordinates of the intersection point of two line segments and the function for judging whether two line segments actually intersect.

[0063] The function for calculating the position coordinates of the intersection point of two line segments is GetIntersection(). The input parameters of this function are the projection coordinates of the two endpoints of the first line segment and the projection coordinates of the two endpoints of the second line segment, and it returns the projection coordinates of the intersection point of the two lines where the two line segments are located.

[0064] The function for judging whether two line segments actually intersect is TrueIntersection(). The input parameters of this function are the projection coordinates of the two endpoints of the first line segment, the projection coordinates of the two endpoints of the second line segment, and the projection coordinates of the intersection point of the two lines where the two line segments are located, and it returns the judgment result.

[0065] Function GetIntersection

[0066] (x s1 , y s1 , x e1 , y e1 , x s2 , y s2 , x e2 , y e2 , x c , y c ) obtains the projection coordinates of the two endpoints of the first line segment as (x s1 , y s1 ), (x e1 , y e1 ) and the projection coordinates of the two endpoints of the second line segment as (x s2 , y s2 ), (x e2 , y e2 ), constructs the equations of the two lines where the two line segments are located as a1x + b1y + c1 = 0, a2x + b2y + c2 = 0, calculates and returns the projection coordinates (x c , y c ) of the intersection point of the two lines where the two line segments are located.

[0067] where a1 = y s1 - y e1 , b1 = x e1 - x s1 , c1 = x s1 y e1 - x e1 y s1 , a2 = y s2 - y e2 , b2 = x e2 - x s2, c2 = x s2 y e2 -x e2 y s2 .

[0068] Function TrueIntersection

[0069] (x s1 , y s1 , x e1 , y e1 , x s2 , y s2 , x e2 , y e2 , x c , y c ) obtains the projected coordinates of the two endpoints of the first line segment as (x s1 , y s1 0, (x e1 , y e1 0, and the projected coordinates of the two endpoints of the second line segment are (x s2 , y s2 ), (x e2 , y e2 ). The projected coordinates (x c , y c ) of the intersection point of the two lines where the two line segments are located. Calculate the distance between the two endpoints of the first line segment The distance from the first endpoint of the first line segment to the intersection point of the two lines where the two line segments are located The distance from the second endpoint of the first line segment to the intersection point of the two lines where the two line segments are located When d 1sc ≤ d1 and d 1ec ≤ d1, it is determined that the intersection point is on the first line segment, otherwise the function returns 0 and exits. Continue to calculate the distance between the two endpoints of the second line segment The distance from the first endpoint of the second line segment to the intersection point of the two lines where the two line segments are located The distance from the second endpoint of the second line segment to the intersection point of the two lines where the two line segments are located When d 2s ≤ d2 and d 2ec ≤ d2, it is determined that the intersection point is also on the second line segment. The intersection point is on both the first line segment and the second line segment. The two line segments truly intersect and there is an intersection point. The function returns 1 and exits, otherwise the function returns 0 and exits.

[0070] Read the survey network data, obtain and cache the information related to the survey line, including the survey line type (survey line or cutting line), survey line number, data information group name, number of survey points, survey point position information (eastward distance X, northward distance Y), and the measured value at the survey point.

[0071] Judge the type of each survey line as a survey line or a cutting line. Cache the survey lines of the survey line type together, count the number of survey lines as lnum, cache the survey lines of the cutting line type together, and count the number of cutting lines as tnum.

[0072] Use a double loop to determine whether there are intersection points between each survey line and each cutting line. The first loop iterates from 1 to lnum, and within the loop, the relevant information of each survey line is read. The second loop iterates from 1 to tnum, and within the loop, the relevant information of each cutting line is read. Then, use the GetIntersection() function to calculate and return the projected coordinates of the approximate intersection point between the current survey line and the cutting line. Next, use TrueIntersection() to make a judgment: if it returns 0, it means that the current survey line and the cutting line do not intersect truly and there is no intersection point, then end the current loop and enter the next loop; if it returns 1, it means that the current survey line and the cutting line intersect truly and there is an intersection point. Then, calculate the distance between each point on the survey line and the projected coordinates of the approximate intersection point one by one, compare and determine the point on the survey line that is closest to the approximate intersection point, and use it as the starting point on the survey line for searching the intersection point. Record the reference point number of this point as l0; calculate the distance between each point on the cutting line and the projected coordinates of the approximate intersection point one by one, compare and determine the point on the cutting line that is closest to the approximate intersection point, and use it as the starting point on the cutting line for searching the intersection point. Record the reference point number of this point as t0. Calculate the differences between the reference point numbers of the start and end points of the survey line and the reference point number of the point on the survey line closest to the approximate intersection point respectively, and then calculate the differences between the reference point numbers of the start and end points of the cutting line and the reference point number of the point on the cutting line closest to the approximate intersection point respectively. Compare and determine the maximum value among these four differences, and record it as m. Further use a triple loop to search for the intersection point position between the current survey line and the cutting line. In the first loop, the loop variable i iterates from 1 to m, which represents that the range of the step segments on the survey line and the step segments on the cutting line selected in the current loop is: on the survey line, from the search starting point in the direction away from that starting point (including leaving in the reverse direction and the positive direction), the step segments within i - 1 step segments away from that starting point (when i = 1, it represents the step segment adjacent to the search starting point on the survey line); on the cutting line, from the search starting point in the direction away from that starting point (including leaving in the reverse direction and the positive direction), the step segments within i - 1 step segments away from that starting point (when i = 1, it represents the step segment adjacent to the search starting point on the cutting line). In the second loop, the loop variable j iterates from -i to i - 1.The third loop, with loop variable k ranging from -i to i - 1. Inside the loop, through the loop variable j of the second loop, sequentially traverse and select the step segments on the survey line from the search starting point in the direction away from the starting point (including leaving in the reverse direction and the positive direction), within i - 1 step segments away from the starting point (when i = 1, it represents the step segment adjacent to the search starting point on the survey line). Then, respectively, through the loop variable k of the third loop, sequentially and each step segment on the cutting line from the search starting point in the direction away from the starting point (including leaving in the reverse direction and the positive direction), within i - 1 step segments away from the starting point (when i = 1, it represents the step segment adjacent to the search starting point on the survey line). Take two step segments as a group (one step segment on the survey line and one step segment on the cutting line) and determine whether they truly intersect. Inside the current loop of the third loop, to avoid duplicate searches for the step segment groups (composed of one step segment on the survey line and one step segment on the cutting line) that have been searched and judged before the current loop, set the judgment condition: when j = -i or j = i - 1 or k = -i or k = i - 1, read the projected coordinates of the two endpoints of the step segment on the survey line in the step segment group selected in the current loop. and the projected coordinates of the two endpoints of the step segment on the cutting line Use the GetIntersection() function to calculate and return the projected coordinates (x is 、y is ) of the intersection point of these two step segments.

[0073]

[0074] Then use TrueIntersection() to judge. If it returns 0, it means that the step segment on the current selected survey line and the step segment on the cutting line do not truly intersect and there is no intersection point. End the current loop and enter the next loop. If it returns 1, it means that the step segment on the current selected survey line and the step segment on the cutting line truly intersect and there is an intersection point. Record the projected coordinates of the intersection point. Interpolate and calculate the field value of this intersection point on the survey line through the projected coordinates of the two measuring points at both ends of the step segment on the survey line where the intersection point is located and the field values at the measuring points. Interpolate and calculate the field value of this intersection point on the cutting line through the projected coordinates of the two measuring points at both ends of the step segment on the cutting line where the intersection point is located and the field values at the measuring points. Calculate and cache the difference between the field value of this intersection point on the survey line and the field value on the cutting line, and jump out of the current triple loop; if it does not satisfy j = -i or j = i - 1 or k = -i or k = i - 1, that is, -i < j < i - 1 and -i < k < i - 1, end the current loop and enter the next loop. After searching for all intersection points, cache and output the intersection point information.

[0075] The following refers to Figure 6, which shows a schematic structural diagram of an electronic device (such as a terminal device or a server) suitable for implementing the embodiments of the present disclosure. The terminal devices in the embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Tablet Computers), PMPs (Portable Multimedia Players), in-vehicle terminals (such as in-vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 6 The electronic device shown is only an example and should not impose any limitations on the functions and usage scope of the embodiments of the present disclosure.

[0076] As Figure 6 shown, the electronic device may include a processing device (such as a central processing unit, a graphics processing unit, etc.) 601, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 602 or the program loaded from the storage device 608 into the random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the electronic device 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604. The input / output (I / O) interface 605 is also connected to the bus 604.

[0077] Generally, the following devices may be connected to the I / O interface 605: an input device 606 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 607 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 608 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 609. The communication device 609 may allow the electronic device to communicate with other devices wirelessly or wiredly to exchange data. Although Figure 6 shows an electronic device having various devices, it should be understood that it is not required to implement or have all the shown devices. More or fewer devices may be alternatively implemented or had.

[0078] Particularly, according to the embodiments of the present disclosure, the process described above with reference to the flowchart may be implemented as a computer software program. For example, the embodiments of the present disclosure include a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program includes program codes for performing the methods shown in the flowchart. In such an embodiment, the computer program may be downloaded and installed from the network through the communication device 609, or installed from the storage device 608, or installed from the ROM 602. When the computer program is executed by the processing device 601, the above-mentioned functions defined in the methods of the embodiments of the present disclosure are executed.

[0079] It should be noted that the computer-readable medium described above in the present disclosure can be a computer-readable signal medium, a computer-readable storage medium, or any combination of the two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of the computer-readable storage medium can 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 the present disclosure, the computer-readable storage medium can be any tangible medium that contains or stores a program, and this program can be used by or in combination with an instruction execution system, apparatus, or device. In the present disclosure, the computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, in which the computer-readable program code is carried. Such a propagated data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer-readable signal medium can also be any computer-readable medium other than the computer-readable storage medium, and this computer-readable signal medium can send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted by any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0080] In some embodiments, the client and the server can communicate using any currently known or future-developed network protocol such as HTTP (HyperText Transfer Protocol), and can be interconnected with digital data communication in any form or medium (for example, a communication network). Examples of communication networks include local area networks (“LAN”), wide area networks (“WAN”), the Internet (for example, the Internet), and end-to-end networks (for example, ad hoc end-to-end networks), as well as any currently known or future-developed networks.

[0081] The above computer-readable medium can be included in the above electronic device; or it can exist separately without being assembled into the electronic device.

[0082] The above computer-readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: load survey network data, determine and read survey line and cutting line data; calculate the position of the approximate intersection point of the survey line and the cutting line; determine whether the survey line and the cutting line truly intersect based on the position coordinates of the approximate intersection point; if they truly intersect, search for and calculate the position of the intersection point, calculate the gravity field difference at the intersection point, and cache the information of the intersection point position and the gravity field difference.

[0083] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages or combinations thereof. The programming languages include, but are not limited to, object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code may execute entirely on the user's computer, partially on the user's computer, execute as a stand-alone software package, execute partially on the user's computer and partially on a remote computer, or execute entirely on the remote computer or server. In the case of 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., by connecting through the Internet using an Internet service provider).

[0084] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagram may represent a module, a program segment, or a part of code that contains one or more executable instructions for implementing the specified logical function. It should also be noted that, in some alternative implementations, the functions marked in the blocks may occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks shown may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and combinations of blocks in the block diagram and / or flowchart, may be implemented by a dedicated hardware-based system for performing the specified functions or operations, or may be implemented by a combination of dedicated hardware and computer instructions.

[0085] The units described in the embodiments of the present disclosure may be implemented in software or in hardware. In some cases, the name of the unit does not constitute a limitation on the unit itself.

[0086] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. By way of example, and without limitation, the 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.

[0087] In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0088] The foregoing description is only a preferred embodiment of the present disclosure and an illustration of the applied technical principles. Those skilled in the art should understand that the scope of the disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above technical features, and should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosure concept. For example, the technical solutions formed by mutually replacing the above features with the technical features (but not limited to) having similar functions disclosed in the present disclosure.

[0089] In addition, although the operations are depicted in a particular order, this should not be construed as requiring that the operations be performed in the particular order shown or in sequential order. In certain environments, multitasking and parallel processing may be advantageous. Likewise, although several specific implementation details are included in the foregoing discussion, these should not be construed as limiting the scope of the present disclosure. Certain features described in the context of separate embodiments may also be implemented combinatorially in a single embodiment. Conversely, the various features described in the context of a single embodiment may also be implemented separately or in any suitable sub-combination in multiple embodiments.

[0090] Although the subject matter has been described in language specific to structural features and / or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. On the contrary, the specific features and acts described above are merely example forms of implementing the claims.

Claims

1. A method for searching intersection points of a measuring network in leveling of an aerial gravity anomaly cutting line, characterized in that: include: Load the measurement network data, determine and read the measurement line and cutting line data; Calculate the position of the approximate intersection of the survey line and the cutting line; By using the position coordinates of the approximate intersection point, it is determined whether the measuring line and the cutting line actually intersect; If there is a true intersection, search and calculate the intersection point, calculate the gravity field difference at the intersection, and cache the intersection point position and gravity field difference information, including: Locate the points closest to the approximate intersection points of the survey line and the cutting line respectively, as the search starting points for searching the real intersection points on the corresponding survey line and the cutting line; The line segment between each two adjacent measuring points on the measuring line and the cutting line is used as the search step line segment, and the two search starting points on the measuring line and the cutting line are taken as the center to determine whether the step line segment adjacent to the search starting point on the measuring line and the step line segment adjacent to the search starting point on the cutting line actually intersect; If not, on the survey line and the cutting line, respectively, from the respective search starting points to the direction away from the starting points, select the stepping line segment and the stepping line segment on the cutting line in turn to determine whether they truly intersect, until the stepping line segment on the survey line and the stepping line segment on the cutting line that truly intersect are found; The intersection point of the stepping line segment on the real intersecting survey line and the stepping line segment on the cutting line is taken as the real intersection point of the survey line and the cutting line, and the calculated real intersection point position coordinates and gravity field difference are cached; The step of locating the points on the measuring line and the cutting line that are closest to the approximate intersection of the measuring line and the cutting line includes: Use the projection coordinates of the point on the survey line and the approximate intersection point to calculate the distance between the point on the survey line and the approximate intersection point; compare and determine the point on the survey line that is closest to the approximate intersection point; Use the projection coordinates of the point on the cutting line and the approximate intersection point to calculate the distance between the point on the cutting line and the approximate intersection point; compare and determine the point on the cutting line that is closest to the approximate intersection point; The step of judging whether the stepping line segment on the measuring line actually intersects with the stepping line segment on the cutting line comprises: Using the projection coordinates of two adjacent measuring points, establish the third straight line equation of the step line segment on the measuring line, wherein the step line segment on the measuring line is the line segment between two adjacent measuring points on the measuring line; Use the projection coordinates of two adjacent measuring points to establish the fourth straight line equation of the step line segment on the cutting line. The step line segment on the cutting line is the line segment between two adjacent measuring points on the cutting line. The third straight line equation and the fourth straight line equation are combined to obtain the intersection point of the two straight lines; determine whether the intersection point is simultaneously on the corresponding step line segment on the measuring line and the corresponding step line segment on the cutting line; If so, the step line segment on the measuring line truly intersects with the step line segment on the cutting line.

2. The method according to claim 1, characterized in that: The calculating the position of the approximate intersection point between the measuring line and the cutting line comprises: Use the projection coordinates of the two starting points of the survey line to establish the equation of the first line; Use the projection coordinates of the two starting points of the cutting line to establish the equation of the second line; The first straight line equation and the second right-angle equation are combined to find the intersection point of the two straight lines, which is used as the approximate intersection point of the measuring line and the cutting line.

3. The method according to claim 1, characterized in that The projection plane rectangular coordinates of the starting point and the end point of the survey line are ( )、( ), the distance from the starting point to the end point for , the projection coordinates of the starting point and the end point of the cutting line are ( )、( ), the distance from the starting point to the end point for , the coordinates of the approximate intersection point between the measuring line and the cutting line have been obtained as ( ); as well as The step of judging whether the measuring line and the cutting line actually intersect by using the position coordinates of the approximate intersection point includes: Calculate the distance from the starting point and end point of the survey line to the approximate intersection point respectively , , and then calculate the distance from the starting point and end point of the cutting line to the approximate intersection point , , if both satisfy , , , , then it is determined that the measuring line and the cutting line truly intersect.

4. The method according to claim 1, characterized in that: The step of judging whether the intersection point is located on both the stepping line segment corresponding to the measuring line and the stepping line segment corresponding to the cutting line comprises: Use the projection coordinates of the two endpoints of the first line segment and the intersection point to calculate the distances from the two endpoints to the intersection point respectively; Using the projection coordinates of the two endpoints of the first line segment, calculate the length of the first line segment; Use the projection coordinates of the two endpoints of the second line segment and the intersection point to calculate the distances from the two endpoints to the intersection point respectively; Using the projection coordinates of the two endpoints of the second line segment, calculate the length of the second line segment; If the distances from the two endpoints of the first line segment to the intersection point are both less than or equal to the length of the first line segment, and the distances from the two endpoints of the second line segment to the intersection point are both less than or equal to the length of the second line segment, then the intersection point of the two straight lines where the two line segments are located is on both line segments.

5. The method according to claim 1, characterized in that The stepping line segments on the survey line and the cutting line are selected in sequence from the respective search starting points to the direction away from the starting points, and it is determined whether they truly intersect, until the stepping line segments on the survey line and the stepping line segments on the cutting line that truly intersect are found, including: The search starting point reference point number on the line is lc, and the search starting point reference point number on the cutting line is tc; Use the reference point numbers of the two endpoints of the step line segment To represent the step line segment; In the first stage, select the step line segment on the survey line that is adjacent to the search starting point on the survey line. and , respectively, with the step line segment that searches for the starting point on the cutting line adjacent to the cutting line ), two step line segments are set to determine whether they actually intersect; If none of them intersect, enter the second stage: select a step line segment on the survey line that starts from the search starting point on the survey line and moves away from the starting point, and is separated from the starting point by one step line segment. , , respectively, and the step line segments within one step line segment of the search starting point on the cutting line , , , , two step line segments are set to determine whether they are truly intersecting, and select the step line segment on the cutting line that searches for the starting point on the cutting line in the direction away from the starting point and is separated from the starting point by one step line segment , , respectively, with the step line segments on the survey line that are adjacent to the search starting point on the survey line , A set of two step line segments is used to determine whether they actually intersect; If none of them intersect, enter the third stage: select a step line segment on the survey line that is 2 step line segments away from the starting point and searches for the starting point on the survey line. , , respectively, and the step line segments within 2 step line segments of the search starting point on the cutting line , , , , , , two step line segments are set to determine whether they are truly intersecting, and select the step line segment on the cutting line that searches for the starting point on the cutting line in the direction away from the starting point, which is 2 step line segments away from the starting point. , , respectively, and the step line segments within 1 step line segment of the search starting point on the survey line , , , A set of two step line segments is used to determine whether they actually intersect; If none of them intersects truly, then proceed by analogy. If the nth stage is entered, select a step line segment on the survey line that is n-1 step line segments away from the starting point on the survey line. , , respectively, and search for the step line segments within n-1 step line segments of the starting point on the cutting line. , , , , , , two step line segments are judged to be truly intersecting, and a step line segment is selected on the cutting line from the search starting point on the cutting line to the direction away from the starting point, which is n-1 step line segments away from the starting point , , respectively, and step line segments within n-2 step line segments of the search starting point on the survey line , , , , A group of two stepping line segments is judged whether they actually intersect, until the stepping line segment on the measuring line and the stepping line segment on the cutting line that actually intersect are found.

6. An electronic device, characterized in that: include: one or more processors; a storage device for storing one or more programs, 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 5.

7. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.

Images