calculating new gps coordinates given initial coordinate and *Small* range

I'm trying to figure out how to calculate a min/max lat/long bound on the specific given range of a gps coordinate.

for example: gps coord 37.42935699924869,-122.16962099075317 range .2 miles

I'm looking at the point + range + bearing in the http://www.movable-type.co.uk/scripts/latlong.html开发者_StackOverflow社区 site but im not sure if this is exactly what i want.

This gives 4 unique lat/long pairs and I want/need a max/min lat and a max/min long.

1. Calculate the distance between the (constant) central point and the point you want to test. (This page should give you the distance (in meters)).
2. If (distance < 0.2) then ...

Well, given a point and a distance, you will get a circle.

You're looking for two points, which will essentially describe a square (two opposite corners). The two points you're looking for won't even be on the circle. I'm not exactly sure why you want this, but I don't think there is an answer to your question.

Perhaps you could tell us what you're trying to accomplish.

EDIT: Added image to illustrate. The orange line is the distance from the centre (e.g. 0.2 miles)

alt text http://img155.imageshack.us/img155/1315/diagramp.png

After your clarification, here is a less elegant answer that might give you what you want. Well, you want the inverse of a really complicated function. I'm afraid my math skills aren't up to the task, but it should be doable.

A less elegant solution is to find it by trial and error. Essentially, keep longitude the same and vary latitude. Using the right algorithm, you should be able to find one that is very close to the distance you want. This will give you a point on the circle (one of four that is also on the square).

Then keep latitude the same and vary longitude. This will give you a second point on the square (on the middle of one of the sides), from there you can find the 4 corners of the square.

This will slow, depending on how often you have to do it, that might or might not matter.