[SoC] Powers application (SoC site timing out...)

[Wolf Bergenheim]

It is highest because two people have given it +2 (plus I'm offering to
mentor it). And it does add something new, since r.cost + r.drain
produces something which works for water. Water doesn't know that if I
go over this little hill it's all down hill from there, but instead it
goes around the whole hill. What is proposed by Bobby is a version that
can calculate the global least cost. That is it can go over local
minimums to achieve a global maximum, kind of like going over a small
hill to get to the all downhill. example above.

However if you still feel that it is rubbish you should probably vote
-2, or something for it.

--Wolf

On 26.03.2007 17:32, Tim Keitt wrote:
> Hi All,
> 
> I tried to add a comment to the SoC site, but it is timing out.
> 
> I was curious about the Bobby Powers least-cost path application. It
> is currently the highest rated. From the description, it does not seem
> to add anything new. Can't this already be done with r.cost and
> r.drain? (I may have missed the point however -- I've not used GRASS
> in a long time.)
> 
> THK
> 

-- 

<:3 )---- Wolf Bergenheim ----( 8:>