| 1 |
C Copyright(C) 1999-2020 National Technology & Engineering Solutions |
| 2 |
C of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with |
| 3 |
C NTESS, the U.S. Government retains certain rights in this software. |
| 4 |
C |
| 5 |
C See packages/seacas/LICENSE for details |
| 6 |
|
| 7 |
SUBROUTINE RESTRY (MXND, K, K2, LXK, NXL, KXL, LXN, XN, YN, NUID, |
| 8 |
& NAVAIL, IAVAIL, NNN, DONE, ERR, NOROOM) |
| 9 |
C*********************************************************************** |
| 10 |
|
| 11 |
C SUBROUTINE RESTRY = TRY TO RESTRUCTURE K AND ONE OF ITS NEIGHBORS |
| 12 |
|
| 13 |
C*********************************************************************** |
| 14 |
|
| 15 |
C NOTE: |
| 16 |
C THE ELEMENT OPPOSITE THE LONGEST - OR IN SOME CASES THE SECOND |
| 17 |
C LONGEST - SIDE OF ELEMENT K WILL BE FOUND. |
| 18 |
C A RESTRUCTURE WILL ONLY BE DONE THEN IF |
| 19 |
C - THIS SAME SIDE IS THE LONGEST SIDE (OR NEARLY SO) |
| 20 |
C OF THE SECOND ELEMENT ALSO. |
| 21 |
C - NO ANGLES LARGER THAN 180 DEGREES ARE CREATED |
| 22 |
C - THE MAX AND AVERAGE Q - NUMBERS BOTH DECREASE |
| 23 |
C - AN AREA BREAKDOWN CONSISTENT WITH THE IMPROVEMENT |
| 24 |
C IN THE AVERAGE Q - NUMBER OCCURS |
| 25 |
|
| 26 |
C*********************************************************************** |
| 27 |
|
| 28 |
DIMENSION LXK (4, MXND), NXL (2, 3*MXND) |
| 29 |
DIMENSION KXL (2, 3*MXND), XN (MXND) |
| 30 |
DIMENSION YN (MXND), NUID (MXND), LXN (4, MXND) |
| 31 |
DIMENSION NSA (4), NSB (4), NSC (4), NSD (4) |
| 32 |
DIMENSION NS1 (4), AL1 (4), ANG1 (4) |
| 33 |
DIMENSION NS2 (4), AL2 (4), ANG2 (4) |
| 34 |
|
| 35 |
LOGICAL ERR, CCW, CAREA, IOKB, IOKF, IBGOOD |
| 36 |
LOGICAL IFGOOD, DONE, LSIDE, NOROOM |
| 37 |
|
| 38 |
DONE = .FALSE. |
| 39 |
ERR = .FALSE. |
| 40 |
PI = ATAN2(0.0, -1.0) |
| 41 |
PITOL = PI* (195. / 180.) |
| 42 |
|
| 43 |
C GET DATA FOR ELEMENT K |
| 44 |
|
| 45 |
CCW = .TRUE. |
| 46 |
CAREA = .FALSE. |
| 47 |
CALL GNXKA (MXND, XN, YN, K, NS1, AREA1, LXK, NXL, CCW) |
| 48 |
CALL QAAVAL (MXND, NS1, ANG1, QRAT1, DUMMY, XN, YN, CAREA) |
| 49 |
CALL CONDNO (MXND, NS1, QRAT1, SRAT1, COND1, AL1, XN, YN, LSIDE) |
| 50 |
|
| 51 |
C FIND LONGEST AND SECOND LONGEST SIDES, EXCLUDING BOUNDARY LINES |
| 52 |
|
| 53 |
S1MAX = - 1. |
| 54 |
L1MAX = 0 |
| 55 |
A1MAX = 0. |
| 56 |
S2MAX = - 1. |
| 57 |
DO 130 I = 1, 4 |
| 58 |
IF (AL1 (I) .GT. S2MAX) THEN |
| 59 |
N1 = NS1 (I) |
| 60 |
J = I + 1 |
| 61 |
IF (I .EQ. 4)J = 1 |
| 62 |
N2 = NS1 (J) |
| 63 |
DO 100 IL = 1, 4 |
| 64 |
L = LXK (IL, K) |
| 65 |
NODE = NXL (1, L) |
| 66 |
IF ( (NODE .EQ. N1) .OR. (NODE .EQ. N2)) THEN |
| 67 |
NODE = NXL (2, L) |
| 68 |
IF ( (NODE .EQ. N1) .OR. (NODE .EQ. N2)) THEN |
| 69 |
IF (KXL (2, L) .GT. 0) THEN |
| 70 |
GOTO 110 |
| 71 |
ELSE |
| 72 |
GOTO 120 |
| 73 |
ENDIF |
| 74 |
ENDIF |
| 75 |
ENDIF |
| 76 |
100 CONTINUE |
| 77 |
WRITE (*, 10000)N1, N2, K |
| 78 |
ERR = .TRUE. |
| 79 |
RETURN |
| 80 |
|
| 81 |
C N1 TO N2 IS AN INTERIOR LINE |
| 82 |
|
| 83 |
110 CONTINUE |
| 84 |
|
| 85 |
C LONGEST INTERIOR LINE SO FAR |
| 86 |
|
| 87 |
IF (AL1 (I) .GT. S1MAX) THEN |
| 88 |
S2MAX = S1MAX |
| 89 |
L2MAX = L1MAX |
| 90 |
A2MAX = A1MAX |
| 91 |
S1MAX = AL1 (I) |
| 92 |
L1MAX = L |
| 93 |
A1MAX = ANG1 (I) + ANG1 (J) |
| 94 |
|
| 95 |
C SECOND LONGEST LINE SO FAR |
| 96 |
|
| 97 |
ELSE |
| 98 |
S2MAX = AL1 (I) |
| 99 |
L2MAX = L |
| 100 |
A2MAX = ANG1 (I) + ANG1 (J) |
| 101 |
ENDIF |
| 102 |
ENDIF |
| 103 |
120 CONTINUE |
| 104 |
130 CONTINUE |
| 105 |
|
| 106 |
C*********************************************************************** |
| 107 |
C NOTE: |
| 108 |
C IF LONGEST SIDE IS SUBSTANTIALLY LONGER THAN SECOND |
| 109 |
C LONGEST, PAIR WITH ELEMENT OPPOSITE LONGEST SIDE. |
| 110 |
C IF LONGEST SIDE IS NOT SUBSTANTIALLY LONGER THAN SECOND |
| 111 |
C LONGEST SIDE, PAIR WITH THE ELEMENT OPPOSITE EITHER THE |
| 112 |
C LONGEST OR SECOND LONGEST SIDE DEPENDING ON WHICH HAS THE |
| 113 |
C SMALLER SUM OF ADJACENT ANGLES. (LOOK AT A TRAPEZOID TO |
| 114 |
C SEE WHY THIS IS REASONABLE.) |
| 115 |
|
| 116 |
C*********************************************************************** |
| 117 |
|
| 118 |
IF (L1MAX .LE. 0) RETURN |
| 119 |
SLEN = S1MAX |
| 120 |
LINT = L1MAX |
| 121 |
IF ( (L2MAX .GT. 0) .AND. (S1MAX .LE. 1.15 * S2MAX) .AND. |
| 122 |
& (A1MAX .GT. A2MAX)) THEN |
| 123 |
SLEN = S2MAX |
| 124 |
LINT = L2MAX |
| 125 |
ENDIF |
| 126 |
K2 = KXL (1, LINT) + KXL (2, LINT) - K |
| 127 |
|
| 128 |
C DOUBLE CHECK |
| 129 |
|
| 130 |
IF (K2 .LE. 0) RETURN |
| 131 |
|
| 132 |
C GET DATA FOR ELEMENT K2 |
| 133 |
|
| 134 |
CALL GNXKA (MXND, XN, YN, K2, NS2, AREA2, LXK, NXL, CCW) |
| 135 |
CALL QAAVAL (MXND, NS2, ANG2, QRAT2, DUMMY, XN, YN, CAREA) |
| 136 |
CALL CONDNO (MXND, NS2, QRAT2, SRAT2, COND2, AL2, XN, YN, LSIDE) |
| 137 |
|
| 138 |
C FIND LONGEST SIDE IN SECOND ELEMENT |
| 139 |
|
| 140 |
SMAXB = AMAX1 (AL2 (1), AL2 (2), AL2 (3), AL2 (4)) |
| 141 |
|
| 142 |
C IF THE INTERFACE SIDE IS SIGNIFICANTLY SHORTER THAN THE |
| 143 |
C LONGEST SIDE OF THE SECOND ELEMENT, SKIP THE RESTRUCTURE. |
| 144 |
|
| 145 |
IF (SLEN .LT. 0.50 * SMAXB) RETURN |
| 146 |
|
| 147 |
C CIRCULARLY SHIFT THE TWO NODE LISTS TO CREATE CANONICAL ORDER. |
| 148 |
C IN CANONICAL ORDER THE FIRST NODE IS THE NODE IN BOTH ELEMENTS |
| 149 |
C WHOSE COUNTER - CLOCKWISE SUCCESSOR IN THE FIRST ELEMENT IS NOT |
| 150 |
C ALSO IN THE SECOND ELEMENT. |
| 151 |
C NOTE : ORDER OF SIDE LENGTH AND ANGLE DATA IS NO GOOD AFTER THIS |
| 152 |
|
| 153 |
N1 = NXL (1, LINT) |
| 154 |
CALL NXKORD (NS1, N1) |
| 155 |
DO 140 I = 1, 4 |
| 156 |
IF (NS2 (I) .EQ. NS1 (2)) THEN |
| 157 |
N1 = NXL (2, LINT) |
| 158 |
CALL NXKORD (NS1, N1) |
| 159 |
CALL NXKORD (NS2, N1) |
| 160 |
GOTO 150 |
| 161 |
ENDIF |
| 162 |
140 CONTINUE |
| 163 |
CALL NXKORD (NS2, N1) |
| 164 |
150 CONTINUE |
| 165 |
|
| 166 |
C SEE IF THEY MATCH AS THEY SHOULD (BUTTERFLY ELEMENTS MAY CAUSE |
| 167 |
C PROBLEMS WITH THE CCW ROUTINES |
| 168 |
|
| 169 |
IF (NS1 (4) .NE. NS2 (2)) THEN |
| 170 |
NSHOLD = NS2 (2) |
| 171 |
NS2 (2) = NS2 (4) |
| 172 |
NS2 (4) = NSHOLD |
| 173 |
IF (NS1 (4) .NE. NS2 (2)) THEN |
| 174 |
NSHOLD = NS1 (2) |
| 175 |
NS1 (2) = NS1 (4) |
| 176 |
NS1 (4) = NSHOLD |
| 177 |
IF (NS1 (4) .NE. NS2 (2)) THEN |
| 178 |
|
| 179 |
C ERROR MATCHING ELEMENTS ALONG A COMMON SIDE |
| 180 |
|
| 181 |
WRITE ( * , 10010)K, K2, NS1 (1), NS1 (4) |
| 182 |
ERR = .TRUE. |
| 183 |
RETURN |
| 184 |
ENDIF |
| 185 |
ENDIF |
| 186 |
ENDIF |
| 187 |
|
| 188 |
C COMPUTE ALL RELEVANT DATA FOR ALL THREE STRUCTURES |
| 189 |
|
| 190 |
C ORIGINAL STRUCTURE |
| 191 |
|
| 192 |
QMAX = AMAX1 (QRAT1, QRAT2) |
| 193 |
TOLQX = .95 * QMAX + .05 |
| 194 |
QAVG = 0.5 * (QRAT1 + QRAT2) |
| 195 |
AMIN = AMIN1 (AREA1, AREA2) |
| 196 |
IF (AMIN .GT. 0.) THEN |
| 197 |
ARAT = AMAX1 (AREA1, AREA2) / AMIN |
| 198 |
ELSE |
| 199 |
ARAT = 1.0E10 |
| 200 |
ENDIF |
| 201 |
|
| 202 |
C * BACKWARDS * STRUCTURE |
| 203 |
|
| 204 |
NSA (1) = NS2 (4) |
| 205 |
NSA (2) = NS1 (1) |
| 206 |
NSA (3) = NS1 (2) |
| 207 |
NSA (4) = NS1 (3) |
| 208 |
NSB (1) = NS2 (4) |
| 209 |
NSB (2) = NS1 (3) |
| 210 |
NSB (3) = NS2 (2) |
| 211 |
NSB (4) = NS2 (3) |
| 212 |
CAREA = .TRUE. |
| 213 |
CALL QAAVAL (MXND, NSA, ANG1, QRAT1B, AREA1B, XN, YN, CAREA) |
| 214 |
CALL QAAVAL (MXND, NSB, ANG2, QRAT2B, AREA2B, XN, YN, CAREA) |
| 215 |
IF ( (AMAX1 (ANG1 (1), ANG1 (2), ANG1 (3), ANG1 (4)) .GT. PITOL) |
| 216 |
& .OR. |
| 217 |
& (AMAX1 (ANG2 (1), ANG2 (2), ANG2 (3), ANG2 (4)) .GT. PITOL)) |
| 218 |
& THEN |
| 219 |
IOKB = .FALSE. |
| 220 |
ELSE |
| 221 |
IOKB = .TRUE. |
| 222 |
ENDIF |
| 223 |
QMAXB = AMAX1 (QRAT1B, QRAT2B) |
| 224 |
QAVGB = 0.5 * (QRAT1B + QRAT2B) |
| 225 |
AMIN = AMIN1 (AREA1B, AREA2B) |
| 226 |
IF (AMIN .GT. 0.) THEN |
| 227 |
ARATB = AMAX1 (AREA1B, AREA2B) / AMIN |
| 228 |
ELSE |
| 229 |
ARATB = 1.0E10 |
| 230 |
ENDIF |
| 231 |
|
| 232 |
C * FORWARDS * STRUCTURE |
| 233 |
|
| 234 |
NSC (1) = NS1 (2) |
| 235 |
NSC (2) = NS1 (3) |
| 236 |
NSC (3) = NS1 (4) |
| 237 |
NSC (4) = NS2 (3) |
| 238 |
NSD (1) = NS1 (2) |
| 239 |
NSD (2) = NS2 (3) |
| 240 |
NSD (3) = NS2 (4) |
| 241 |
NSD (4) = NS2 (1) |
| 242 |
CALL QAAVAL (MXND, NSC, ANG1, QRAT1F, AREA1F, XN, YN, CAREA) |
| 243 |
CALL QAAVAL (MXND, NSD, ANG2, QRAT2F, AREA2F, XN, YN, CAREA) |
| 244 |
IF ( (AMAX1 (ANG1 (1), ANG1 (2), ANG1 (3), ANG1 (4)) .GT. PITOL) |
| 245 |
& .OR. |
| 246 |
& (AMAX1 (ANG2 (1), ANG2 (2), ANG2 (3), ANG2 (4)) .GT. PITOL)) |
| 247 |
& THEN |
| 248 |
IOKF = .FALSE. |
| 249 |
ELSE |
| 250 |
IOKF = .TRUE. |
| 251 |
ENDIF |
| 252 |
QMAXF = AMAX1 (QRAT1F, QRAT2F) |
| 253 |
QAVGF = 0.5 * (QRAT1F + QRAT2F) |
| 254 |
AMIN = AMIN1 (AREA1F, AREA2F) |
| 255 |
IF (AMIN .GT. 0.) THEN |
| 256 |
ARATF = AMAX1 (AREA1F, AREA2F) / AMIN |
| 257 |
ELSE |
| 258 |
ARATF = 1.0E10 |
| 259 |
ENDIF |
| 260 |
|
| 261 |
C SEE IF BACKWARD IS BETTER THAN ORIGINAL |
| 262 |
|
| 263 |
IF ( (IOKB) .AND. (QMAXB .LE. TOLQX) .AND. (QAVGB .LE. QAVG) .AND. |
| 264 |
& (ARATB * QAVGB .LE. ARAT * QAVG)) THEN |
| 265 |
IBGOOD = .TRUE. |
| 266 |
ELSE |
| 267 |
IBGOOD = .FALSE. |
| 268 |
ENDIF |
| 269 |
|
| 270 |
C SEE IF FORWARD IS BETTER THAN ORIGINAL |
| 271 |
|
| 272 |
IF ( (IOKF) .AND. (QMAXF .LE. TOLQX) .AND. (QAVGF .LE. QAVG) .AND. |
| 273 |
& (ARATF * QAVGF .LE. ARAT * QAVG)) THEN |
| 274 |
IFGOOD = .TRUE. |
| 275 |
ELSE |
| 276 |
IFGOOD = .FALSE. |
| 277 |
ENDIF |
| 278 |
|
| 279 |
C CHOOSE BEST ALTERNATIVE |
| 280 |
C IF BOTH FORWARD AND BACKWARD IS BETTER THAN ORIGINAL, THEN |
| 281 |
C COMPUTE PAIR - VALUES TO CHOOSE BETWEEN FORWARD AND BACKWARD. |
| 282 |
C VALUE = (AVERAGE CONDITION NUMBER) * SQRT (AREA RATIO) |
| 283 |
|
| 284 |
IF ( (IFGOOD) .AND. (IBGOOD)) THEN |
| 285 |
LSIDE = .FALSE. |
| 286 |
CALL CONDNO (MXND, NSA, QRAT1B, SRAT1B, COND1B, AL1, XN, YN, |
| 287 |
& LSIDE) |
| 288 |
CALL CONDNO (MXND, NSB, QRAT2B, SRAT2B, COND2B, AL1, XN, YN, |
| 289 |
& LSIDE) |
| 290 |
VALUEB = ARATB * (COND1B + COND2B) **2 |
| 291 |
CALL CONDNO (MXND, NSC, QRAT1F, SRAT1F, COND1F, AL1, XN, YN, |
| 292 |
& LSIDE) |
| 293 |
CALL CONDNO (MXND, NSD, QRAT2F, SRAT2F, COND2F, AL1, XN, YN, |
| 294 |
& LSIDE) |
| 295 |
VALUEF = ARATF * (COND1F + COND2F) **2 |
| 296 |
IF (VALUEB .GT. VALUEF)IBGOOD = .FALSE. |
| 297 |
ENDIF |
| 298 |
|
| 299 |
C BACKWARD STRUCTURE IS BEST. IMPLEMENT IT. |
| 300 |
|
| 301 |
C FIRST FIX LXK AND KXL ARRAYS |
| 302 |
|
| 303 |
IF (IBGOOD) THEN |
| 304 |
CALL FNDLNK (MXND, LXK, NXL, K, NS1 (3), NS1 (4), L1EE, ERR) |
| 305 |
IF (ERR) RETURN |
| 306 |
CALL FNDLNK (MXND, LXK, NXL, K2, NS2 (1), NS2 (4), L2EE, ERR) |
| 307 |
IF (ERR) RETURN |
| 308 |
CALL LSWAP (MXND, LXK, KXL, K, L1EE, K2, L2EE, ERR) |
| 309 |
IF (ERR) RETURN |
| 310 |
|
| 311 |
C FIX NXL ARRAY (MOVE THE DIAGONAL) |
| 312 |
|
| 313 |
NXL (1, LINT) = NS2 (4) |
| 314 |
NXL (2, LINT) = NS1 (3) |
| 315 |
|
| 316 |
C FIX LXN ARRAY |
| 317 |
|
| 318 |
CALL DELLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, NS1 (1), LINT, |
| 319 |
& NNN, ERR, NOROOM) |
| 320 |
IF (ERR) RETURN |
| 321 |
CALL DELLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, NS1 (4), LINT, |
| 322 |
& NNN, ERR, NOROOM) |
| 323 |
IF (ERR) RETURN |
| 324 |
CALL ADDLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, NS1 (3), LINT, |
| 325 |
& NNN, ERR, NOROOM) |
| 326 |
IF (ERR) RETURN |
| 327 |
CALL ADDLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, NS2 (4), LINT, |
| 328 |
& NNN, ERR, NOROOM) |
| 329 |
IF (ERR) RETURN |
| 330 |
DONE = .TRUE. |
| 331 |
|
| 332 |
C FORWARD STRUCTURE IS BEST. IMPLEMENT IT. |
| 333 |
|
| 334 |
C FIX LXK AND KXL ARRAYS |
| 335 |
|
| 336 |
ELSEIF (IFGOOD) THEN |
| 337 |
CALL FNDLNK (MXND, LXK, NXL, K, NS1 (1), NS1 (2), L1EE, ERR) |
| 338 |
IF (ERR) RETURN |
| 339 |
CALL FNDLNK (MXND, LXK, NXL, K2, NS2 (2), NS2 (3), L2EE, ERR) |
| 340 |
IF (ERR) RETURN |
| 341 |
CALL LSWAP (MXND, LXK, KXL, K, L1EE, K2, L2EE, ERR) |
| 342 |
IF (ERR) RETURN |
| 343 |
|
| 344 |
C FIX NXL ARRAY (MOVE THE DIAGONAL) |
| 345 |
|
| 346 |
NXL (1, LINT) = NS1 (2) |
| 347 |
NXL (2, LINT) = NS2 (3) |
| 348 |
|
| 349 |
C FIX LXN ARRAY |
| 350 |
|
| 351 |
CALL DELLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, NS1 (1), LINT, |
| 352 |
& NNN, ERR, NOROOM) |
| 353 |
IF (ERR) RETURN |
| 354 |
CALL DELLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, NS1 (4), LINT, |
| 355 |
& NNN, ERR, NOROOM) |
| 356 |
IF (ERR) RETURN |
| 357 |
CALL ADDLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, NS1 (2), LINT, |
| 358 |
& NNN, ERR, NOROOM) |
| 359 |
IF (ERR) RETURN |
| 360 |
CALL ADDLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, NS2 (3), LINT, |
| 361 |
& NNN, ERR, NOROOM) |
| 362 |
IF (ERR) RETURN |
| 363 |
DONE = .TRUE. |
| 364 |
ENDIF |
| 365 |
|
| 366 |
RETURN |
| 367 |
|
| 368 |
10000 FORMAT (' IN RESTRY, NODES', 2I5, /, |
| 369 |
& ' DO NOT DEFINE A LINE IN ELEMENT', I5) |
| 370 |
10010 FORMAT (' IN RESTRY, ELEMENTS', 2I5, /, |
| 371 |
& ' DO NOT CONTAIN A COMMON SIDE USING NODES', 2I5) |
| 372 |
|
| 373 |
END |