2,637 reputation
614
bio website georepublic.info
location Osaka-shi, Japan
age
visits member for 4 years, 6 months
seen Mar 27 at 13:40

Working for Georepublic UG & Georepublic Japan


Mar
27
comment pgRouting. pgr_ksp() returns -1 as id3
Which version of pgRouting do you use? Because there was just recently a change, which was merged into "develop" branch but the documentation might be not updated yet.
Mar
27
answered pgrouting pgr_ksp with large dataset
Mar
22
answered How to fix pgr_dijkstra error, query must return columns 'id', 'source', 'target' and 'cost'?
Mar
22
revised How to fix pgr_dijkstra error, query must return columns 'id', 'source', 'target' and 'cost'?
make SQL readable
Mar
21
reviewed Approve How to georeference using GDAL tools?
Mar
20
answered What are the OSM 'class' cost settings for OSRM?
Mar
18
answered how to fix this ERROR: Start vertex was not found
Mar
18
comment OSM to pgRouting -missing attributes
Proper formatting and paragraphs make it easier to read your question. We take a time to answer your question, so we also expect that you take a time to ask properly! Capitalization: owl.english.purdue.edu/owl/resource/592/01
Mar
18
answered OSM to pgRouting -missing attributes
Mar
18
revised “linestringZ” kills “pgr_createTopology”
make the code readable
Feb
7
answered Find nearest node function
Feb
5
comment pgr_drivingdistance wrapper
Well, you cannot assume that the dist.id1 is source. It could be also target or it could be even both. I think your answer is still not correct. It would be better to use the vertices table, which you can create, if it doesn't exist yet: docs.pgrouting.org/2.0/en/src/common/doc/functions/…
Feb
5
comment pgr_drivingdistance wrapper
Does this answer make sense? You're joining edge ID's with node ID's. Node ID's in your network table are either source or target ID's.
Jan
19
comment Find closest points in routing network for a set of points to pick shortest route
You want to do this with a single query? I think it's easier to write a custom function. You can find an example in the pgRouting workshop: workshop.pgrouting.org/chapters/…
Jan
9
comment How to find routes between for each entry in a list of point pairs?
Maybe better for understanding: the core functions only use the required attributes, because every network data table may have different attributes. And line geometry is actually not necessary for a Dijkstra shortest path.
Jan
9
comment How to find routes between for each entry in a list of point pairs?
Correct. The "core" functions only return the path result as a list of edges. But you can join your result with the original table. Then you have access to all the attributes again, also the line geometry: workshop.pgrouting.org/chapters/…
Jan
9
comment instal pgrouting on postgres 9.3 + postgis 2.1
I tried it and also got this error. But it's a problem with UbuntuGIS PPA, not the pgRouting PPA.
Jan
9
revised UbuntuGIS packages on ppa.launchpad
changed title and tags
Jan
9
comment UbuntuGIS packages on ppa.launchpad
This has nothing to do with the pgRouting PPA. As the error message says, the UbuntuGIS PPA can't be fetched.
Jan
9
revised UbuntuGIS packages on ppa.launchpad
formatting