c++ - Algorithm to find geohashes which satisfy query condition -
I have an application where I have to query the frahash by specifying boundary rectangles. Since geohashes map from 2D to 1D, there is a method by which I get prefix of all the physiotherapy which meet the query status (rectangular bounding). I tried Google but I did not get any algorithms.
It would be great if there is a library that works efficiently in C / C ++ for me. Even if there is no library, then I can work with an algorithmic solution.
The prefix will be the rectangle of the geocode
Is consistent with the latitude and the odd bits correspond to the longitude. As we move from left to right, we refine the specified interval of Bhurash. Consider a hypothetical land with
longitude related bits 110
. It tells us that we have the upper half ( 90
to 135 < / Code>,
0
) are interested in the top digit score ( 90 of the top half (
0
to 180
) Code> to 180
, second 1
before all the text 1
( -180
to 180 < / Code>). So by specifying a long string, you can refine the interval further.
Because the bounding rectangle is specified as a geocentric, so you do not need to do anything.
Comments
Post a Comment