Changeset 338 for trunk/SRC/Documentation/idldoc_assistant_output/ToBeReviewed/TRIANGULATION/definetri.html

Timestamp:

03/20/08 23:06:02 (16 years ago)

Author:

smasson

Message:

update documentation

File:

• trunk/SRC/Documentation/idldoc_assistant_output/ToBeReviewed/TRIANGULATION/definetri.html (modified) (4 diffs)

trunk/SRC/Documentation/idldoc_assistant_output/ToBeReviewed/TRIANGULATION/definetri.html

@@ -62 +62 @@
 
     
- Define a triangulation array like <a href="/Applications/rsi/idl_6.3/help/online_help/TRIANGULATE.html">TRIANGULATE</a>.
-         But in a VERY SIMPLE CASE:
+ Define a triangulation array like <a href="/Applications/itt/idl64/help/online_help/TRIANGULATE.html">TRIANGULATE</a>.
+
+ But in a VERY SIMPLE CASE:
  the points are regularly-gridded on nx*ny array.
  Find a Delaunay triangulation for this set of points is easy:
  Points define (nx-1)*(ny-1) rectangles which we can cut in 2 triangles.
+
  cf. figure above
 
 <pre>
- fixe
       ny-1*---*---*. . . . . .*---*---*
           |  +|  +|           |  +|  +|
@@ -169 +170 @@
 
     
- When DOWNWARD is undefined all rectangles are cut in using the upward
+ When downward is undefined all rectangles are cut in using the upward
  diagonal.
- DOWNWARD is a vector which contains the rectangles numbers which are cut in
+ downward is a vector which contains the rectangles numbers which are cut in
  using the downward diagonal.
  The rectangle number is defined by the index (in a nx*ny vector) of the
@@ -184 +185 @@
 
  IDL> triangles=definetri(3,3,[1,3])
+
  triangles will be this kind of triangulation:
 
+<pre>
           *---*---*
           |+  |  +|
@@ -196 +199 @@
           *---*---*
 
+<pre>
 
     </pre><h3>Version history</h3>
     
     <h4>Version</h4>
- $Id: definetri.pro 297 2007-09-25 15:09:12Z pinsard $
+ $Id: definetri.pro 325 2007-12-06 10:04:53Z pinsard $
     <h4>History</h4>
  sebastien Masson (smlod@ipsl.jussieu.fr)