I am investigating the effects of newly constructed rural roads by constructing a least-cost path between villages and the nearest available road. Hence, I have to construct the least-cost paths between many points (the number of villages is 1584) and lines (nearest road). However, most of the tutorials are for only two points (one starting and one destination point). Do you have another video that discusses the implementation of the least-cost path between more than one starting and destination point?
soo, just in case someone else is interested: 1) download the least cost path plugin. 2) set it up with pyqgis. 3) have one layer with all end points 4) load all start points into individual layers and make a list of these layers (can be the same points as the end points) 5) loop over that list using every point as start point for the algorithm 6) merge the output layers. Not very elegant as you get many paths manyfold and need A LOT of computation, but it works. I'd still be very interested in better solutions ;)
For rdrain you chose cumulative cost, movement direction, and map coordinates for starting point from Stockholm, you did not choose an endpoint. How did the application know that you wanted to end in Prague after running the algorithm ? There were other capitals in the canvas extent.
I am investigating the effects of newly constructed rural roads by constructing a least-cost path between villages and the nearest available road. Hence, I have to construct the least-cost paths between many points (the number of villages is 1584) and lines (nearest road). However, most of the tutorials are for only two points (one starting and one destination point). Do you have another video that discusses the implementation of the least-cost path between more than one starting and destination point?
Hello..did you find a solution to your question?...I'm doing a research with multiple points but I'm stuck
Hey. i'd be very interested in the solution to that problem, too. Did you get anywhere?
soo, just in case someone else is interested: 1) download the least cost path plugin. 2) set it up with pyqgis. 3) have one layer with all end points 4) load all start points into individual layers and make a list of these layers (can be the same points as the end points) 5) loop over that list using every point as start point for the algorithm 6) merge the output layers. Not very elegant as you get many paths manyfold and need A LOT of computation, but it works. I'd still be very interested in better solutions ;)
th-cam.com/video/5pfJ2F2x4gs/w-d-xo.html
For rdrain you chose cumulative cost, movement direction, and map coordinates for starting point from Stockholm, you did not choose an endpoint. How did the application know that you wanted to end in Prague after running the algorithm ? There were other capitals in the canvas extent.
Late response but the cumulative cost layer and direction was already calculated towards the endpoint. That would be in minute 16:35
How can I reach you? I have some queries on creating cost surface.
thank you!!
11 new videos in a little over 1 hour! Please stop! I have to go to bed; its 4:30 AM in Toronto.
Sleep well you can watch the tomorrow ;-)