[GRASS-SVN] r36734 - grass/trunk/vector/v.net.visibility

[svn_grass at osgeo.org]

Author: neteler
Date: 2009-04-15 17:42:10 -0400 (Wed, 15 Apr 2009)
New Revision: 36734

Modified:
   grass/trunk/vector/v.net.visibility/v.net.visibility.html
Log:
HTML polished (still some odd wording)

Modified: grass/trunk/vector/v.net.visibility/v.net.visibility.html
===================================================================
--- grass/trunk/vector/v.net.visibility/v.net.visibility.html	2009-04-15 11:35:07 UTC (rev 36733)
+++ grass/trunk/vector/v.net.visibility/v.net.visibility.html	2009-04-15 21:42:10 UTC (rev 36734)
@@ -1,35 +1,49 @@
 <h2>DESCRIPTION</h2>
 
-<p><em>v.net.visibility</em> Computes the visibility graph of a vector map containing lines, areas ( boundaries ) and points. The visibility graph is the graph where the nodes are the end point of the lines, boundaries or simply the points. There is an edge between two nodes if they are 'visible'. Two nodes are visibible if there is no segments in between them, i.e. the edge doesn't intersect any line or boundary in the vector map. This is useful to compute the sortest path in a vector map from any two points. To do this, first you need to compute the visibility graph and from it compute the shortest path using v.net.path or d.path.
-</p>
+<em>v.net.visibility</em> computes the visibility graph of a vector
+map containing lines, areas (boundaries) and points. The visibility
+graph is the graph where the nodes are the end point of the lines,
+boundaries or simply the points. There is an edge between two nodes
+if they are 'visible'. Two nodes are visibible if there is no segments
+in between them, i.e. the edge doesn't intersect any line or boundary
+in the vector map. This is useful to compute the sortest path in a
+vector map from any two points. To do this, first you need to compute
+the visibility graph and from it compute the shortest path using
+<em>v.net.path</em> or <em>d.path</em>.
 
-<b>IMPORTANT : the algorithm doesn't work well with intersecting lines ( that includes overlapping )</b>
 
+<b>IMPORTANT : the algorithm doesn't work well with intersecting lines
+(that includes overlapping)</b>
+
 <p>
-If you compute a shortest path after computing the visibility graph you will notice that this path might go through a vertix of a line. If this is not wanted you might to run the map through <em>v.buffer</em> first whith a small value. Example:
+If you compute a shortest path after computing the visibility graph you
+will notice that this path might go through a vertix of a line. If this
+is not wanted you might to run the map through <em>v.buffer</em> first
+whith a small value. Example:
+
 <div class="code"><pre>
 v.buffer input=map output=bufferedmap buffer=1 type=point,line,area,boundary
 </pre></div>
 
-
 <p>
-The first argument is the input map. It supports lines, boudaries ( so areas ) and points. For the algorithm to work lines and boundaries must not be intersecting ( that includes overlapping ).
-<div class="code"><pre>
-input=map
-</pre></div>
+The first argument is the input map. It supports lines, boudaries (so areas)
+and points. For the algorithm to work lines and boundaries must not be
+intersecting (that includes overlapping).
+The result map containing the visibility graph is given in the output map.
 
-
-The result map containing the visibility graph is given in the output map
+If you need to add additional points to compute a shortest path between them
+afterwards you can use the <em>coordinate</em> parameter.
 <div class="code"><pre>
-output=map2
-</pre></div>
-
-
-If you need to add additional points to compute a shortest path between them afterwards you can use the <em>coordinate</em> parameter.
-<div class="code"><pre>
 coordinate=25556200,6686400,25556400,6686600
 </pre></div>
-where 25556200,6686400 are the coordinate of the first point and 25556400,6686600 are the coordinates of the second point. Of course you can give as many points as you want. They will be added to the visibility graph and edges from them will be computed. You can always add those points after computing the visibility graph. Simply use the <em>vis</em> parameter. The input will be the original vector map, the vis will be the computed visibility graph and the output the new visibility graph which will be the vis + the new points given with coordinate ( edges will be computed as well ).
+where 25556200,6686400 are the coordinate of the first point and 25556400,6686600
+are the coordinates of the second point. Of course you can give as many points as
+you want. They will be added to the visibility graph and edges from them will be
+computed. You can always add those points after computing the visibility graph.
+Simply use the <em>vis</em> parameter. The input will be the original vector map,
+the vis will be the computed visibility graph and the output the new visibility
+graph which will be the vis + the new points given with coordinate (edges will
+be computed as well).
 <div class="code"><pre>
 v.net.visibility input=map vis=vis_map output=new_vis_map coordinate=25556200,6686400,25556400,6686600
 </pre></div>
@@ -37,44 +51,49 @@
 <h2>EXAMPLE 1</h2>
 A simple example showing how to use the module
 <div class="code"><pre>
-v.net.visibility input=lines output=graph <br>
-d.vect graph <br>
-d.vect lines col=red <br>
+v.net.visibility input=lines output=graph
+d.vect graph
+d.vect lines col=red
 </pre></div>
 
 <h2>EXAMPLE 2</h2>
 An example on how to use <em>v.buffer</em> with the module 
 <div class="code"><pre>
 v.buffer input=lines output=buffered_lines buffer=1
-v.net.visibility input=buffered_lines output=graph <br>
-d.vect graph <br>
-d.vect lines col=red <br>
+v.net.visibility input=buffered_lines output=graph
+d.vect graph
+d.vect lines col=red
 </pre></div>
 
 
 <h2>EXAMPLE 3</h2>
-An example on how to use the coordinate parameter. This will compute the visibility graph of the vector map lines with the point 2555678,6686343
+An example on how to use the coordinate parameter. This will compute the
+visibility graph of the vector map lines with the point 2555678,6686343
 <div class="code"><pre>
 v.net.visibility input=lines output=graph coordinate=2555678,6686343<br>
-d.vect graph <br>
-d.vect lines col=red <br>
+d.vect graph
+d.vect lines col=red
 </pre></div>
 
 <h2>EXAMPLE 4</h2>
-An example on how to use the coordinate parameter with the vis parameter. Here the vector map graph is computed then a new visibility graph is computed from it with the point 2555678,6686343 extra
+An example on how to use the coordinate parameter with the vis parameter.
+Here the vector map graph is computed then a new visibility graph is computed
+from it with the point 2555678,6686343 extra
 <div class="code"><pre>
-v.net.visibility input=lines output=graph <br>
-d.vect graph <br>
-d.vect lines col=red <br>
-v.net.visibility input=lines vis=graph output=new_graph coordinate=2555678,6686343<br>
+v.net.visibility input=lines output=graph
+d.vect graph
+d.vect lines col=red
+v.net.visibility input=lines vis=graph output=new_graph coordinate=2555678,6686343
 d.erase
 d.vect new_graph
 d.vect lines col=red
 </pre></div>
 
 <h2>KNOWN BUGS</h2>
-In some cases when 3 points or nodes are collinear, some wrong edges are added. This happens only really rarly and shouldn't be a big problem.
-When two points have the exact same x coordinate and are visible, some wrong edges are added.
+In some cases when 3 points or nodes are collinear, some wrong edges are added.
+This happens only really rarly and shouldn't be a big problem.
+When two points have the exact same x coordinate and are visible, some wrong
+edges are added.
 
 <h2>SEE ALSO</h2>
 
@@ -88,6 +107,6 @@
 
 <h2>AUTHOR</h2>
 Maximilian Maldacker<br>
-Mentor : Wolf Bergenheim
+Mentor: Wolf Bergenheim
 
-<p><i>Last changed: $Date$ </i>
+<p><i>Last changed: $Date$</i>