Home/ Questions/Q 7093219
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-28T08:24:42+00:00

I have a matrix having around 1000 geospatial points(Longitude, Latitude) and i am trying

  • 0

I have a matrix having around 1000 geospatial points(Longitude, Latitude) and i am trying to find the points that are in 1KM range.

NOTE: “The points are dynamic, Imagine 1000 vehicles are moving, so i have to re-calculate all distances every few seconds”

I did some searches and read about Graph algorithms like (Floyd–Warshall) to solve this, and I ended up with many keywords, and i am kinda lost now. I am considering the performance and since the search radius is short, I will not consider the curvature of the earth.

Basically, It appears that i have to calculate the distance between every point to every other point then sort the distances starting from every point in the matrix and get the points that are in its range. So if I have 1000 co-ordinates, I have to perfom this process (1000^2-1000) times and I do not beleive this is the optimum solution. Thank You.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    In your case, you should be looking at the GeoHash which allows you to quickly query the coordinates within a given distance.

    FYI, MongoDB uses geohash internally and it’s performing excellently.

    • 0