SQlite Getting nearest locations (with latitude and longitude)

1) At first filter your SQLite data with a good approximation and decrease amount of data that you need to evaluate in your java code. Use the following procedure for this purpose:

To have a deterministic threshold and more accurate filter on data, It is better to calculate 4 locations that are in radius meter of the north, west, east and south of your central point in your java code and then check easily by less than and more than SQL operators (>, <) to determine if your points in database are in that rectangle or not.

The method calculateDerivedPosition(...) calculates those points for you (p1, p2, p3, p4 in picture).

/*** Calculates the end-point from a given source at a given range (meters)* and bearing (degrees). This methods uses simple geometry equations to* calculate the end-point.* * @param point*           Point of origin* @param range*           Range in meters* @param bearing*           Bearing in degrees* @return End-point from the source given the desired range and bearing.*/public static PointF calculateDerivedPosition(PointF point,            double range, double bearing)    {        double EarthRadius = 6371000; // m        double latA = Math.toRadians(point.x);        double lonA = Math.toRadians(point.y);        double angularDistance = range / EarthRadius;        double trueCourse = Math.toRadians(bearing);        double lat = Math.asin(                Math.sin(latA) * Math.cos(angularDistance) +                        Math.cos(latA) * Math.sin(angularDistance)                        * Math.cos(trueCourse));        double dlon = Math.atan2(                Math.sin(trueCourse) * Math.sin(angularDistance)                        * Math.cos(latA),                Math.cos(angularDistance) - Math.sin(latA) * Math.sin(lat));        double lon = ((lonA + dlon + Math.PI) % (Math.PI * 2)) - Math.PI;        lat = Math.toDegrees(lat);        lon = Math.toDegrees(lon);        PointF newPoint = new PointF((float) lat, (float) lon);        return newPoint;    }

And now create your query:

PointF center = new PointF(x, y);final double mult = 1; // mult = 1.1; is more reliablePointF p1 = calculateDerivedPosition(center, mult * radius, 0);PointF p2 = calculateDerivedPosition(center, mult * radius, 90);PointF p3 = calculateDerivedPosition(center, mult * radius, 180);PointF p4 = calculateDerivedPosition(center, mult * radius, 270);strWhere =  " WHERE "        + COL_X + " > " + String.valueOf(p3.x) + " AND "        + COL_X + " < " + String.valueOf(p1.x) + " AND "        + COL_Y + " < " + String.valueOf(p2.y) + " AND "        + COL_Y + " > " + String.valueOf(p4.y);

COL_X is the name of the column in the database that stores latitude values and COL_Y is for longitude.

So you have some data that are near your central point with a good approximation.

2) Now you can loop on these filtered data and determine if they are really near your point (in the circle) or not using the following methods:

public static boolean pointIsInCircle(PointF pointForCheck, PointF center,            double radius) {        if (getDistanceBetweenTwoPoints(pointForCheck, center) <= radius)            return true;        else            return false;    }public static double getDistanceBetweenTwoPoints(PointF p1, PointF p2) {        double R = 6371000; // m        double dLat = Math.toRadians(p2.x - p1.x);        double dLon = Math.toRadians(p2.y - p1.y);        double lat1 = Math.toRadians(p1.x);        double lat2 = Math.toRadians(p2.x);        double a = Math.sin(dLat / 2) * Math.sin(dLat / 2) + Math.sin(dLon / 2)                * Math.sin(dLon / 2) * Math.cos(lat1) * Math.cos(lat2);        double c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));        double d = R * c;        return d;    }

Enjoy!

I used and customized this reference and completed it.

Chris's answer is really useful (thanks!), but will only work if you are using rectilinear coordinates (eg UTM or OS grid references). If using degrees for lat/lng (eg WGS84) then the above only works at the equator. At other latitudes, you need to decrease the impact of longitude on the sort order. (Imagine you're close to the north pole... a degree of latitude is still the same as it is anywhere, but a degree of longitude may only be a few feet. This will mean that the sort order is incorrect).

If you are not at the equator, pre-calculate the fudge-factor, based on your current latitude:

<fudge> = Math.pow(Math.cos(Math.toRadians(<lat>)),2);

Then order by:

((<lat> - LAT_COLUMN) * (<lat> - LAT_COLUMN) + (<lng> - LNG_COLUMN) * (<lng> - LNG_COLUMN) * <fudge>)

It's still only an approximation, but much better than the first one, so sort order inaccuracies will be much rarer.

I know this has been answered and accepted but thought I'd add my experiences and solution.

Whilst I was happy to do a haversine function on the device to calculate the accurate distance between the user's current position and any particular target location there was a need to sort and limit the query results in order of distance.

The less than satisfactory solution is to return the lot and sort and filter after the fact but this would result in a second cursor and many unnecessary results being returned and discarded.

My preferred solution was to pass in a sort order of the squared delta values of the long and lats:

((<lat> - LAT_COLUMN) * (<lat> - LAT_COLUMN) + (<lng> - LNG_COLUMN) * (<lng> - LNG_COLUMN))

There's no need to do the full haversine just for a sort order and there's no need to square root the results therefore SQLite can handle the calculation.

EDIT:

This answer is still receiving love. It works fine in most cases but if you need a little more accuracy, please check out the answer by @Teasel below which adds a "fudge" factor that fixes inaccuracies that increase as the latitude approaches 90.