Existing data O[(lat,lon),etc] D[(lat,lon),etc] G[(lat,lon),etc]
Among them there are more than 1 million O and D, GThere are more than 9,000 entries, and the OD corresponds to each other to find the point with the shortest distance among O, D and G, and delete the latitude and longitude information of the entire OD when the shortest distance of O or D is greater than 50m, that is, as long as O or D has a shortest distance greater than50m, delete the latitude and longitude information of O and the corresponding D.
Due to the large amount of data, I want the code to run fast
