[GRASS-SVN] r34313 - in grass: branches/develbranch_6/raster trunk/raster/r.grow.distance

[svn_grass at osgeo.org]

Author: hamish
Date: 2008-11-16 01:46:28 -0500 (Sun, 16 Nov 2008)
New Revision: 34313

Removed:
   grass/trunk/raster/r.grow.distance/r.grow.distance.html
Modified:
   grass/branches/develbranch_6/raster/Makefile
Log:
add r.grow.distance from trunk

Modified: grass/branches/develbranch_6/raster/Makefile
===================================================================
--- grass/branches/develbranch_6/raster/Makefile	2008-11-15 23:09:35 UTC (rev 34312)
+++ grass/branches/develbranch_6/raster/Makefile	2008-11-16 06:46:28 UTC (rev 34313)
@@ -25,6 +25,7 @@
 	r.fill.dir \
 	r.flow \
 	r.grow2 \
+	r.grow.distance \
 	r.gwflow \
 	r.his \
 	r.in.arc \

Deleted: grass/trunk/raster/r.grow.distance/r.grow.distance.html
===================================================================
--- grass/trunk/raster/r.grow.distance/r.grow.distance.html	2008-11-15 23:09:35 UTC (rev 34312)
+++ grass/trunk/raster/r.grow.distance/r.grow.distance.html	2008-11-16 06:46:28 UTC (rev 34313)
@@ -1,87 +0,0 @@
-<h2>DESCRIPTION</h2>
-
-
-<em>r.grow.distance</em> generates a raster map representing the
-distance to the nearest non-null cell in the input map.
-
-<h2>NOTES</h2>
-The user has the option of specifying four different metrics which
-control the geometry in which grown cells are created, (controlled by
-the <b>metric</b> parameter): <i>Euclidean</i>, <i>Squared</i>,
-<i>Manhattan</i>, and <i>Maximum</i>.
-
-<p>
-
-The <i>Euclidean distance</i> or <i>Euclidean metric</i> is the "ordinary" distance 
-between two points that one would measure with a ruler, which can be 
-proven by repeated application of the Pythagorean theorem. 
-The formula is given by: 
-
-<div class="code"><pre>d(dx,dy) = sqrt(dx^2 + dy^2)</pre></div>
-
-Cells grown using this metric would form isolines of distance that are
-circular from a given point, with the distance given by the <b>radius</b>.
-
-<p>
-The <i>Squared</i> metric is the <i>Euclidean</i> distance squared,
-i.e. it simply omits the square-root calculation. This may be faster,
-and is sufficient if only relative values are required.
-
-<p>
-
-The <i>Manhattan metric</i>, or <i>Taxicab geometry</i>, is a form of geometry in 
-which the usual metric of Euclidean geometry is replaced by a new 
-metric in which the distance between two points is the sum of the (absolute) 
-differences of their coordinates. The name alludes to the grid layout of 
-most streets on the island of Manhattan, which causes the shortest path a 
-car could take between two points in the city to have length equal to the
-points' distance in taxicab geometry.
-The formula is given by:
-
-<div class="code"><pre>d(dx,dy) = abs(dx) + abs(dy)</pre></div>
-
-where cells grown using this metric would form isolines of distance that are
-rhombus-shaped from a given point. 
-
-<p>
-
-The <i>Maximum metric</i> is given by the formula
-
-<div class="code"><pre>d(dx,dy) = max(abs(dx),abs(dy))</pre></div>
-
-where the isolines of distance from a point are squares.
-
-
-<h2>EXAMPLE</h2>
-
-Spearfish sample dataset
-<div class="code"><pre>
-r.grow.distance in=roads out=dist_from_roads
-</pre></div>
-
-
-<h2>SEE ALSO</h2>
-
-<em>
-<a href="r.grow.html">r.grow</a><br>
-<a href="r.buffer.html">r.buffer</a><br>
-<a href="r.cost.html">r.cost</a><br>
-<a href="r.patch.html">r.patch</a>
-</em>
-
-<p>
-
-<em>
-<a href="http://en.wikipedia.org/wiki/Euclidean_metric">Wikipedia Entry:
-    Euclidean Metric</a><br>
-<a href="http://en.wikipedia.org/wiki/Manhattan_metric">Wikipedia Entry:
-    Manhattan Metric</a>
-</em>
-
-
-<h2>AUTHORS</h2>
-
-Glynn Clements
-
-<p>
-<i>Last changed: $Date$</i>