Stephen V. Mather
svm at clevelandmetroparks.com
Wed Mar 19 06:40:44 PDT 2014
Looks awesome Ian,
I submitted an issue at https://github.com/iant1212/networkReach/issues/2 for adding a license to the repo.
[http://sig.cmparks.net/cmp-ms-90x122.png] Stephen V. Mather
(216) 635-3243 (Work)
From: pgrouting-users-bounces at lists.osgeo.org <pgrouting-users-bounces at lists.osgeo.org> on behalf of Ian Tangert <itangert at gmail.com>
Sent: Tuesday, March 18, 2014 9:05 PM
To: pgRouting users mailing list
Subject: Re: [pgrouting-users] Isochronous
Also there is a query at https://github.com/GregersP/networkReach that will do that (return edges based on nodes reached) and cover parts of segments when the cost distance goes beyond a node without reaching another node. It's based on pgr_drivingDistance() as mentioned. You might not need such a level of detail but it's worth a look and I'm always looking for ways to improve on it if you have any suggestions.
On Tue, Mar 18, 2014 at 1:45 PM, Daniel Kastl <daniel at georepublic.de<mailto:daniel at georepublic.de>> wrote:
On Wed, Mar 19, 2014 at 2:32 AM, Valeria Mu?oz <valemunoz at gmail.com<mailto:valemunoz at gmail.com>> wrote:
I need to develop a system to generate isochrones according to minutes, you can make this with postgis and how?
The function "pgr_drivingDistance" returns all nodes that can be reached from a start point within a certain "cost" (ie. time) and it also returns the time need to get to each of these nodes:
The function "pgr_pointsAsPolygon" then returns a polygon that includes a set of points:
The argument is a SQL statement, so if you need isochrones you could run it for each isoline.
Georepublic UG & Georepublic Japan
eMail: daniel.kastl at georepublic.de<mailto:daniel.kastl at georepublic.de>
Pgrouting-users mailing list
Pgrouting-users at lists.osgeo.org<mailto:Pgrouting-users at lists.osgeo.org>
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Pgrouting-users