Geoalgorithm for finding coordinates of point from a known location by distance and bearing

问题

I'd like to use Google maps static API to display a map with a path overlay indicating a boundary.

AFAICT the static API doesn't support polygons, so I intend to circumvent this by drawing the boundary using paths.

To do this I need to determine the points to draw the straight lines (paths) between; so I'd like an algorithm that returns the geographic location (i.e. WGS84 coordinates) a given bearing and distance from a known point.

Can anyone point me to such an algorithm. Preferably in C#, but other languages are acceptable?

回答1:

I implemented and tested it in C#, using Degrees as input/output instead of radians:

    static readonly double FullCircleDegrees = 360d;
    static readonly double HalfCircleDegrees = FullCircleDegrees / 2d;
    static readonly double DegreesToRadians = Math.PI / HalfCircleDegrees;
    static readonly double RadiansToDegrees = 1 / DegreesToRadians;

    public LatLng GetPointGivenRadialAndDistance(LatLng center, double radius, double azimuth)
    {
        var lat1 = center.Lat * DegreesToRadians;
        var lng1 = center.Lng * DegreesToRadians;
        var lat = Math.Asin( (Math.Sin(lat1) * Math.Cos(radius)) + Math.Cos(lat1) * Math.Sin(radius) * Math.Cos(azimuth * DegreesToRadians));
        var lng = 0d;
        if (Math.Cos(lat) == 0)
        {
            lng = lng1;
        }
        else
        {
            lng = ((lng1 + Math.PI - Math.Asin(Math.Sin(azimuth * DegreesToRadians) * Math.Sin(radius) / Math.Cos(lat1))) % (2 * Math.PI)) - Math.PI;
        }
        return new LatLng(lat * RadiansToDegrees, lng * RadiansToDegrees);
    }

回答2:

You can draw polygon on a KML file, and then show the KML on Google maps.

Here's KML on Google maps (From Google KML Samples) check the "Google Campus - Polygons" section in the content.

回答3:

In (I think) every language I know, radians. Note that I think your example code is giving you co-ordinates based on a sphere, not on WGS84. Here's Java code for converting between co-ordinate systems.

回答4:

Take a look at Gavaghan Geodesy C# library, it should be what you're looking for. And it's free.

回答5:

Found this (here: http://williams.best.vwh.net/avform.htm#LL):

A point {lat,lon} is a distance d out on the tc radial from point 1 if:

lat=asin(sin(lat1)*cos(d)+cos(lat1)*sin(d)*cos(tc))
IF (cos(lat)=0)
    lon=lon1      // endpoint a pole
ELSE
    lon=mod(lon1-asin(sin(tc)*sin(d)/cos(lat))+pi,2*pi)-pi
ENDIF

Will the radial be in radians or degrees?

Edit:

radians = degrees * PI / 180

来源：https://stackoverflow.com/questions/695065/geoalgorithm-for-finding-coordinates-of-point-from-a-known-location-by-distance

标签

coordinates

distance

bearing