Calculate distance between two points in google maps V3

后端 未结 15 1713
醉梦人生
醉梦人生 2020-11-22 02:27

How do you calculate the distance between two markers in Google maps V3? (Similar to the distanceFrom function inV2.)

Thanks..

相关标签:
15条回答
  • 2020-11-22 02:45

    OFFLINE SOLUTION - Haversine Algorithm

    In Javascript

    var _eQuatorialEarthRadius = 6378.1370;
    var _d2r = (Math.PI / 180.0);
    
    function HaversineInM(lat1, long1, lat2, long2)
    {
        return (1000.0 * HaversineInKM(lat1, long1, lat2, long2));
    }
    
    function HaversineInKM(lat1, long1, lat2, long2)
    {
        var dlong = (long2 - long1) * _d2r;
        var dlat = (lat2 - lat1) * _d2r;
        var a = Math.pow(Math.sin(dlat / 2.0), 2.0) + Math.cos(lat1 * _d2r) * Math.cos(lat2 * _d2r) * Math.pow(Math.sin(dlong / 2.0), 2.0);
        var c = 2.0 * Math.atan2(Math.sqrt(a), Math.sqrt(1.0 - a));
        var d = _eQuatorialEarthRadius * c;
    
        return d;
    }
    
    var meLat = -33.922982;
    var meLong = 151.083853;
    
    
    var result1 = HaversineInKM(meLat, meLong, -32.236457779983745, 148.69094705162837);
    var result2 = HaversineInKM(meLat, meLong, -33.609020205923713, 150.77061469270831);
    

    C#

    using System;
    
    public class Program
    {
        public static void Main()
        {
            Console.WriteLine("Hello World");
    
            var meLat = -33.922982;
            double meLong = 151.083853;
    
    
            var result1 = HaversineInM(meLat, meLong, -32.236457779983745, 148.69094705162837);
            var result2 = HaversineInM(meLat, meLong, -33.609020205923713, 150.77061469270831);
    
            Console.WriteLine(result1);
            Console.WriteLine(result2);
        }
    
        static double _eQuatorialEarthRadius = 6378.1370D;
        static double _d2r = (Math.PI / 180D);
    
        private static int HaversineInM(double lat1, double long1, double lat2, double long2)
        {
            return (int)(1000D * HaversineInKM(lat1, long1, lat2, long2));
        }
    
        private static  double HaversineInKM(double lat1, double long1, double lat2, double long2)
        {
            double dlong = (long2 - long1) * _d2r;
            double dlat = (lat2 - lat1) * _d2r;
            double a = Math.Pow(Math.Sin(dlat / 2D), 2D) + Math.Cos(lat1 * _d2r) * Math.Cos(lat2 * _d2r) * Math.Pow(Math.Sin(dlong / 2D), 2D);
            double c = 2D * Math.Atan2(Math.Sqrt(a), Math.Sqrt(1D - a));
            double d = _eQuatorialEarthRadius * c;
    
            return d;
        }
    }
    

    Reference: https://en.wikipedia.org/wiki/Great-circle_distance

    0 讨论(0)
  • 2020-11-22 02:46
    //p1 and p2 are google.maps.LatLng(x,y) objects
    
    function calcDistance(p1, p2) {
              var d = (google.maps.geometry.spherical.computeDistanceBetween(p1, p2) / 1000).toFixed(2);
              console.log(d);              
    }
    
    0 讨论(0)
  • 2020-11-22 02:48

    With google you can do it using the spherical api, google.maps.geometry.spherical.computeDistanceBetween (latLngA, latLngB);.

    However, if the precision of a spherical projection or a haversine solution is not precise enough for you (e.g. if you're close to the pole or computing longer distances), you should use a different library.

    Most information on the subject I found on Wikipedia here.

    A trick to see if the precision of any given algorithm is adequate is to fill in the maximum and minimum radius of the earth and see if the difference might cause problems for your use case. Many more details can be found in this article

    In the end the google api or haversine will serve most purposes without problems.

    0 讨论(0)
  • 2020-11-22 02:48
      /**
       * Calculates the haversine distance between point A, and B.
       * @param {number[]} latlngA [lat, lng] point A
       * @param {number[]} latlngB [lat, lng] point B
       * @param {boolean} isMiles If we are using miles, else km.
       */
      function haversineDistance(latlngA, latlngB, isMiles) {
        const squared = x => x * x;
        const toRad = x => (x * Math.PI) / 180;
        const R = 6371; // Earth’s mean radius in km
    
        const dLat = toRad(latlngB[0] - latlngA[0]);
        const dLon = toRad(latlngB[1] - latlngA[1]);
    
        const dLatSin = squared(Math.sin(dLat / 2));
        const dLonSin = squared(Math.sin(dLon / 2));
    
        const a = dLatSin +
                  (Math.cos(toRad(latlngA[0])) * Math.cos(toRad(latlngB[0])) * dLonSin);
        const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));
        let distance = R * c;
    
        if (isMiles) distance /= 1.609344;
    
        return distance;
      }
    

    I found a version online which is 80% right but plugged in the wrong parameter and is inconsistent in using the inputs, this version fixed that completely

    0 讨论(0)
  • 2020-11-22 02:52

    Here is the c# implementation of the this forumula

     public class DistanceAlgorithm
    {
        const double PIx = 3.141592653589793;
        const double RADIO = 6378.16;
    
        /// <summary>
        /// This class cannot be instantiated.
        /// </summary>
        private DistanceAlgorithm() { }
    
        /// <summary>
        /// Convert degrees to Radians
        /// </summary>
        /// <param name="x">Degrees</param>
        /// <returns>The equivalent in radians</returns>
        public static double Radians(double x)
        {
            return x * PIx / 180;
        }
    
        /// <summary>
        /// Calculate the distance between two places.
        /// </summary>
        /// <param name="lon1"></param>
        /// <param name="lat1"></param>
        /// <param name="lon2"></param>
        /// <param name="lat2"></param>
        /// <returns></returns>
        public static double DistanceBetweenPlaces(
            double lon1,
            double lat1,
            double lon2,
            double lat2)
        {
            double dlon =  Radians(lon2 - lon1);
            double dlat =  Radians(lat2 - lat1);
    
            double a = (Math.Sin(dlat / 2) * Math.Sin(dlat / 2)) + Math.Cos(Radians(lat1)) * Math.Cos(Radians(lat2)) * (Math.Sin(dlon / 2) * Math.Sin(dlon / 2));
            double angle = 2 * Math.Atan2(Math.Sqrt(a), Math.Sqrt(1 - a));
            return (angle * RADIO) * 0.62137;//distance in miles
        }
    
    }    
    
    0 讨论(0)
  • 2020-11-22 02:54

    There actually seems to be a method in GMap3. It's a static method of the google.maps.geometry.spherical namespace.

    It takes as arguments two LatLng objects and will utilize a default Earth radius of 6378137 meters, although the default radius can be overridden with a custom value if necessary.

    Make sure you include:

    <script type="text/javascript" src="http://maps.google.com/maps/api/js?sensor=false&v=3&libraries=geometry"></script>
    

    in your head section.

    The call will be:

    google.maps.geometry.spherical.computeDistanceBetween (latLngA, latLngB);
    
    0 讨论(0)
提交回复
热议问题