[GRASS-user] increase efficiency of analysis with r.grow.distance aka Euclidean allocation

[karsten]

Hi All,
 
I am working on a project that requires to find the middle boundary between
raster regions (of the same value) using a maximum buffer distance. The
raster input I am using is quite large like 5m resolution and 100000 by
100000 cells. One approach I took was to fill all cells in areas outside the
raster regions in question which I will need to buffer to NULL 
and then using the r.grow.distance in GRASS (similar to the Tool Euclidean
allocation in ArcGIS). 

This works with smaller files but with a big input like the one above
calculation time is very long or might crash even on a fast PC. The only
remedy I found (apart from throwing larger RAM or hardware at the task) 
so far was cutting up the raster file in tiles and running the analysis on
each tile and putting the results back afterwards to get to final result
layer.
 
Would anyone have hints if there are other approaches that I could increase
the efficiency of this analysis in GRASS or have any knowledge of other tool
sets such as R or python scripts that are already available for something
like this ?
 
Cheers
Karsten
 
Karsten Vennemann
 <http://www.terragis.net> www.terragis.net
 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/grass-user/attachments/20210128/73c0ff54/attachment.html>