不，因为经度线会聚于两极。如果你的积分相对较近，那么可以近似这样的距离：
$ b $ pre code d = sqrt（pow（lat2-lat1,2） ）+ cos（lat1）* pow（lon2-lon1,2））

如果您需要更高的准确度在很远的距离上，有几种奇特的公式用于计算大圆距离，但我发现在单位圆上转换成三维坐标变得更简单，然后做一个简单的毕达哥拉斯距离，接着2 sin（-1）（ d / 2）转换回角度（尽管我可以理解有些人可能会发现 找不到这个简单的，： - ）。

Is it ok to compare distances in a classic way (distance between 2 points: d = sqrt(pow(lat2-lat1, 2) + pow(lon2-lon1, 2)) ) using the latitude and longitude returned from google apis without any transformation to meters or sth? I need it just for a comparison to find the closest point from a series of points to a reference point. For example:

Lets say we have two (lat,lon) points: (40.2535425,22.88245345) and (40.2565795,22.8884539) and we want to find witch is closest to (40.2335425,22.83245345). Is it ok to apply the above code to find the distances? Or we need to find the distance, lets say in meters (using the haversine formula or whatever), first for each point from the reference point and then compare the values ?

I ask this question because I don't know what exactly are the values returned by google apis as lat, lon! I mean the are not deg-min-sec are they ?

Thanks...

No, because lines of longitude converge towards the poles. If your points are relatively close together, you can approximate the distance thus:

d = sqrt(pow(lat2-lat1, 2) + cos(lat1)*pow(lon2-lon1, 2))

If you need greater accuracy over large distances, there are several fancy formulae for computing great-circle distances, but I find it simpler to convert to 3D coordinates on a unit circle then do a simple pythagorean distance, followed by 2 sin^-1(d/2) to convert back to an angle (though I can understand that some might find not find this simpler, :-).