[GRASSLIST:677] Re: How to program a little script

GRASS GRASS user
1

First of all thank you for replying!
I studied r.cost and r.walk, but still can't find a solution...

I try to use r.cost for creating a cost map, but it doesn't recognize coordinates in the format xx:xx:xx.x (i.e. 81:27:41.1 -N-).
Anyway I don't know how (and if) that cost map can be used for what I need...

r.walk also seems to be useful, but I have troubles to realize which kind of cost map
is the more suitable.

Thank you again,
Antonio Giglio

Da: Hamish <hamish_nospam@yahoo.com>
Data: Fri, 7 Apr 2006 13:40:59 +1200
A: "giglio.antonio@katamail.com" <giglio.antonio@katamail.com>
Oggetto: [GRASSLIST:617] Re: How to program a little script

> I have to program a little script that, starting from 2 points (A and
> B) on a raster map (a DEM), calculate first 3 shortest going-down
> paths (from A to B). It seems to be easy, but this is the first time i
> try to program GRASS and I don't know how to proceed.

see r.cost, r.walk

Hamish

2

Hi,
On Wed, Apr 12, 2006 at 09:21:01AM +0000, giglio.antonio@katamail.com wrote:

First of all thank you for replying!
I studied r.cost and r.walk, but still can't find a solution...

I try to use r.cost for creating a cost map, but it doesn't recognize coordinates in the format xx:xx:xx.x (i.e. 81:27:41.1 -N-).
Anyway I don't know how (and if) that cost map can be used for what I need...

r.walk also seems to be useful, but I have troubles to realize which kind of cost map
is the more suitable.

Thank you again,
Antonio Giglio

x=$( echo "103:41:40.67756" | sed "s/:/d/" | sed "s/:/'/" )
y=$( echo "44d24'44.649041" | sed "s/:/d/" | sed "s/:/'/" )

newcoords=$( echo $x $y | cs2cs +proj=latlong +to -f "%.4f" +proj=latlong | awk 'printf("%f,%f",$1,$2);'

echo $newcoords

Jáchym

> Da: Hamish <hamish_nospam@yahoo.com>
> Data: Fri, 7 Apr 2006 13:40:59 +1200
> A: "giglio.antonio@katamail.com" <giglio.antonio@katamail.com>
> Oggetto: [GRASSLIST:617] Re: How to program a little script
>
> > I have to program a little script that, starting from 2 points (A and
> > B) on a raster map (a DEM), calculate first 3 shortest going-down
> > paths (from A to B). It seems to be easy, but this is the first time i
> > try to program GRASS and I don't know how to proceed.
>
>
> see r.cost, r.walk
>
>
>
> Hamish
>

--
Jachym Cepicky
e-mail: jachym.cepicky@centrum.cz
URL: http://les-ejk.cz
GPG: http://les-ejk.cz/gnupg_public_key/
-----------------------------------------
OFFICE:
Department of Geoinformation Technologies
LDF MZLU v Brnì
Zemìdìlská 3
613 00 Brno
e-mail: xcepicky@node.mendelu.cz
URL: http://mapserver.mendelu.cz
Tel.: +420 545 134 514