Thessian Polygons

[Richard Beecham]

In the meantime there is an alterative way of doing them using
s.surf.idw. Give one site at a time a value of say 100, and all the others
0. Then use r.mapcalc or r.combine to determine which site gives each cell
the highest value (weighting), and assign that cell to the particular
site.  This works OK for a small number of sites, although If you had many
sites it may prove to be CBS (character building stuff!).

Merry Christmas to all.

On Fri, 17 Dec 1993, Darrell McCauley wrote:

> Martin Ameskamp (ma at informatik.uni-kiel.d400.de) writes on 16 Dec 93:
> >> Can some kind soul please tell me how
> >> to generate Thessian Polygons from 
> >> point data (raster or site) using
> >> GRASS.
> 
> >	GRASS has a routine for doing this that is called s.voronoi
> >	(from src.contrib/PURDUE/s.voronoi). It seems to have a couple of
> >	problems, though.
> 
> yes, the problem at the edges is on the "to-do" list. Maybe after final
> exams...
> 
> --Darrell