Timeline for Finding line with minimum distance to point and update attribute of points?
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 21, 2018 at 9:39 | vote | accept | applebrown | ||
Nov 30, 2017 at 7:25 | vote | accept | applebrown | ||
Nov 30, 2017 at 7:26 | |||||
Nov 29, 2017 at 16:55 | comment | added | applebrown | it worked! Thank you so much. Now I have successfully tried the Distance to neares hub- algorithm and as you said, I get the distances to the middle of the lines. So I would like to do this with v.distance-algorithm. Maybe you can help me out with this one too? I opened an other question because I have a problem in understanding of how to use this algorithm correctly: gis.stackexchange.com/questions/263508/… | |
Nov 29, 2017 at 15:32 | comment | added | 15Step | Follow these steps: 1) Start a new QGIS project 2) Drag your "EVIS_Stat_Sensorik..." layer first (EPSG: 31255), and make sure that after that on the bottom left of the QGIS interface it says EPSG: 31255 3) Drag your "tiger:graph" layer (it should then say OTF, too in the bottom-left corner). Then run the tool Reproject in the processing toolbox with Target CRS: 31255 4) Use this output layer as input for the algorithm you choose (Distance to nearest hub / v.distance) | |
Nov 29, 2017 at 15:09 | comment | added | applebrown | thanks for your suggestion! I tried it out and came to the conclusion that my problem is indeed the different CRS I use for each input layer. But the problem is: if the two input layers have the same CRS, the points are not overlaying correctly with the streets anymore! So how can I convert both input layers into one CRS so that they overlay correctly? I tried it out with both layers being in CRS EPSG:31255 and my output lines where somewhere in nowhere. I hope you understand my problem? | |
Nov 28, 2017 at 20:34 | history | edited | 15Step | CC BY-SA 3.0 |
added 431 characters in body
|
Nov 28, 2017 at 20:09 | history | answered | 15Step | CC BY-SA 3.0 |