@lists.directionsmag.com
Subject: RE: MI-L Too difficult for any of you :-) 10 Minute WalkDiagram
Hey Greg
Thanks a lot. I get the gist of it and have been trying it out in the MI MB
window, but as yet I've had no results. A different slant on Tony's soln.
Will keep at it.
Cheer
on Greg's
soln. Will keep at it.
Cheers
Terry
-Original Message-
From: Photogrammetry GIU
[mailto:[EMAIL PROTECTED]
Sent: 27 September 2005 16:01
To: Terry McDonnell
Subject: RE: MI-L Too difficult for any of you :-) 10
MinuteWalkDiagram...Doughnut Factory (Low Cal)
function cook
Sent: 27 September 2005 16:01
To: Terry McDonnell
Subject: RE: MI-L Too difficult for any of you :-) 10 Minute WalkDiagram
Terry,
Me again! Someone asked a question a few days back about creating a
doughnut area based on a 10m external/internal buffer of a selected
polygon. I came up with this
7 September 2005 14:46
To: Terry McDonnell
Subject: RE: MI-L Too difficult for any of you :-) 10 Minute WalkDiagram
Terry
After a bit of head-scratching I've cobbled together an mbx that
generates this sort of diagram after selecting a point on th eroute map
and looking for a 300m (5 min) w
Hi Terry,
As others has pointed out, you need routing software for this problem. Our
solutions can do it as either polygon isochrones or as a "thematic
colouring" of the links, which may only go half way down the C-D link (2 min
+ the 3 min on the B-C link), so you get exactly 5 minutes.
Eve
i do public transport route planning and came upon this quandary a few years
ago. in the end it was too much hard yakka to bother so i ended up just
going with a given maximum walk distance and multiplying that by about 1.4
to account for average turns and routes needed to get from a to b, i found
Hi everyone.
Thanks to those who have replied on this matter. Hmmm, it really is a
bit of a faff. I had a word with my boss and he's happy just to take
the "cheap & cheerful" soln. of just describing concentric circles from
each bus stop.
Thanks again
Terry
---
er 2005 17:46
To: Terry McDonnell; mapinfo-l@lists.directionsmag.com
Subject: Re: MI-L Too difficult for any of you :-)
This sounds to me like a job for a basic route planning algorithm. I've
used these in java before and some (for example A* algorithm) are very
easy to implement. Bas
This sounds to me like a job for a basic route planning algorithm. I've used
these in java before and some (for example A* algorithm) are very easy to
implement. Basically they are usually used to find a route between two
specific locations but could be modified to only go a specific number of
