[GRASS-dev] Multi-threading and use of multiple processors

Jyothish Soman jyothish.soman at gmail.com
Sat Apr 11 17:23:57 EDT 2009


Well actually, the paper is in GIS terms what has been given in my reference
in graph theoretical terms.
Can somebody tell me how exactly are r.cost and r.terraflow different, in
terms of cost of traversal between two pixels?

On Sun, Apr 12, 2009 at 2:10 AM, Markus Neteler <neteler at osgeo.org> wrote:

> On Sat, Apr 11, 2009 at 10:23 PM, Jyothish Soman
> <jyothish.soman at gmail.com> wrote:
> ...
> > The assumption I am making is that the algorithm for r.cost is closely
> > related to dijkstra's algorithm.
>
> Just a note:
> in GRASS-Addons is a new module (r.terracost which uses this approach):
>
> http://trac.osgeo.org/grass/browser/grass-addons/raster/r.terracost
>
> http://trac.osgeo.org/grass/browser/grass-addons/raster/r.terracost/description.html
>
> Markus
>



-- 
JYOTHISH SOMAN
MS-2008-CS
Center for Security, Theory And Algorithm Research (CSTAR)
International Institute of Information Technology
Hyderabad
India
Phone:+91-9966222626
http://www.iiit.ac.in/
--------------------------------------------------------------
The reasonable man adapts himself to the world; the unreasonable one
persists in trying to adapt the world to himself. Therefore, all progress
depends on the unreasonable man.
   George Bernard Shaw
--------------------------------------------------------
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.osgeo.org/pipermail/grass-dev/attachments/20090412/76a9a4ca/attachment.html


More information about the grass-dev mailing list