Hi Simon,
Have you looks at pgRouting? It does the drivetime analysis. Once you
have the cost to get to each node in the network, you can use the cost
as a Z value of each XY of each node in the graph. You can then use
these XYZ points to build a triangluar surface in 3D where Z represents
the time. If you slice the triangles based on constant Z-levels you will
get the edges of the polygon. But all of this requires a lot of post
processing of the pgRouting results.
You might be able to do the whole thing, routing, and isochronal
polygons in Grass.
-Steve
_______________________________________________
postgis-users mailing list
postgi...@postgis.refractions.net
http://postgis.refractions.net/mailman/listinfo/postgis-users
You can try to use Driving Distance function of pgRouting
(http://pgrouting.postlbs.org/wiki/DrivingDistance) - this is exactly
what you need.
Anton.
Yes, you can process the result of core Driving Distance function with
Convex Hull function of PostGIS or with point_as_polygon function of
pgRouting, but there is a wrapper around this core function already
which returns you a polygon
(http://pgrouting.postlbs.org/browser/trunk/extra/driving_distance/sql/routing_dd_wrappers.sql#L78)
right away.
Anton.