Quellcode durchsuchen

v.generalize manual: fix broken URLs

git-svn-id: https://svn.osgeo.org/grass/grass/trunk@64557 15284696-431f-4ddb-bdfa-cd5b030d7da7
Markus Neteler vor 10 Jahren
Ursprung
Commit
37bbc62ae4
1 geänderte Dateien mit 5 neuen und 5 gelöschten Zeilen
  1. 5 5
      vector/v.generalize/v.generalize.html

+ 5 - 5
vector/v.generalize/v.generalize.html

@@ -51,7 +51,7 @@ the degree of simplification increases with the increasing value of
 <li> <i>Douglas-Peucker</i> - "Quicksort" of line simplification, the 
 <li> <i>Douglas-Peucker</i> - "Quicksort" of line simplification, the 
      most widely used algorithm. Input parameters: <b>input</b>, 
      most widely used algorithm. Input parameters: <b>input</b>, 
      <b>threshold</b>. For more information, see: <br>
      <b>threshold</b>. For more information, see: <br>
-     <a href="http://geometryalgorithms.com/Archive/algorithm_0205/algorithm_0205.htm">http://geometryalgorithms.com/Archive/algorithm_0205/algorithm_0205.htm</a>.</li>
+     <a href="http://geomalgorithms.com/a16-_decimate-1.html">http://geomalgorithms.com/a16-_decimate-1.html</a>.</li>
 <li> <i>Douglas-Peucker Reduction Algorithm</i> is essentially the same 
 <li> <i>Douglas-Peucker Reduction Algorithm</i> is essentially the same 
      algorithm as the algorithm above, the difference being that it takes 
      algorithm as the algorithm above, the difference being that it takes 
      an additional <b>reduction</b> parameter which denotes the percentage 
      an additional <b>reduction</b> parameter which denotes the percentage 
@@ -61,7 +61,7 @@ the degree of simplification increases with the increasing value of
 <li> <i>Lang</i> - Another standard algorithm. Input parameters: 
 <li> <i>Lang</i> - Another standard algorithm. Input parameters: 
      <b>input</b>, <b>threshold</b>, <b>look_ahead</b>. 
      <b>input</b>, <b>threshold</b>, <b>look_ahead</b>. 
      For an excellent description, see:  <br>
      For an excellent description, see:  <br>
-     <a href="http://www.sli.unimelb.edu.au/gisweb/LGmodule/LGLangVisualisation.htm">http://www.sli.unimelb.edu.au/gisweb/LGmodule/LGLangVisualisation.htm</a>.</li>
+     <a href="https://web.archive.org/web/20090823022009/http://www.sli.unimelb.edu.au/gisweb/LGmodule/LGLangVisualisation.htm">http://www.sli.unimelb.edu.au/gisweb/LGmodule/LGLangVisualisation.htm</a>.</li>
 <li> <i>Vertex Reduction</i> - Simplest among the algorithms. Input 
 <li> <i>Vertex Reduction</i> - Simplest among the algorithms. Input 
      parameters: <b>input</b>, <b>threshold</b>.
      parameters: <b>input</b>, <b>threshold</b>.
      Given a line, this algorithm removes the points of this line which 
      Given a line, this algorithm removes the points of this line which 
@@ -69,11 +69,11 @@ the degree of simplification increases with the increasing value of
      p1 and p2 are two consecutive points, and the distance between p2 
      p1 and p2 are two consecutive points, and the distance between p2 
      and p1 is less than <b>threshold</b>, it removes p2 and repeats the 
      and p1 is less than <b>threshold</b>, it removes p2 and repeats the 
      same process on the remaining points.</li>
      same process on the remaining points.</li>
-<li> <i>Reuman-Witkam</i> - Input parameters: <b>input</b>, 
+<li> <i>Reumann-Witkam</i> - Input parameters: <b>input</b>, 
      <b>threshold</b>. 
      <b>threshold</b>. 
      This algorithm quite reasonably preserves the global characteristics 
      This algorithm quite reasonably preserves the global characteristics 
-     of the lines. For more information, see:  <br> 
-     <a href="http://www.ifp.uni-stuttgart.de/lehre/vorlesungen/GIS1/Lernmodule/Lg/LG_de_6.html">http://www.ifp.uni-stuttgart.de/lehre/vorlesungen/GIS1/Lernmodule/Lg/LG_de_6.html</a> (german).</li>
+     of the lines. For more information, see for example:<br> 
+     <a href="http://psimpl.sourceforge.net/reumann-witkam.html">http://psimpl.sourceforge.net/reumann-witkam.html</a>.</li>
 </ul>
 </ul>
 
 
 <i>Douglas-Peucker</i> and <i>Douglas-Peucker Reduction Algorithm</i> 
 <i>Douglas-Peucker</i> and <i>Douglas-Peucker Reduction Algorithm</i>