There are points in the database indicating their longitude and latitude in decimal fractions of a degree, i.e. for example: 53.20498753072359,49.96120754474532.

The import of new points from csv is being developed. There is a condition a new point should not be closer than 150m to the existing one.

There is a function for calculating the distance between two points, but taking into account the large number of points (for example, now there are already 1000, you need to import another 5000) to sort through each new point the distance to each existing one is very laborious. There was an idea of ​​optimization, for a start to pull out from the base all points that fall into a square with a side of 300m and a center in the new one being added. And already among them, to sort the distances (in most cases, such a filter and error will be enough. Actually the question is: how to determine the corner points of this square? enter image description here

    1 answer 1

    " Direct geodesic task " Angle 45 degrees, distance 75 m

    Here it is on C http://wiki.gis-lab.ru/w/%D0%97%D0%B0%D0%B4%D0%B0%D1%87%D0%B8_%D0%BD%D0% B0_% D1% 81% D1% 84% D0% B5% D1% 80% D0% B5: % D0% BF% D1% 80% D1% 8F% D0% BC% D0% B0% D1% 8F % D0% B3 % D0% B5% D0% BE% D0% B4% D0% B5% D0% B7% D0% B8% D1% 87% D0% B5% D1% 81% D0% BA% D0% B0% D1% 8F_% D0 % B7% D0% B0% D0% B4% D0% B0% D1% 87% D0% B0

    • Please try to publish detailed answers containing a specific example of the minimum solution, supplementing them with a link to the source. Answers –references (like comments) do not add knowledge to Runet. - Nicolas Chabanovsky ♦