> distance = square root ( (x2 - x1) squared + (y2-y1) squared )) Sure, but that doesn't work well for lat/long coordinates. Haversine Formula is generally used.
> Note that you need to do this arithmetic for every point that's within > the square (lowest x, lowest y) to (highest x, highest y), but you can > do this query in SQL and then eliminate the ones outside the circle. Yes, if searching a large database a simple "bounding box" query can be used to give candidates for more complicated further testing. -- You received this message because you are subscribed to the Google Groups "Google Maps JavaScript API v3" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-maps-js-api-v3?hl=en.
