Ignore:
Timestamp:
09/20/06 13:36:10 (18 years ago)
Author:
pinsard
Message:

introducing hyperlinks in idldoc outputs (2/2)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/SRC/Documentation/idldoc_assistant_output/ToBeReviewed/TRIANGULATION/definetri.html

    r177 r187  
    6666 the points are regulary-gridded on nx*ny array. 
    6767 Find a Delaunay triangulation for this set of points is easy: 
    68  Points define (nx-1)*(ny-1) rectangles which we can cut in 2 
    69  triangles. cf. figure above 
     68 Points define (nx-1)*(ny-1) rectangles which we can cut in 2 triangles.  
     69 cf. figure above 
    7070 
    7171<pre style="font-family: Courier;"> 
     72 fixe 
    7273      ny-1*---*---*. . . . . .*---*---* 
    7374          |  +|  +|           |  +|  +|       
     
    113114 
    114115    <h3>Return value</h3> 
    115  triangles is a 2d array and is dimensions are 3 and 
    116  2*(nx-1)*(ny-1) 
    117  triangles is define like in the TRIANGULATE procedure. 
     116 triangles is a 2d array and its dimensions are 3 and 2*(nx-1)*(ny-1). 
     117 triangles is defined like in the TRIANGULATE procedure. 
    118118 
    119119 
     
    169169 
    170170     
    171  When downward is undefine all rectangles are cut 
    172  in using the upward diagonal. Downward is a vector which 
    173  contains the rectangles numbers which are cut in using the 
    174  downward diagonal. 
    175  The rectangle number is define by the index (in a nx*ny 
    176  vector) of the lower-left corner of the rectangle. 
     171 When downward is undefine all rectangles are cut in using the upward  
     172 diagonal.  
     173 Downward is a vector which contains the rectangles numbers which are cut in  
     174 using the downward diagonal. 
     175 The rectangle number is defined by the index (in a nx*ny vector) of the  
     176 lower-left corner of the rectangle. 
    177177 
    178178     
     
    183183    <h3>Examples</h3> 
    184184 
    185  triangles=definetri(3,3,[1,3]) 
    186  triangles will be a this kind of triangulation: 
     185 IDL> triangles=definetri(3,3,[1,3]) 
     186 triangles will be this kind of triangulation: 
    187187 
    188188          *---*---* 
    189            |+  |  +| 
    190            | + | + | 
    191            |  +|+  | 
     189          |+  |  +| 
     190          | + | + | 
     191          |  +|+  | 
    192192          *---*---* 
    193            |  +|+  | 
    194            | + | + | 
    195            |+  |  +| 
     193          |  +|+  | 
     194          | + | + | 
     195          |+  |  +| 
    196196          *---*---* 
    197197 
     
    200200     
    201201    <h4>Version</h4> 
    202  $Id: definetri.pro 163 2006-08-29 12:59:46Z navarro $ 
     202 $Id: definetri.pro 186 2006-09-20 10:50:37Z pinsard $ 
    203203    <h4>History</h4> 
    204204 sebastien Masson (smlod@ipsl.jussieu.fr) 
     
    227227     
    228228 
    229     <p><font color="gray" size="-3">&nbsp;&nbsp;Produced by IDLdoc 2.0 on Wed Sep 13 16:33:00 2006.</font></p> 
     229    <p><font color="gray" size="-3">&nbsp;&nbsp;Produced by IDLdoc 2.0.</font></p> 
    230230 
    231231  </body> 
Note: See TracChangeset for help on using the changeset viewer.