本文介绍了如何使用Java计算给定经纬度坐标周围指定距离（例如50km）的正方形边界坐标。文章详细解释了公式，并提供了Java实现。注意，这里的目标是一个正方形，而非精确的圆形边界，适用于小范围（不超过150km）的距离计算，对精度要求不高，但追求效率。作者还指出了IronMan关于最大/最小经度公式的不准确性。
Given a coordinate (lat, long), I am trying to calculate a square bounding box that is a given distance (e.g. 50km) away from the coordinate. So as input I have lat, long and distance and as output I would like two coordinates; one being the south-west (bottom-left) corner and one being the north-east (top-right) corner. I have seen a couple of answers on here that try to address this question in Python, but I am looking for a Java implementation in particular.
Just to be clear, I intend on using the algorithm on Earth only and so I don't need to accommodate a variable radius.
It doesn't have to be hugely accurate (+/-20% is fine) and it'll only be used to calculate bounding boxes over small distances (no more than 150km). So I'm happy to sacrifice some accuracy for an efficient algorithm. Any help is much appreciated.
Edit: I should have been clearer, I really am after a square, not a circle. I understand that the distance between the center of a square and various points along the square's perimeter is not a constant value like it is with a circle. I guess what I mean is a square where if you draw a line from the center to any one of the four points on the perimeter that results in a line perpendicular to a side of the perimeter, then those 4 lines have the same length.
解决方案
I wrote an article about finding the bounding coordinates:
The article explains the formulae and also provides a Java implementation. (It also shows why IronMan's formula for the min/max longitude is inaccurate.)
扫一扫
234
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
