A non-traversal search method for intersection points of aerial gravimetric network
An aviation gravity and search method technology, applied in the field of aviation gravity exploration, can solve problems such as low work efficiency and slow search speed, and achieve the effect of improving calculation efficiency and shortening time consumption
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0023] This embodiment provides an overall flow of a non-traversal search method for an intersection point of an airborne gravimetry network.
[0024] Such as figure 1 As shown, a non-traversal search method for intersections of airborne gravity surveying network includes the following steps: loading surveying network data; calculating intersections one by one until the calculation of all intersections is completed; outputting the information of intersections.
[0025] Wherein, the method for loading survey network data includes the following steps: reading survey network data; extracting survey lines and cutting lines.
[0026] Wherein, the method for calculating the intersection point is as figure 2 As shown, it includes the following steps: preliminary calculation of the position of the intersection point; finding the 4 target measuring points closest to the position of the intersection point on the surveying line and cutting line; and calculating the intersection point f...
Embodiment 2
[0035] This embodiment provides an improvement to the non-traversal search method for the intersection point of the airborne gravimetry network described in Embodiment 1.
[0036] According to the method for calculating the intersection described in embodiment 1, after adopting the jumping approximation method to calculate the intersection position for the second time, after updating the steps of 4 target measuring points, increase the following steps:
[0037] Judging whether there is an intersection between the target measuring points;
[0038] If there is no intersection, then further judge the distance between the target measuring point and the intersection;
[0039] If the distance exceeds 2 point distances, use the jumping approximation method to calculate the intersection position for the third time, and update the 4 target measuring points again; this step can be repeated for multiple iterations;
[0040] If the distance is not more than 2 points, use sliding fine-tun...
Embodiment 3
[0043] This embodiment provides a computer program implementation of the non-traversal search method for the intersection of airborne gravity surveying network described in Embodiment 1. This embodiment uses C# programming language, Visual Studio 2013 compilation and debugging.
[0044] In this embodiment, two intersection calculation functions are designed to meet different requirements when searching for intersections.
[0045] The first is the IsCrossPoint() function. This function can return the two judgments and the final intersection coordinates in the position distribution of the intersection of the survey line segment and the cutting line segment, and return three results; the second is the getCross() function, which only returns the intersection point of two line segments Coordinates, intersection points can be distributed inside and outside the line segment.
[0046] Using the cross product of two vectors is equal to the area of a parallelogram formed by two vect...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


