用纬度经度计算两点之间的距离,我做错了什么?

我试图解决这个任务,这需要花费太多的时间:

这是我的尝试,这只是我的代码片段:

final double RADIUS = 6371.01; double temp = Math.cos(Math.toRadians(latA)) * Math.cos(Math.toRadians(latB)) * Math.cos(Math.toRadians((latB) - (latA))) + Math.sin(Math.toRadians(latA)) * Math.sin(Math.toRadians(latB)); return temp * RADIUS * Math.PI / 180; 

我用这个公式来得到纬度和经度:x = Deg +(Min + Sec / 60)/ 60)

谢谢

由上面的Dommer给出的Java代码给出了稍微不正确的结果,但是如果你正在处理一个GPS轨道,那么这个小错误就会加起来。 下面是Java中的Haversine方法的实现,它也考虑了两点之间的高度差异。

 /** * Calculate distance between two points in latitude and longitude taking * into account height difference. If you are not interested in height * difference pass 0.0. Uses Haversine method as its base. * * lat1, lon1 Start point lat2, lon2 End point el1 Start altitude in meters * el2 End altitude in meters * @returns Distance in Meters */ public static double distance(double lat1, double lat2, double lon1, double lon2, double el1, double el2) { final int R = 6371; // Radius of the earth double latDistance = Math.toRadians(lat2 - lat1); double lonDistance = Math.toRadians(lon2 - lon1); double a = Math.sin(latDistance / 2) * Math.sin(latDistance / 2) + Math.cos(Math.toRadians(lat1)) * Math.cos(Math.toRadians(lat2)) * Math.sin(lonDistance / 2) * Math.sin(lonDistance / 2); double c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a)); double distance = R * c * 1000; // convert to meters double height = el1 - el2; distance = Math.pow(distance, 2) + Math.pow(height, 2); return Math.sqrt(distance); } 

这是一个计算两个纬度/长点之间距离的Java函数 。

编辑

我发现了另一个代码的参考 。

而且,贴在下面,以防万一它消失。

  private double distance(double lat1, double lon1, double lat2, double lon2, char unit) { double theta = lon1 - lon2; double dist = Math.sin(deg2rad(lat1)) * Math.sin(deg2rad(lat2)) + Math.cos(deg2rad(lat1)) * Math.cos(deg2rad(lat2)) * Math.cos(deg2rad(theta)); dist = Math.acos(dist); dist = rad2deg(dist); dist = dist * 60 * 1.1515; if (unit == 'K') { dist = dist * 1.609344; } else if (unit == 'N') { dist = dist * 0.8684; } return (dist); } /*:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*/ /*:: This function converts decimal degrees to radians :*/ /*:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*/ private double deg2rad(double deg) { return (deg * Math.PI / 180.0); } /*:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*/ /*:: This function converts radians to decimal degrees :*/ /*:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*/ private double rad2deg(double rad) { return (rad * 180.0 / Math.PI); } System.out.println(distance(32.9697, -96.80322, 29.46786, -98.53506, 'M') + " Miles\n"); System.out.println(distance(32.9697, -96.80322, 29.46786, -98.53506, 'K') + " Kilometers\n"); System.out.println(distance(32.9697, -96.80322, 29.46786, -98.53506, 'N') + " Nautical Miles\n"); 

注意:此解决scheme仅适用于短距离。

我尝试使用dommer公布的应用程序的公式,发现它的长途运行情况良好,但在我的数据中,我使用的都是非常短的距离,dommer的post做得很差。 我需要的速度,更复杂的地理计算工作得很好,但速度太慢。 所以,在你需要速度的情况下,你所做的所有计算都很短(也许<100m左右)。 我发现这个小近似工作很好。 它假设世界是平坦的,因此不要长距离使用它,它通过近似给定纬度的单个纬度和经度的距离并以米为单位返回毕达哥拉斯距离来工作。

 public class FlatEarthDist { //returns distance in meters public static double distance(double lat1, double lng1, double lat2, double lng2){ double a = (lat1-lat2)*FlatEarthDist.distPerLat(lat1); double b = (lng1-lng2)*FlatEarthDist.distPerLng(lat1); return Math.sqrt(a*a+b*b); } private static double distPerLng(double lat){ return 0.0003121092*Math.pow(lat, 4) +0.0101182384*Math.pow(lat, 3) -17.2385140059*lat*lat +5.5485277537*lat+111301.967182595; } private static double distPerLat(double lat){ return -0.000000487305676*Math.pow(lat, 4) -0.0033668574*Math.pow(lat, 3) +0.4601181791*lat*lat -1.4558127346*lat+110579.25662316; } } 

这里是一个页面,用于各种球面计算的JavaScript示例。 页面上的第一个应该给你你需要的东西。

http://www.movable-type.co.uk/scripts/latlong.html

这里是Javascript代码

 var R = 6371; // km var dLat = (lat2-lat1).toRad(); var dLon = (lon2-lon1).toRad(); var a = Math.sin(dLat/2) * Math.sin(dLat/2) + Math.cos(lat1.toRad()) * Math.cos(lat2.toRad()) * Math.sin(dLon/2) * Math.sin(dLon/2); var c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1-a)); var d = R * c; 

哪里“d”将保持距离。

这个维基百科文章提供了公式和一个例子。 文本是德文,但计算说明了自己。

 package distanceAlgorithm; public class CalDistance { public static void main(String[] args) { // TODO Auto-generated method stub CalDistance obj=new CalDistance(); /*obj.distance(38.898556, -77.037852, 38.897147, -77.043934);*/ System.out.println(obj.distance(38.898556, -77.037852, 38.897147, -77.043934, "M") + " Miles\n"); System.out.println(obj.distance(38.898556, -77.037852, 38.897147, -77.043934, "K") + " Kilometers\n"); System.out.println(obj.distance(32.9697, -96.80322, 29.46786, -98.53506, "N") + " Nautical Miles\n"); } public double distance(double lat1, double lon1, double lat2, double lon2, String sr) { double theta = lon1 - lon2; double dist = Math.sin(deg2rad(lat1)) * Math.sin(deg2rad(lat2)) + Math.cos(deg2rad(lat1)) * Math.cos(deg2rad(lat2)) * Math.cos(deg2rad(theta)); dist = Math.acos(dist); dist = rad2deg(dist); dist = dist * 60 * 1.1515; if (sr.equals("K")) { dist = dist * 1.609344; } else if (sr.equals("N")) { dist = dist * 0.8684; } return (dist); } public double deg2rad(double deg) { return (deg * Math.PI / 180.0); } public double rad2deg(double rad) { return (rad * 180.0 / Math.PI); } }