Distance computing (newbie asking help)

[Ronald Wiemer]

> 
> Hi people.
> 
> I started using GRASS 4.1 recently, and I think my problem is rather simple
> and must have been solved yet . This is a reason why I am asking now for
> some advices.
> 
> My prob is :
> 
> Given a vect file and a point, I would like to generate a rast file where
> each pix contains the minimal euclidian distance from this point to the set o
> f 
> vectors defined by the vect file.
> 
> Is there an already-existing function I could use ? In the other case,
> which primitives should I consider ?
> 

I suppose you can also rasterize the vectors, use r.buffer and 
invert the result.

Ronald Wiemer
R.O.B. / Archis
Kerkstraat 1
NL 3811 CV Amersfoort
The Netherlands

Tel: ++ 31 33 4634233
Fax: ++ 31 33 4653235