| 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 SQUASH (MXND, XN, YN, NUID, LXK, KXL, NXL, LXN, KKK, |
| 8 |
& KKKOLD, NNN, NAVAIL, IAVAIL, ASMALL, DONE, NOROOM, ERR) |
| 9 |
C*********************************************************************** |
| 10 |
|
| 11 |
C SUBROUTINE SQUASH = TRIES TO SQUASH THE MOST SHARPELY RHOMBICAL |
| 12 |
C ELEMENT IN THE MESH |
| 13 |
|
| 14 |
C*********************************************************************** |
| 15 |
|
| 16 |
C VARIABLES: |
| 17 |
C ASMALL = AN ANGLE CONSIDERED TO BE TOO SMALL (DEGREES) |
| 18 |
C DONE = .TRUE. IF A SQUASH WAS DONE |
| 19 |
|
| 20 |
C*********************************************************************** |
| 21 |
|
| 22 |
DIMENSION NODES(4), LINES(4), L1LIST(20) |
| 23 |
DIMENSION RHOM(6), KR(6) |
| 24 |
DIMENSION LXK(4, MXND), NXL(2, 3*MXND), KXL(2, 3*MXND) |
| 25 |
DIMENSION LXN(4, MXND), XN(MXND), YN(MXND), NUID(MXND) |
| 26 |
|
| 27 |
LOGICAL ERR, NOROOM, DONE, CCW |
| 28 |
|
| 29 |
C CHECK FOR IMPENDING OVERFLOW |
| 30 |
|
| 31 |
NOROOM = .FALSE. |
| 32 |
ERR = .FALSE. |
| 33 |
DONE = .FALSE. |
| 34 |
IF (NNN .GE. MXND - 1) THEN |
| 35 |
CALL MESSAGE('INSUFFICIENT STORAGE IN SQUASH') |
| 36 |
NOROOM = .TRUE. |
| 37 |
ERR = .TRUE. |
| 38 |
RETURN |
| 39 |
END IF |
| 40 |
|
| 41 |
C INITIALIZATION |
| 42 |
|
| 43 |
PI = ATAN2(0.0, -1.0) |
| 44 |
IF (ASMALL .GT. 80.0)ASMALL = 80.0 |
| 45 |
ALOP = ASMALL*PI/180. |
| 46 |
DMAX = SIN(0.5*ALOP)/COS(0.5*ALOP) |
| 47 |
DMAX = DMAX**2 |
| 48 |
|
| 49 |
C CLEAR RECORDS |
| 50 |
|
| 51 |
DO 100 I = 1, 6 |
| 52 |
RHOM(I) = 10.0 |
| 53 |
KR(I) = 0 |
| 54 |
100 CONTINUE |
| 55 |
|
| 56 |
C ELEMENT LOOP |
| 57 |
|
| 58 |
DO 130 K = KKKOLD + 1, KKK |
| 59 |
IF (LXK(1, K) .GT. 0) THEN |
| 60 |
CCW = .FALSE. |
| 61 |
CALL GNXKA (MXND, XN, YN, K, NODES, AREA, LXK, NXL, CCW) |
| 62 |
N1 = NODES(1) |
| 63 |
N2 = NODES(2) |
| 64 |
N3 = NODES(3) |
| 65 |
N4 = NODES(4) |
| 66 |
DIAG1 = (XN(N3) - XN(N1))**2 + (YN(N3) - YN(N1))**2 |
| 67 |
DIAG2 = (XN(N4) - XN(N2))**2 + (YN(N4) - YN(N2))**2 |
| 68 |
IF (DIAG2 .NE. 0.0) THEN |
| 69 |
DRAT = DIAG1/DIAG2 |
| 70 |
IF (DRAT .GT. 1.0) DRAT = 1.0/DRAT |
| 71 |
ELSE |
| 72 |
DRAT = 0. |
| 73 |
END IF |
| 74 |
|
| 75 |
C RECORD WORST FIVE |
| 76 |
|
| 77 |
IF (DRAT .LE. DMAX) THEN |
| 78 |
KR(6) = K |
| 79 |
RHOM(6) = DRAT |
| 80 |
DO 110 I = 1, 5 |
| 81 |
J = 7 - I |
| 82 |
IF (RHOM(J) .GE. RHOM(J - 1)) GO TO 120 |
| 83 |
TEMP = RHOM(J - 1) |
| 84 |
RHOM(J - 1) = RHOM(J) |
| 85 |
RHOM(J) = TEMP |
| 86 |
KTEMP = KR(J - 1) |
| 87 |
KR(J - 1) = KR(J) |
| 88 |
KR(J) = KTEMP |
| 89 |
110 CONTINUE |
| 90 |
120 CONTINUE |
| 91 |
END IF |
| 92 |
END IF |
| 93 |
130 CONTINUE |
| 94 |
|
| 95 |
C SQUASH WORST ELEMENT NOT VIOLATING THE BOUNDARY |
| 96 |
|
| 97 |
DO 140 IK = 1, 5 |
| 98 |
K = KR(IK) |
| 99 |
IF (K .GT. 0) THEN |
| 100 |
CCW = .TRUE. |
| 101 |
CALL GNXKA (MXND, XN, YN, K, NODES, AREA, LXK, NXL, CCW) |
| 102 |
N1 = NODES(1) |
| 103 |
N2 = NODES(2) |
| 104 |
N3 = NODES(3) |
| 105 |
N4 = NODES(4) |
| 106 |
DIAG1 = (XN(N3) - XN(N1))**2 + (YN(N3) - YN(N1))**2 |
| 107 |
DIAG2 = (XN(N4) - XN(N2))**2 + (YN(N4) - YN(N2))**2 |
| 108 |
|
| 109 |
C ARRANGE NODES SO THE SHORT DIAGONAL IS FROM 1ST TO 3RD NODES |
| 110 |
C AND INSURE THAT THE NODE TO BE DELETED IS NOT A BOUNDARY NODE |
| 111 |
|
| 112 |
IF (DIAG1 .GT. DIAG2) CALL NXKORD (NODES, N2) |
| 113 |
N1 = NODES(1) |
| 114 |
N3 = NODES(3) |
| 115 |
IF (LXN(2, N1) .LE. 0) CALL NXKORD (NODES, N3) |
| 116 |
N1 = NODES(1) |
| 117 |
IF (LXN(2, N1) .GT. 0) GO TO 150 |
| 118 |
END IF |
| 119 |
140 CONTINUE |
| 120 |
RETURN |
| 121 |
|
| 122 |
C PREPARE FOR THE SQUASH OF ELEMENT K |
| 123 |
|
| 124 |
150 CONTINUE |
| 125 |
DONE = .TRUE. |
| 126 |
N1 = NODES(1) |
| 127 |
N2 = NODES(2) |
| 128 |
N3 = NODES(3) |
| 129 |
N4 = NODES(4) |
| 130 |
|
| 131 |
C FIND THE LINES ASSOCIATED WITH THE ELEMENT TO BE DELETED |
| 132 |
|
| 133 |
DO 160 I = 1, 4 |
| 134 |
J = I + 1 |
| 135 |
IF (J .GE. 5) J = 1 |
| 136 |
CALL FNDLNK (MXND, LXK, NXL, K, NODES(I), NODES(J), LINES(I), |
| 137 |
& ERR) |
| 138 |
IF (ERR) RETURN |
| 139 |
IF (LINES(I) .EQ. 0) THEN |
| 140 |
ERR = .TRUE. |
| 141 |
RETURN |
| 142 |
END IF |
| 143 |
160 CONTINUE |
| 144 |
|
| 145 |
C FIND ELEMENTS ON OTHER SIDES OF THE LINES |
| 146 |
C K2 AND K3 ARE NEVER NEEDED |
| 147 |
|
| 148 |
L1 = LINES(1) |
| 149 |
L2 = LINES(2) |
| 150 |
L3 = LINES(3) |
| 151 |
L4 = LINES(4) |
| 152 |
K1 = KXL(1, L1) + KXL(2, L1) - K |
| 153 |
K4 = KXL(1, L4) + KXL(2, L4) - K |
| 154 |
|
| 155 |
C FIX LXK ARRAY |
| 156 |
C DISCARD L1 FOR L2 IN K1 |
| 157 |
|
| 158 |
DO 170 I = 1, 4 |
| 159 |
IF (LXK(I, K1) .EQ. L1) THEN |
| 160 |
LXK(I, K1) = L2 |
| 161 |
GO TO 180 |
| 162 |
END IF |
| 163 |
170 CONTINUE |
| 164 |
WRITE(*, 10000)K1, L1 |
| 165 |
ERR = .TRUE. |
| 166 |
RETURN |
| 167 |
180 CONTINUE |
| 168 |
|
| 169 |
C DISCARD L4 FOR L3 IN K4 |
| 170 |
|
| 171 |
DO 190 I = 1, 4 |
| 172 |
IF (LXK(I, K4) .EQ. L4) THEN |
| 173 |
LXK(I, K4) = L3 |
| 174 |
GO TO 200 |
| 175 |
END IF |
| 176 |
190 CONTINUE |
| 177 |
WRITE(*, 10000)K1, L1 |
| 178 |
ERR = .TRUE. |
| 179 |
RETURN |
| 180 |
200 CONTINUE |
| 181 |
|
| 182 |
C DELETE ELEMENT K |
| 183 |
|
| 184 |
DO 210 I = 1, 4 |
| 185 |
LXK(I, K) = 0 |
| 186 |
210 CONTINUE |
| 187 |
|
| 188 |
C FIX KXL ARRAY |
| 189 |
C DISCARD K FOR K1 WITH L2 |
| 190 |
|
| 191 |
IF (KXL(1, L2) .EQ. K) THEN |
| 192 |
KXL(1, L2) = K1 |
| 193 |
ELSE IF (KXL(2, L2) .EQ. K) THEN |
| 194 |
KXL(2, L2) = K1 |
| 195 |
END IF |
| 196 |
|
| 197 |
C DISCARD K FOR K4 WITH L3 |
| 198 |
|
| 199 |
IF (KXL(1, L3) .EQ. K) THEN |
| 200 |
KXL(1, L3) = K4 |
| 201 |
ELSE IF (KXL(2, L3) .EQ. K) THEN |
| 202 |
KXL(2, L3) = K4 |
| 203 |
END IF |
| 204 |
|
| 205 |
C DELETE L1 AND L4 |
| 206 |
|
| 207 |
KXL(1, L1) = 0 |
| 208 |
KXL(2, L1) = 0 |
| 209 |
KXL(1, L4) = 0 |
| 210 |
KXL(2, L4) = 0 |
| 211 |
|
| 212 |
C FIX NXL ARRAY |
| 213 |
C DELETE L1 AND L4 |
| 214 |
|
| 215 |
NXL(1, L1) = 0 |
| 216 |
NXL(2, L1) = 0 |
| 217 |
NXL(1, L4) = 0 |
| 218 |
NXL(2, L4) = 0 |
| 219 |
|
| 220 |
C RECONNECT ALL LINES CONNECTING TO NODE 1 TO NODE 3 |
| 221 |
|
| 222 |
CALL GETLXN (MXND, LXN, N1, L1LIST, NL, ERR) |
| 223 |
IF (ERR) RETURN |
| 224 |
DO 220 I = 1, NL |
| 225 |
LL = L1LIST(I) |
| 226 |
IF (NXL(1, LL) .EQ. N1) THEN |
| 227 |
NXL(1, LL) = N3 |
| 228 |
ELSE IF (NXL(2, LL) .EQ. N1) THEN |
| 229 |
NXL(2, LL) = N3 |
| 230 |
END IF |
| 231 |
220 CONTINUE |
| 232 |
|
| 233 |
C FIX LXN ARRAY |
| 234 |
C UNHOOK L1 FROM N2 AND L4 FROM N4 |
| 235 |
|
| 236 |
CALL DELLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, N2, L1, NNN, ERR, |
| 237 |
& NOROOM) |
| 238 |
IF (ERR) RETURN |
| 239 |
CALL DELLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, N4, L4, NNN, ERR, |
| 240 |
& NOROOM) |
| 241 |
IF (ERR) RETURN |
| 242 |
|
| 243 |
C ADD ALL LINES HOOKED TO N3 TO THE LIST OF LINES FOR N3 |
| 244 |
|
| 245 |
DO 230 I = 1, NL |
| 246 |
LL = L1LIST(I) |
| 247 |
IF ((LL .NE. L1) .AND. (LL .NE. L4)) THEN |
| 248 |
CALL ADDLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, N3, LL, NNN, |
| 249 |
& ERR, NOROOM) |
| 250 |
IF (ERR) RETURN |
| 251 |
END IF |
| 252 |
230 CONTINUE |
| 253 |
|
| 254 |
C DELETE N1 (UNHOOK EVERYTHING FROM IT) |
| 255 |
|
| 256 |
DO 240 I = 1, 3 |
| 257 |
LXN(I, N1) = 0 |
| 258 |
240 CONTINUE |
| 259 |
LXN(4, N1) = IAVAIL |
| 260 |
IAVAIL = N1 |
| 261 |
NAVAIL = NAVAIL + 1 |
| 262 |
|
| 263 |
C FIX XN AND YN ARRAYS |
| 264 |
C DEFINE POSITION OF N3 |
| 265 |
|
| 266 |
IF (LXN(2, N3) .GT. 0) THEN |
| 267 |
XN(N3) = 0.5*(XN(N1) + XN(N3)) |
| 268 |
YN(N3) = 0.5*(YN(N1) + YN(N3)) |
| 269 |
END IF |
| 270 |
NUID(N1) = 0 |
| 271 |
RETURN |
| 272 |
|
| 273 |
10000 FORMAT(' IN SQUASH, ELEMENT', I5, ' DOES NOT CONTAIN LINE', I5) |
| 274 |
END |