Hi everyone,
We are looking for a way to transform the r.walk output into a nearest neighbor by cost map, i.e. something like the 'nearest' output of r.cost.
Does anyone have an idea of how this could be done with the existing tools ?
A related question @Markus: As you know r.cost & r.walk the best, how difficult would it be to include a 'nearest' option also in r.walk ?
Moritz
Hi Moritz,
On Wed, Apr 10, 2019 at 4:16 PM Moritz Lennert <mlennert@club.worldonline.be> wrote:
Hi everyone,
We are looking for a way to transform the r.walk output into a nearest
neighbor by cost map, i.e. something like the ‘nearest’ output of r.cost.
Does anyone have an idea of how this could be done with the existing tools ?
A related question @Markus: As you know r.cost & r.walk the best, how
difficult would it be to include a ‘nearest’ option also in r.walk ?
not so difficult: done in trunk r74367.
Markus M
On 11/04/19 09:36, Markus Metz wrote:
Hi Moritz,
On Wed, Apr 10, 2019 at 4:16 PM Moritz Lennert <mlennert@club.worldonline.be <mailto:mlennert@club.worldonline.be>> wrote:
>
> Hi everyone,
>
> We are looking for a way to transform the r.walk output into a nearest
> neighbor by cost map, i.e. something like the 'nearest' output of r.cost.
>
> Does anyone have an idea of how this could be done with the existing tools ?
>
> A related question @Markus: As you know r.cost & r.walk the best, how
> difficult would it be to include a 'nearest' option also in r.walk ?
not so difficult: done in trunk r74367.
Behold Markus "Lucky Luke" Metz who codes faster than his shadow !
Thanks a lot !
Moritz