Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I want to use Google Maps API to draw an area around a particular point on the map where a person can walk to within X minutes. In other words, how can you find all the places one can travel from a given point within a user defined period of time?
Here is ready-to-copy solution: http://maps.forum.nu/gm_driving_radius.html#. An alternative near perfect solution is to use a space-filling-curve or a spatial-index. A sfc reduce the 2d complexity to a 1d complexity and it’s an approximation algorithm not a heuristic. With a sfc it should be a guarantee of 1/4 to find all the points in the euklidian space.
