Raffaello Brondi wrote: > > This is not very efficient, and more like 'g.region zoom=', but you could > > do: > > > > g.region rast=map1,map2 > > r.mapcalc 'intersect= if(!isnull(map1) && !isnull(map2), 1, null())' > > g.region zoom=intersect > > g.remove intersect > > > > > > But probably Wolf's method is what you want. > > This is the solution i need :).
No it isn't. You should be using Wolf's approach and computing the intersection yourself. However, rather than using "g.region rast=... ; g.region -p", it's simpler to just use "r.info -sg map=...". Creating a whole new map just so that you can find its bounds is gratuitously inefficient. -- Glynn Clements <[EMAIL PROTECTED]> _______________________________________________ grassuser mailing list [email protected] http://grass.itc.it/mailman/listinfo/grassuser
