meta user
network profile
| bio | website | |
|---|---|---|
| location | Ottawa, Canada | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | Jul 26 '12 at 16:12 | |
| stats | profile views | 19 |
|
Jul 20 |
awarded | Yearling |
|
Oct 25 |
comment |
How to route over (partial) edges in pgrouting? Why would you have a lot of point? You compute the route between two points. If the user drag the polyline, it will happen on the client side, so it is not routing-dependant. When the user click on the polyline move it, and then stop moving the mouse, the route is recomputed between three points instead of two. So instead of having 1 route, I suspect what you should do is compute two different routes, and then merge the results. So for each route, you will only split edge between two points. Isn't it the flow you would want to use? |
|
Aug 18 |
answered | How to get an array of simple lines from one multipoint linestring in PostGIS? |
|
Aug 17 |
awarded | Critic |
|
Aug 11 |
comment |
Database design: road topology in GIS If you want to use PGRouting and Shooting Star, it is a nice tool, but you will need to dive into the code in order to solve a couple of bugs, you need to know that, but it is mainly logic, no hard core programming. Link for shooting star and rules : pgrouting.org/docs/foss4g2008/ch09.html |
|
Aug 11 |
comment |
Database design: road topology in GIS No routing engine manage such a thing as lane. For them, it only egdes that have attribute and relation between them. So you would need to know between wich segment you have thing kind of lanes (for example from A to B and from A to C), and then assign a cost between those two segments. In PGRouting, it would be done using the Shooting Star algoritm but you can also define turn cost in ArcGIS Network Analyst. |
|
Aug 11 |
answered | Database design: road topology in GIS |
|
Aug 4 |
comment |
What does pgRouting's architecture look like? Even if you don't know c, is that faster to reinvent the wheel? PGRouting already exists, and if you spend 2 days studying the source code, you will get how it works if you know some basic programming. What's more C and C++ are fast, and therefore perfect for this kind of work. I didn't know C when I started working with it, now I have a custom routing engine based on pg_routing that works well. Even with being good at Java and C#, there is no way I could have a done a work of the same quality in the same amount of time. Plus Java or C# would be slower. You should take that into consideration. |
|
Aug 3 |
answered | What does pgRouting's architecture look like? |
|
Aug 3 |
revised |
Which is the best way to store roads for the shortest path finding application? added 1 characters in body |
|
Aug 3 |
revised |
Which is the best way to store roads for the shortest path finding application? added 183 characters in body |
|
Aug 3 |
answered | Which is the best way to store roads for the shortest path finding application? |
|
Aug 2 |
answered | Practical way of managing polygons and unions of them |
|
Jul 29 |
comment |
Get all Nodes from a List of adjacent LineStrings in PostGIS ST_LineMerge won't do the job. ST_LineMerge — Returns a (set of) LineString(s) formed by sewing together a MULTILINESTRING. PGRouting send you back a list of linestring. Maybe GemUnion is the key. I'll check that if I can. |
|
Jul 29 |
revised |
Snap line layer to network in QGIS or PostGIS added 275 characters in body |
|
Jul 29 |
answered | Snap line layer to network in QGIS or PostGIS |
|
Jul 28 |
answered | How do I get a route between two points using PgRouting with TIGER2010 Data |
|
Jul 27 |
answered | How to change projection and show latitude / longitude in QGIS? |
|
Jul 22 |
awarded | Editor |
|
Jul 21 |
awarded | Supporter |
