Click here to Skip to main content
Click here to Skip to main content

Methods for a location proximity search using GPS (WGS-84) mathematics

, 28 Apr 2005
Rate this:
Please Sign up or sign in to vote.
Unsatisfied with the accuracy of code online that assumes the Earth is a sphere, I have implemented the oblate spheroid model used in GPS.

Introduction

This provides a fast Zip code proximity search and forgoes the massive FLOPS required by numerical methods. I would not call it a true distance search since it is an analytical approximation of our non-analytical reality, but it is much better than most of the code you find online that assumes the Earth is a perfect sphere.

This can be very handy for clients who want to get a general idea of how close the business entities are to each other, but don't want to break the bank by paying $8k per year for the MapPoint API, or simply do not need that level of detail or precision.

Zip code data in the US can be bought for $40 a year. Do not trust the latitudes and longitudes that are used by the UN for their LOCODE system, they are highly inaccurate. If you need international location data, you will have to find another source.

Also remember that the centroid latitude and longitudes for Zip codes may fall out of the physical Zip code area, depending on its geometry. As you implement this, keep in mind that its primary purpose is for a fast proximity search, and is based on the foundation of the analytical model behind a GPS interpreter. If you need a true GPS level of precision in your application, I recommend looking at this Code Project article, which uses an existing GPS interpreter for commercial purposes.

Theory

The earth is an oblate spheroid because of the flattening that results from its rotation, as I have depicted using MATLAB. The image is hollowed out so that you can clearly see the difference between this and the spherical model that is used in code online everywhere:

A big problem with many of the searches that you will find online is that this assumption induces great error. You can imagine superimposing a sphere on the image above, and then taking a plane normal to the point of interest. First of all, your 'surface' of the Earth is already greatly exaggerated with a spherical model. Then when you take a normal surface (as many code examples online do, to calculate max and min latitude and longitude), those points on the normal surface are even further exaggerated.

By using the mathematics approved in WGS-84, and used in GPS, we can get a much better approximation. The height above sea level (altitude) is not considered here, because I assume that you do not have topographical data. This is a source of error in the Ellipsoid analytical model, but it also exists in the common spherical model to further exaggerate its mathematical flaws.

The mathematical error of this WGS-84 Ellipsoid model is depicted below:

Remember that the distance is a bird's-eye view in all cases, so you will want to specify that in your search results so that the users don’t confuse this proximity figure with the road/travel distance.

You can obtain postal code latitude/longitude data for $40 a year now, and without paying for a more sophisticated service which maintains road distances, addresses, and altitude data, this is an accurate proximity search that far outperforms the typical 'perfect sphere' model without making your processor cry. Please download the single source code class for all of the gory details. I will only illustrate the concepts in this article.

Extension

Large search radius- If you ever need to search more than 1/4th of the globe, I would recommend breaking this algorithm into pieces instead of throwing an exception. You could handle the search area in a piecewise fashion, with the same analytics here and combine the results upon completion. You would need to determine an optimal frequency for which to create new radii of curvature (then use the local ellipse defined by those radii). With an approach like that, you could break down the curvilinear plane into well defined pieces, without going for a full-blown differential numerical approximation, which would be much more FLOPSy. My guess is that such an extension is purely academic. If you have a requirement for your system to search more than 1/4th of the globe, it's probably a system that requires an unsurpassed level of precision anyway, and it's probably for a client who has $8k per year to blow on the MapPoint API, or some other enterprise solution. Still...as we all know, who can predict what the clients will ask for next? Smile | :) So I thought it was prudent to leave you a breadcrumb trail for this issue. Make sure if you go this route that you accurately model the error and educate your client on it, if you do need to make your way back home from this gingerbread house.

Access to altitude data- If you have altitude data these closed form equations could be modified for better accuracy. You can refer to the WGS-84 manual [927 Kb] to derive your equations. Look at the section on coordinate systems and Geodesy in the appendix.

Data

I'm assuming that you will write the scripting for your own data architecture, so I have replaced my sproc calls and data layer calls. You may also want to find a class online that converts a DataView to a DataTable for sorting purposes. There's a very popular function online for C#, which is easy to find.

The code

The methods are very straightforward. They are well commented, so I will not delve into much detail here. You will have to obtain your own data. The UN maintains 'LOCODE' data that is handy for international business. You will see in the location object some properties that I am taking straight from that data. I recommend using the following tables in your architecture:

  • Regions
  • Countries
  • Subdivisions (International term for States, Provinces, Cantons, etc.)
  • Currencies
  • Location Entry Criteria
  • Counties
  • Location (City/Town names and features, optional County FK)
  • Postal Codes (with centroid latitude, longitude, LocationID FK)

All of my code of interest is in the Location object which gives me everything I want to know about a place or area on the globe.

#region Declarations
    private int regionID;
    private string regionName;
    private int countryID;
    private string countryCode;
    private string countryName;
    private int primaryCurrencyID;
    private string primaryCurrencyCode;
    private string primaryCurrencyName;
    private int secondaryCurrencyID;
    private string secondaryCurrencyCode;
    private string secondaryCurrencyName;
    private int subdivisionID;
    private string subdivisionCode;
    private string subdivisionName;
    private string subdivisionType;
    private int countyID;
    private string countyName;
    private int locationID;
    private string cityName;
    private bool hasPort;
    private bool hasRailTerminal;
    private bool hasRoadTerminal;
    private bool hasAirport;
    private bool hasBorderCrossing;
    private bool hasPostalExchangeOffice;
    private string postalCode;
    private double longitude;
    private double latitude;
    private string address;
    private string addressee;
    //private string language;
    //private string productName;
    #endregion

You can also create a collection of these objects, because I use CollectionBase:

#region Collections
    /// <SUMMARY>
    /// Collection of Location objects
    /// </SUMMARY>
    public Location this[int i]
    {
        get    {return (Location)List[i];}
        set    {List[i] = value;}
    }

    /// <SUMMARY>
    /// Adds a Location object to the collection
    /// </SUMMARY>
    /// <PARAM name="L">Completed Location object</PARAM>
    public void AddLocation(Location L)
    {
        List.Add(L);
    }

    /// <SUMMARY>
    /// Removes a Location object from the collection
    /// </SUMMARY>
    /// <PARAM name="L">Completed Location object</PARAM>
    public void RemoveLocation(Location L)
    {
        List.Remove(L);
    }
    #endregion

Constants that are used in the formulas:

#region Constants
    //Equatorial radius of the earth from WGS 84 
    //in meters, semi major axis = a
    internal int a = 6378137;
    //flattening = 1/298.257223563 = 0.0033528106647474805
    //first eccentricity squared = e = (2-flattening)*flattening
    internal double e = 0.0066943799901413165;
    //Miles to Meters conversion factor (take inverse for opposite)
    internal double milesToMeters = 1609.347;
    //Degrees to Radians converstion factor (take inverse for opposite)
    internal double degreesToRadians = Math.PI/180;
    #endregion

Now you can use the search postal code to return the latitude and longitude that is the centroid of your search ellipse. The radii of curvature functions determine your reference ellipsoid for the latitude of the search. An exception is thrown if the accuracy is severely compromised by the search parameters.

Function: public DataTable FindNearbyLocations(string centroidPostalCode, double searchRadius, bool isMetric).

//lat naught and lon naught are the geodetic parameters in radians
double lat0 = 
   Convert.ToDouble(centroidDT.Rows[0]["Latitude"])*degreesToRadians;
double lon0 = 
   Convert.ToDouble(centroidDT.Rows[0]["Longitude"])*degreesToRadians;

//Find reference ellipsoid radii
double Rm = calcMeridionalRadiusOfCurvature(lat0);
double Rpv = calcRoCinPrimeVertical(lat0);

//Throw exception if search radius is greater than 1/4 of globe and 
//thus breaks accuracy of model (mostly pertinent for russia, alaska, 
//canada, peru, etc.)
if (Rpv*Math.Cos(lat0)*Math.PI/2 < searchRadius)
{
    throw new ApplicationException("Search radius was too great to " + 
                       "achieve an accurate result with this model.");
}

//Find boundaries for curvilinear plane that encloses search ellipse
double latMax = (searchRadius/Rm+lat0)/degreesToRadians;
double lonMax = (searchRadius/(Rpv*Math.Cos(lat0))+lon0)/degreesToRadians;
double latMin = (lat0-searchRadius/Rm)/degreesToRadians;
double lonMin = (lon0-searchRadius/(Rpv*Math.Cos(lat0)))/degreesToRadians;

//Return postal codes in curvilinear plane
SqlParameter one2 = new SqlParameter("@latMin",System.Data.SqlDbType.Decimal, 
                                          9, ParameterDirection.Input, false, 
                                 ((System.Byte)(18)), ((System.Byte)(5)), "", 
                                 System.Data.DataRowVersion.Current, latMin);
SqlParameter two2 = new SqlParameter("@latMax",System.Data.SqlDbType.Decimal, 
                                          9, ParameterDirection.Input, false, 
                                 ((System.Byte)(18)), ((System.Byte)(5)), "", 
                                 System.Data.DataRowVersion.Current, latMax);
SqlParameter three2 = new SqlParameter("@lonMin",System.Data.SqlDbType.Decimal, 
                                            9, ParameterDirection.Input, false, 
                                   ((System.Byte)(18)), ((System.Byte)(5)), "", 
                                   System.Data.DataRowVersion.Current, lonMin);
SqlParameter four2 = new SqlParameter("@lonMax",System.Data.SqlDbType.Decimal, 9, 
                                                 ParameterDirection.Input, false, 
                                     ((System.Byte)(18)), ((System.Byte)(5)), "", 
                                     System.Data.DataRowVersion.Current, lonMax);
object[] Param2 = new object[4]{one2,two2,three2,four2};
DataTable resultPostalCodesDT = new DataTable("ResultPostalCodes");
resultPostalCodesDT = helper.ReadOnlySproc(helper.YOUR_CONNECTION,
                                                      "dbo.[YOUR_SPROC]",Param2);
resultPostalCodesDT.Columns.Add("DistanceToCentroid",
                                           System.Type.GetType("System.Double"));

//Now calc distances from centroid, and remove results that were returned 
//in the curvilinear plane, but are outside of the ellipsoid geodetic
if (resultPostalCodesDT.Rows.Count > 0)
{
  for (int i=0;i<resultPostalCodesDT.Rows.Count;i++)
  {
    resultPostalCodesDT.Rows[i]["DistanceToCentroid"] = calcDistanceLatLons(Rm,
                                                                  Rpv,lat0,lon0,
      Convert.ToDouble(resultPostalCodesDT.Rows[i]["Latitude"])*degreesToRadians,
      Convert.ToDouble(resultPostalCodesDT.Rows[i]["Longitude"])*degreesToRadians);
    if (Convert.ToDouble(resultPostalCodesDT.Rows[i]["DistanceToCentroid"]) > 
                                                                     searchRadius)
    {
          resultPostalCodesDT.Rows.RemoveAt(i);
          i--;
    }
  }
  if (isMetric == false)
  {
      foreach(DataRow r in resultPostalCodesDT.Rows)
      {
          r["DistanceToCentroid"] = 
                       Convert.ToDouble(r["DistanceToCentroid"])/milesToMeters;
      }
  }
  resultPostalCodesDT.DefaultView.Sort = "DistanceToCentroid";
  DataTable finalResults = new DataTable("finalResults");
  finalResults = YOUR_CUSTOM_UTILITY_CLASS.ConvertDataViewToDataTable(
                                               resultPostalCodesDT.DefaultView);
  return finalResults;
}
else
{
  return null;
}

Here are the functions for your information that involve the radii of curvature and distance calculations:

/// <summary>
    /// Calculates the Radius of curvature in the 
    /// prime vertical for the reference ellipsoid
    /// </summary>
    /// <remarks>
    /// This is the vector that defines the normal surface 
    /// to any point on the ellipsoid.  It extends from
    /// from the polar axis to that point.  It is used for the 
    /// longitude, in differentiation of east distances, dE
    /// </remarks>
    /// <param name="lat0">Geodetic latitude in radians</param>
    /// <returns>Length of radius of curvature in the 
    /// prime vertical</returns>
    public double calcRoCinPrimeVertical(double lat0)
    {
        double Rn = a/Math.Sqrt(1-e*Math.Pow(Math.Sin(lat0),2));
        return Rn;
    }

    /// <summary>
    /// Calculates the meridional radius of 
    /// curvature for the reference ellipsoid
    /// </summary>
    /// <remarks>
    /// This is the radius of a circle that fits the earth 
    /// curvature in the meridian at the latitude chosen.
    /// It is used for latitude, in differentiation of 
    /// north distances, dN
    /// </remarks>
    /// <param name="lat0">Geodetic latitude in radians</param>
    /// <returns>Length of meridional radius of 
    /// curvature</returns>
    public double calcMeridionalRadiusOfCurvature(double lat0)
    {
        double Rm = 
               a*(1-e)/Math.Pow(1-e*(Math.Pow(Math.Sin(lat0),2)),1.5);
        return Rm;
    }
    
    /// <summary>
    /// Calculates the true birds-eye view length of the arc 
    /// between two positions on the globe using parameters from WGS 84,
    /// used in aviation and GPS.
    /// </summary>
    /// <remarks>
    /// An accurate BIRDS EYE numerical approximation with error 
    /// approaching less than 10 feet at a 50 miles search radius
    /// and only 60 ft at 400 mile search radius.  Error is on the 
    /// order of (searchRadius/equatorialRadius)^2.  
    /// Only accurate for distances
    /// less than 1/4 of the globe (~10,000 km at the equator, 
    /// and approaching 0 km at the poles).
    /// Geoid height above sea level is assumed to be zero, which is 
    /// the only deviation from GPS, and another source of error.
    /// </remarks>
    /// <param name="Rm">Meridional Radius of Curvature 
    /// at the centroid latitude</param>
    /// <param name="Rpv">Radius of Curvature in the Prime 
    /// Vertical at the centroid latitude</param>
    /// <param name="lat0">Centroid latitude</param>
    /// <param name="lon0">Centroid longitude</param>
    /// <param name="lat">Destination latitude</param>
    /// <param name="lon">Destination longitude</param>
    /// <returns>Distance in meters from the arc between 
    /// the two points on the globe</returns>
    public double calcDistanceLatLons(double Rm, double Rpv, double lat0, 
                                         double lon0, double lat, double lon)
    {
        double distance = Math.Sqrt(Math.Pow(Rm,2)*Math.Pow(lat-lat0,2)+
              Math.Pow(Rpv,2)*Math.Pow(Math.Cos(lat0),2)*Math.Pow(lon-lon0,2));
        return distance;
    }

License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here

Share

About the Author

Thomas Kurek
Web Developer
United States United States
Broad engineering background, Virginia Tech Alum. Attracted to .NET by the sheer power of the framework and elegance of c#. Work includes analytical system to calculate joint torque during balance recovery to recommend physical therapy routines and correct bad biomechanics (preventative medicine). Assimilated force plate and 3D kinematic data for modeling. First and sole developer ever to fully automate corporate housing quotes, which I built into a larger engine that serves the company's entire enterprise.
 
Experience with applications architecture, DB design and UML 2.0. Experience with a broad range of applied mathematics, FEM software coding, solid and fluid mechanics. Great knowledge of healthcare and physiology with degree in Mechanical/Electrical/Materials Engineering Theory (Engineering Science and Mechanics) and concentration in biomechanics.
 
Currently expanding my corporate housing business engine by day. By night I am expanding my software engineering design and construction knowledge, staying in touch with the direction of healthcare management systems, and moving music business technology forward. Microsoft is now working on blowing iTunes out of the water, but my business is making an even bigger revolution that is far beyond just music retail. It strikes at the heart of the music industry's issues, and perhaps we will consider partnering with Microsoft to feed their music retail goals while they feed our music licensing, publishing, and digital decentralization of distribution.
 
I am the Enterprise Architect at my company and maintain a small but powerful and effective team. I have personally customized CxOne from construx (www.construx.com) for this team. Long live Steve McConnell.

Comments and Discussions

 
Generalsexyyyyyyyyyyy Pinmembershakesperoo7-Nov-10 4:51 
Generalsexy Pinmembershakesperoo7-Nov-10 4:50 
GeneralTom... PinmemberDerek Samuels7-Mar-08 11:07 
QuestionFAST Search PinmemberTecture12-Feb-07 3:18 
GeneralThanks for the article! Pinmemberdougfales31-Oct-06 6:34 
QuestionHow to determine SearchRadius? Pinmemberppritcha30-Apr-06 13:37 
AnswerRe: How to determine SearchRadius? PinmemberThomas Kurek30-Apr-06 13:49 
GeneralRe: How to determine SearchRadius? Pinmemberppritcha1-May-06 5:43 
GeneralRe: How to determine SearchRadius? PinmemberThomas Kurek1-May-06 6:16 
GeneralRe: How to determine SearchRadius? Pinmemberppritcha1-May-06 7:58 
GeneralRe: How to determine SearchRadius? PinmemberThomas Kurek1-May-06 8:15 
GeneralRe: How to determine SearchRadius? Pinmemberjwhurst28-Aug-06 16:34 
QuestionHave you checked against a GIS? Pinmembergxdata28-Apr-05 15:19 
AnswerRe: Have you checked against a GIS? PinmemberThomas Kurek29-Apr-05 6:08 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

| Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.141223.1 | Last Updated 28 Apr 2005
Article Copyright 2005 by Thomas Kurek
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid