[2] | 1 | ;+ |
---|
| 2 | ; |
---|
[150] | 3 | ; @file_comments |
---|
| 4 | ; Construct the triangulation array. |
---|
[2] | 5 | ; |
---|
[226] | 6 | ; The idea is: construct a list of triangle which link points between them. |
---|
[150] | 7 | ; This is automatically done by the function TRIANGULATE |
---|
| 8 | ; Here: |
---|
[226] | 9 | ; we consider the fact that points are disposed on a grid (regular or not, |
---|
| 10 | ; but not unstructured, that is to say that points are written following a |
---|
| 11 | ; rectangular matrix). A easy way to do triangles between all points is then: |
---|
[2] | 12 | ; |
---|
[163] | 13 | ; for each point (i,j) of the matrix -except those of the last line and of |
---|
[150] | 14 | ; the last column- we call rectangle (i,j) the rectangle made of the four |
---|
| 15 | ; points (i,j), (i+1,j), (i,j+1), (i+1,j+1). To trace all triangle, we just |
---|
| 16 | ; have to trace the 2 triangles contained in rectangles (i,j) |
---|
[2] | 17 | ; |
---|
[150] | 18 | ; We notice that each rectangle (i,j) have 2 diagonals (it is true... Make a |
---|
| 19 | ; drawing to make sure!!), so there are two possible choice for each rectangle |
---|
| 20 | ; we want to cut in 2 triangles... |
---|
[226] | 21 | ; |
---|
[150] | 22 | ; It is thanks to this choice that we will be able to trace coast with right |
---|
| 23 | ; angles. At each angle of coast remarkable by the existence of an unique land |
---|
| 24 | ; point or of an unique ocean point on one of the four summit of a rectangle (i,j), |
---|
| 25 | ; we have to cut the rectangle following the diagonal passing by this point. |
---|
[226] | 26 | ; |
---|
[150] | 27 | ; @categories |
---|
[157] | 28 | ; Graphics |
---|
[2] | 29 | ; |
---|
[163] | 30 | ; @param MASKENTREE {in}{optional}{type=2d array} |
---|
[226] | 31 | ; It is a 2d array which will serve to mask the field we will trace after with CONTOUR, |
---|
[2] | 32 | ; ...TRIANGULATION=triangule(mask) |
---|
[150] | 33 | ; If this argument is not specified, the function use tmask |
---|
[2] | 34 | ; |
---|
[150] | 35 | ; @keyword BASIC |
---|
| 36 | ; Specify that the mask is on a basic grid (use the triangulation for vertical cuts and hovmoellers) |
---|
[29] | 37 | ; |
---|
[150] | 38 | ; @keyword KEEP_CONT |
---|
| 39 | ; To keep the triangulation even on the continents |
---|
[2] | 40 | ; |
---|
[163] | 41 | ; @keyword COINMONTE {type=array} |
---|
[226] | 42 | ; To obtain the array of "ascending land corner" to be treated with |
---|
| 43 | ; completecointerre.pro in the variable array instead of make it pass by the global |
---|
[150] | 44 | ; variable twin_corners_up. |
---|
[29] | 45 | ; |
---|
[163] | 46 | ; @keyword COINDESCEND {type=array} |
---|
| 47 | ; See COINMONTE |
---|
[2] | 48 | ; |
---|
[150] | 49 | ; @returns |
---|
| 50 | ; res: tableau 2d (3,nbre de triangles). |
---|
[226] | 51 | ; Each line of res represent indexes of points constituting summits of a triangle. |
---|
[150] | 52 | ; See how we trace triangles in definetri.pro |
---|
[2] | 53 | ; |
---|
[150] | 54 | ; @uses |
---|
| 55 | ; common.pro |
---|
| 56 | ; different.pro |
---|
| 57 | ; definetri.pro |
---|
[2] | 58 | ; |
---|
[150] | 59 | ; @restrictions |
---|
[226] | 60 | ; Datas whose we want to do the contour must be disposed in a matrix. |
---|
| 61 | ; On the other hand, in the matrix, the points's arrangement can not be |
---|
[150] | 62 | ; irregular. If it is, use TRIANGULE. |
---|
[2] | 63 | ; |
---|
[150] | 64 | ; @history |
---|
[157] | 65 | ; Sebastien Masson (smasson\@lodyc.jussieu.fr) |
---|
[150] | 66 | ; 26/4/1999 |
---|
[2] | 67 | ; |
---|
[150] | 68 | ; @version |
---|
| 69 | ; $Id$ |
---|
[2] | 70 | ; |
---|
[150] | 71 | ; @todo |
---|
[226] | 72 | ; seb L.267->268 je ne pense pas que ce soit ce que tu voulais dire mais |
---|
[150] | 73 | ; c'est la traduction de ce qu'il y avait écrit. Correction si besoin. |
---|
[2] | 74 | ;- |
---|
[231] | 75 | ; |
---|
[29] | 76 | FUNCTION triangule_c, maskentree, COINMONTE = coinmonte, COINDESCEND = coindescend, BASIC = basic, KEEP_CONT = keep_cont |
---|
[114] | 77 | ; |
---|
[150] | 78 | compile_opt idl2, strictarrsubs |
---|
[114] | 79 | ; |
---|
[150] | 80 | tempsun = systime(1) ; For key_performance |
---|
[29] | 81 | ;--------------------------------------------------------- |
---|
| 82 | @cm_4mesh |
---|
[150] | 83 | IF NOT keyword_set(key_forgetold) THEN BEGIN |
---|
[29] | 84 | @updatenew |
---|
[150] | 85 | ENDIF |
---|
[2] | 86 | ;------------------------------------------------------------ |
---|
[150] | 87 | ; Is the mask given or do we have to take tmask? |
---|
[2] | 88 | ;------------------------------------------------------------ |
---|
| 89 | ; |
---|
[150] | 90 | msk = maskentree |
---|
| 91 | taille = size(msk) |
---|
| 92 | nx = taille[1] |
---|
| 93 | ny = taille[2] |
---|
[2] | 94 | ; |
---|
[150] | 95 | IF n_elements(keep_cont) EQ 0 THEN keep_cont = 1-key_irregular |
---|
[2] | 96 | ;------------------------------------------------------------ |
---|
[150] | 97 | if keyword_set(key_periodic)*(nx EQ jpi) $ |
---|
[226] | 98 | AND NOT keyword_set(basic) then BEGIN |
---|
[150] | 99 | msk = [msk, msk[0, *]] |
---|
| 100 | nx = nx+1 |
---|
| 101 | ENDIF |
---|
[2] | 102 | ;------------------------------------------------------------ |
---|
[226] | 103 | ; We will find the list of rectangles (i,j)(located by their left |
---|
| 104 | ; bottom corner) we have to cut following a descendant diagonal. |
---|
[150] | 105 | ; We will call this list : pts_downward |
---|
[226] | 106 | ; |
---|
[150] | 107 | pts_downward = 0 |
---|
[2] | 108 | |
---|
[150] | 109 | ; We construct the test which allow to find this triangle : |
---|
[2] | 110 | ; |
---|
| 111 | ; |
---|
| 112 | ; shift(msk, 0, -1)------------shift(msk, -1, -1) |
---|
| 113 | ; | | |
---|
| 114 | ; | | |
---|
| 115 | ; | | |
---|
| 116 | ; | | |
---|
| 117 | ; msk---------------------shift(msk, -1, 0) |
---|
| 118 | ; |
---|
[150] | 119 | sum1 = msk+shift(msk, -1, 0)+shift(msk, -1, -1) ;points which surround the left top point. |
---|
| 120 | sum2 = msk+shift(msk, 0, -1)+shift(msk, -1, -1) ;points which surround the right bottom point. |
---|
[2] | 121 | |
---|
| 122 | |
---|
[150] | 123 | tempdeux = systime(1) ; For key_performance =2 |
---|
| 124 | ; The left top land point surrounded by ocean points |
---|
| 125 | liste = where( (4-sum1)*(1-shift(msk, 0, -1)) EQ 1 ) |
---|
| 126 | if liste[0] NE -1 THEN pts_downward = [pts_downward,liste ] |
---|
| 127 | ; The left top ocean point surrounded by land points |
---|
| 128 | liste = where( (1-sum1)*shift(msk, 0, -1) EQ 1) |
---|
| 129 | if liste[0] NE -1 THEN pts_downward = [pts_downward,liste ] |
---|
| 130 | ; The right bottom land point surrounded by ocean points |
---|
| 131 | liste = where( (4-sum2)*(1-shift(msk, -1, 0)) EQ 1) |
---|
| 132 | if liste[0] NE -1 THEN pts_downward = [pts_downward,liste ] |
---|
| 133 | ; The right bottom ocean point surrounded by land points |
---|
| 134 | liste = where( (1-sum2)*shift(msk, -1, 0) EQ 1) |
---|
| 135 | if liste[0] NE -1 THEN pts_downward = [pts_downward,liste ] |
---|
| 136 | undefine, liste |
---|
[2] | 137 | ; |
---|
[150] | 138 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 139 | print, 'temps triangule: trouver pts_downward', systime(1)-tempdeux |
---|
[2] | 140 | ; |
---|
[150] | 141 | if (NOT keyword_set(basic)) OR keyword_set(coinmonte) OR keyword_set(coindescend) then begin |
---|
| 142 | tempdeux = systime(1) ; For key_performance =2 |
---|
| 143 | ;2 land points in ascendant diagonal with 2 ocean points in descendant diagonal. |
---|
| 144 | coinmont = where( (1-msk)*(1-shift(msk, -1, -1)) $ |
---|
| 145 | *(shift(msk, 0, -1)*shift(msk, -1, 0) EQ 1) ) |
---|
| 146 | if coinmont[0] NE -1 THEN pts_downward = [pts_downward, coinmont] |
---|
[2] | 147 | ; |
---|
[150] | 148 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 149 | print, 'temps triangule: trouver coinmont', systime(1)-tempdeux |
---|
| 150 | tempdeux = systime(1) ; pour key_performance =2 |
---|
[2] | 151 | ; |
---|
[150] | 152 | coindesc = where( ((1-shift(msk, 0, -1))*(1-shift(msk, -1, 0)) $ |
---|
| 153 | *msk*shift(msk, -1, -1) EQ 1) ) |
---|
[2] | 154 | ; |
---|
[150] | 155 | ;2 land points in descendant diagonal with 2 ocean points in ascendant diagonal. |
---|
| 156 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 157 | print, 'temps triangule: trouver coindesc', systime(1)-tempdeux |
---|
[2] | 158 | ; |
---|
[150] | 159 | ENDIF |
---|
[2] | 160 | ; |
---|
[226] | 161 | if n_elements(pts_downward) EQ 1 then BEGIN |
---|
[150] | 162 | tempdeux = systime(1) ; For key_performance =2 |
---|
[2] | 163 | ; |
---|
[150] | 164 | triang = definetri(nx, ny) |
---|
[2] | 165 | ; |
---|
[150] | 166 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 167 | print, 'temps triangule: definetri', systime(1)-tempdeux |
---|
| 168 | coinmont = -1 |
---|
| 169 | coindesc = -1 |
---|
[226] | 170 | ENDIF ELSE BEGIN |
---|
[150] | 171 | tempdeux = systime(1) ; For key_performance =2 |
---|
| 172 | pts_downward = pts_downward[1:n_elements(pts_downward)-1] |
---|
| 173 | pts_downward = pts_downward[uniq(pts_downward, sort(pts_downward))] |
---|
[226] | 174 | ; None rectangle can have an element of the last column or of the |
---|
[150] | 175 | ; last line as left bottom corner. |
---|
| 176 | ; so we have to remove these points if they has been selected in pts_downward. |
---|
[226] | 177 | derniere_colonne = (lindgen(ny)+1)*nx-1 |
---|
| 178 | derniere_ligne = lindgen(nx)+(ny-1)*nx |
---|
[150] | 179 | pts_downward =different(pts_downward,derniere_colonne ) |
---|
| 180 | pts_downward =different(pts_downward,derniere_ligne ) |
---|
| 181 | if (NOT keyword_set(basic)) OR keyword_set(coinmonte) OR keyword_set(coindescend) then begin |
---|
| 182 | if coinmont[0] NE -1 then begin |
---|
[2] | 183 | coinmont =different(coinmont,derniere_colonne ) |
---|
| 184 | coinmont =different(coinmont,derniere_ligne ) |
---|
[150] | 185 | endif |
---|
| 186 | if coindesc[0] NE -1 then begin |
---|
[2] | 187 | coindesc =different(coindesc,derniere_colonne ) |
---|
| 188 | coindesc =different(coindesc,derniere_ligne ) |
---|
[150] | 189 | endif |
---|
[226] | 190 | ENDIF ELSE BEGIN |
---|
[150] | 191 | coinmont = -1 |
---|
| 192 | coindesc = -1 |
---|
[226] | 193 | ENDELSE |
---|
[150] | 194 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 195 | print, 'temps triangule: menage ds pts_downward coinmont et coindesc', systime(1)-tempdeux |
---|
[2] | 196 | ; |
---|
[150] | 197 | tempdeux = systime(1) ; For key_performance =2 |
---|
| 198 | if pts_downward[0] EQ -1 then triang = definetri(nx, ny) $ |
---|
| 199 | ELSE triang = definetri(nx, ny, pts_downward) |
---|
| 200 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 201 | print, 'temps triangule: definetri', systime(1)-tempdeux |
---|
[226] | 202 | ENDELSE |
---|
[2] | 203 | ;------------------------------------------------------------ |
---|
[150] | 204 | ; We delete land points which only contain land points. |
---|
[2] | 205 | ;------------------------------------------------------------ |
---|
| 206 | ; |
---|
[226] | 207 | ; |
---|
[150] | 208 | if (NOT keyword_set(basic)) AND (NOT keyword_set(keep_cont)) then begin |
---|
| 209 | tempdeux = systime(1) ; For key_performance =2 |
---|
| 210 | ; We delete rectangles which are entirely in the land. |
---|
| 211 | recdsterre = where((1-msk)*(1-shift(msk, -1, 0))*(1-shift(msk, 0, -1))*(1-shift(msk, -1, -1)) EQ 1) |
---|
| 212 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 213 | print, 'temps triangule: tous les recdsterre', systime(1)-tempdeux |
---|
[2] | 214 | |
---|
[150] | 215 | ; We do an other sort : |
---|
| 216 | ; We have to do not remove rectangles which only have one common summit. |
---|
[2] | 217 | ; t1 = systime(1) |
---|
[150] | 218 | indice = intarr(nx, ny) |
---|
| 219 | trimask = intarr(nx, ny) |
---|
| 220 | trimask[0:nx-2, 0:ny-2] = 1 |
---|
[226] | 221 | IF recdsterre[0] NE -1 then BEGIN |
---|
[150] | 222 | tempdeux = systime(1) ; For key_performance =2 |
---|
| 223 | indice[recdsterre] = 1 |
---|
| 224 | if NOT keyword_set(basic) then begin |
---|
| 225 | vire1 = 0 |
---|
| 226 | vire2 = 0 |
---|
| 227 | while (vire1[0] NE -1 OR vire2[0] NE -1) ne 0 do begin |
---|
[226] | 228 | ; Delete rectangles we have to remove from recsterre (in fact those we have |
---|
| 229 | ; to keep although they are entirely in the land). |
---|
[150] | 230 | vire1 = where( (indice*shift(indice, -1, -1) $ |
---|
| 231 | *(1-shift(indice, 0, -1))*(1-shift(indice, -1, 0))*trimask) EQ 1) |
---|
[226] | 232 | if vire1[0] NE -1 THEN BEGIN |
---|
[150] | 233 | indice[vire1] = 0 |
---|
[2] | 234 | ; indice[vire1+nx+1] = 0 |
---|
[150] | 235 | endif |
---|
[226] | 236 | |
---|
[150] | 237 | vire2 = where( ((1-indice)*(1-shift(indice, -1, -1)) $ |
---|
| 238 | *shift(indice, 0, -1)*shift(indice, -1, 0)*trimask) EQ 1) |
---|
[226] | 239 | if vire2[0] NE -1 THEN BEGIN |
---|
[150] | 240 | indice[vire2+1] = 0 |
---|
[2] | 241 | ; indice[vire2+nx] = 0 |
---|
[150] | 242 | endif |
---|
| 243 | endwhile |
---|
| 244 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 245 | print, 'temps triangule: trier les recdsterre', systime(1)-tempdeux |
---|
| 246 | endif |
---|
| 247 | indice[*, ny-1] = 1 ; The last column and the last line |
---|
| 248 | indice[nx-1, *] = 1 ; can not define any rectangle. |
---|
[2] | 249 | ; |
---|
[150] | 250 | tempdeux = systime(1) ; For key_performance =2 |
---|
| 251 | recgarde = where(indice EQ 0) |
---|
| 252 | ; We recuperate numbers of triangles we will keep. |
---|
| 253 | trigarde = 2*[recgarde-recgarde/nx] |
---|
| 254 | trigarde = transpose(temporary(trigarde)) |
---|
| 255 | trigarde = [trigarde, trigarde+1] |
---|
[226] | 256 | ; |
---|
[150] | 257 | triang = triang[*, temporary(trigarde[*])] |
---|
| 258 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
[29] | 259 | print, 'temps triangule: virer les triangle de la liste', systime(1)-tempdeux |
---|
[150] | 260 | endif |
---|
| 261 | endif |
---|
[226] | 262 | ; print, 'temps tri triangles', systime(1)-t1 |
---|
[2] | 263 | ;------------------------------------------------------------ |
---|
[226] | 264 | ; When key_periodic equal 1, triang is a list of indexes's array which |
---|
[150] | 265 | ; have a surplus column. |
---|
[226] | 266 | ; We have to put it back to the initial matrix by putting indexes of |
---|
[150] | 267 | ; the last column equal to these of the last column... |
---|
[2] | 268 | ;------------------------------------------------------------ |
---|
[150] | 269 | tempdeux = systime(1) ; For key_performance =2 |
---|
| 270 | if keyword_set(key_periodic)*(nx-1 EQ jpi) $ |
---|
[226] | 271 | AND NOT keyword_set(basic) then BEGIN |
---|
[150] | 272 | indicey = triang/nx |
---|
| 273 | indicex = triang-indicey*nx |
---|
| 274 | nx = nx-1 |
---|
| 275 | liste = where(indicex EQ nx) |
---|
| 276 | if liste[0] NE -1 then indicex[liste] = 0 |
---|
| 277 | triang = indicex+nx*indicey |
---|
| 278 | nx = nx+1 |
---|
| 279 | if coinmont[0] NE -1 then begin |
---|
| 280 | indicey = coinmont/nx |
---|
| 281 | indicex = coinmont-indicey*nx |
---|
| 282 | nx = nx-1 |
---|
| 283 | liste = where(indicex EQ nx) |
---|
| 284 | if liste[0] NE -1 THEN indicex[liste] = 0 |
---|
| 285 | coinmont = indicex+nx*indicey |
---|
| 286 | nx = nx+1 |
---|
| 287 | endif |
---|
| 288 | if coindesc[0] NE -1 then begin |
---|
| 289 | indicey = coindesc/nx |
---|
| 290 | indicex = coindesc-indicey*nx |
---|
| 291 | nx = nx-1 |
---|
| 292 | liste = where(indicex EQ nx) |
---|
| 293 | if liste[0] NE -1 THEN indicex[liste] = 0 |
---|
| 294 | coindesc = indicex+nx*indicey |
---|
| 295 | nx = nx+1 |
---|
| 296 | endif |
---|
| 297 | endif |
---|
| 298 | IF testvar(var = key_performance) EQ 2 THEN $ |
---|
| 299 | print, 'temps triangule: finitions', systime(1)-tempdeux |
---|
[2] | 300 | |
---|
| 301 | ;------------------------------------------------------------ |
---|
[150] | 302 | if keyword_set(coinmonte) THEN coinmonte = coinmont ELSE twin_corners_up = coinmont |
---|
| 303 | if keyword_set(coindescend) THEN coindescend = coindesc ELSE twin_corners_dn = coindesc |
---|
[2] | 304 | ;------------------------------------------------------------ |
---|
[150] | 305 | IF NOT keyword_set(key_forgetold) THEN BEGIN |
---|
[29] | 306 | @updateold |
---|
[226] | 307 | ENDIF |
---|
[2] | 308 | |
---|
[226] | 309 | IF keyword_set(key_performance) THEN print, 'temps triangule', systime(1)-tempsun |
---|
[2] | 310 | |
---|
[150] | 311 | return, triang |
---|
[2] | 312 | |
---|
[226] | 313 | END |
---|