<br><br><div class="gmail_quote">On Tue, Jan 31, 2012 at 8:53 PM, Dave Potts <span dir="ltr"><<a href="mailto:dave.potts@pinan.co.uk">dave.potts@pinan.co.uk</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<br>
Many Thanks Steve, much clearer,<br>
<br>
The Google Summer of code solutions, do they work ?<br>
<br>
<br>
I am trying to work out how to use the Driving Distance version, the one<br>
documented at <a href="http://www.pgrouting.org/docs/1.x/dd.html" target="_blank">http://www.pgrouting.org/docs/1.x/dd.html</a></blockquote><div><br></div><div><br></div><div>Hi Dave,</div><div><br></div><div>The documentation only contains the "core" functions. For convenience there are additional functions in separate .sql files, that we call "wrapper" functions. They are sometimes more convenient and easy to use, but they often contain assumptions like ID column must be named "gid" for example, etc..</div>
<div><br></div><div>I must admit that there is no standard way how these wrapper are written, because they were just added as examples at that time. Unfortunately nobody took the time to organize them in better way and add them to the documentation.</div>
<div><br></div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><br>
<br>
I am confused as to what the distance function should be set up, but the page<br>
<br>
<a href="http://underdark.wordpress.com/2011/05/13/catchment-areas-with-pgrouting-driving_distance/" target="_blank">http://underdark.wordpress.com/2011/05/13/catchment-areas-with-pgrouting-driving_distance/</a><br>
<br>
Is very helpful which describes this value as<br>
<br>
'the only new value is “distance”. That’s the maximum distance/cost you<br>
want to be contained in the result set. “distance” has to be specified in<br>
the same units as the cost attribute (which is specified in the “sql” text<br>
parameter).'<br></blockquote><div><br></div><div>There are several attributes or parameters that depend on your projection unit. assign_vertex_id function has a "snapping" parameters that cares about the unit. And shortest path wrapper functions do this, too. I think it's also mentioned in the pgRouting tutorial.</div>
<div><br></div><div>This wrapper for example (undocumented, sorry!) has the same name as the driving_distance function, but you pass different parameters: <a href="https://github.com/pgRouting/pgrouting/blob/master/extra/driving_distance/sql/routing_dd_wrappers.sql#L78">https://github.com/pgRouting/pgrouting/blob/master/extra/driving_distance/sql/routing_dd_wrappers.sql#L78</a></div>
<div>Instead of a set of point ID's with costs it returns a polygon geometry.</div><div>In this wrapper function the "distance" is also used to select only a bounding box area of the network data. Therefor "distance" and "cost" need to be in the same unit as your projection. Otherwise it's like you said, that distance and cost can be anything, but need to be in the same unit.</div>
<div><br></div><div>Daniel</div><div><br></div><div><br></div><div><br></div><div><br></div><div><br></div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<br>
Dave.<br>
Stephen Woodbridge wrote:<br>
> On 1/30/2012 5:26 PM, Dave Potts wrote:<br>
>><br>
>> Is there a generic introduction which list what each of the route method<br>
>> does and why I would what to use it with a given data set/<br>
><br>
> There is a tutorial<br>
> <a href="http://www.pgrouting.org/docs/foss4g2008/index.html" target="_blank">http://www.pgrouting.org/docs/foss4g2008/index.html</a><br>
> and here is my assessment:<br>
><br>
> Dijkstra solution:<br>
> This is a node based solution that converts a graph into a tree and the<br>
> tree has all nodes that are reachable from the start node. This is used<br>
> in the driving distance solution and has other applications where you<br>
> might want the cost to get to multiple node. The default output is to<br>
> only return that path from the start node to the destination node.<br>
><br>
> Astar search solution:<br>
> This is a modified Dijkstra solver that uses a Heuristic to direct the<br>
> solver to the destination node. As a result, the graph solution is<br>
> typically faster the Dijkstra because you only have to solve part of the<br>
> graph needed to find the solution.<br>
><br>
> ShootingStar solution:<br>
> This is an edge based solver. IT IS CURRENT BROKEN! and as best as I can<br>
> tell the last version that worked is v1.03. It is current running<br>
> significantly (2-4x slower than the above two solutions). The reason it<br>
> was created was because it support turn restrictions.<br>
><br>
> These are the main three solvers.<br>
><br>
> We just added a new branch TRSP (turn restricted shortest pat<br>
<br>
_______________________________________________<br>
Pgrouting-users mailing list<br>
<a href="mailto:Pgrouting-users@lists.osgeo.org">Pgrouting-users@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-users" target="_blank">http://lists.osgeo.org/mailman/listinfo/pgrouting-users</a><br>
</blockquote></div><br><br clear="all"><div><br></div>-- <br><span style="font-family:arial,sans-serif;font-size:13px;border-collapse:collapse">Georepublic UG & Georepublic Japan<br>eMail: <a href="mailto:daniel.kastl@georepublic.de" style="color:rgb(66,99,171)" target="_blank">daniel.kastl@georepublic.de</a><br>
Web: <a href="http://georepublic.de/" style="color:rgb(66,99,171)" target="_blank">http://georepublic.de</a></span><br>