On 01/08/2009, Rossko <[email protected]> wrote: > > > It takes out a bunch of points from a database and then > > calculates the distance to all of them before finding out which is the > > shortest . So at times there are from 51 to 500 requests that are sent > > > Sounds like a poor strategy. Maybe much less overhead to use simple > straight-line calculations to eliminate all but the closest ten or so > for full examination by route.
Agreed. A steight line route can never be longer than the road route. The main reason to use a road route is to note 'bad' results, say ones physically close, but seperated by a river without a bridge. So start with the close physical, and calculate their road distance, then move them out, continue until you have 10 results within the required distance. (You could also delay calculating the road route - until someone actully visits the next page of results - and then move any with a significantly longer route) > > > > > -- Barry - www.nearby.org.uk - www.geograph.org.uk - --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Maps API" 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-API?hl=en -~----------~----~----~----~------~----~------~--~---
