Debian Codegraph @

packages/seacas/applications/fastq/rowsmo.f

raw
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 ROWSMO (MXND, MLN, XN, YN, ZN, LXK, KXL, NXL, LXN, NNN,
8 & WFAC, WFAC2, NIT, EPS, RO, NNN2, LNODES, BNSIZE, LLL, GRAPH,
9 & XMIN, XMAX, YMIN, YMAX, ZMIN, ZMAX, DEV1, KREG)
10 C***********************************************************************
11
12 C SUBROUTINE ROWSMO = SMOOTHS AN ADDED ROW DURING FILLING USING THE
13 C ISOPARAMETRIC SMOOTHER WITH SPECIAL CONSIDERATION
14 C GIVEN TO THE 2-LINE NODES (ROW CORNERS)
15
16 C***********************************************************************
17
18 C VARIABLES USED:
19 C WFAC = WEIGHT (0. = LAPLACIAN, 1. = ISOPARAMETRIC)
20 C NIT = THE MAX NUMBER OF ITERATIONS TO DO.
21 C EPS = MINIMUM DISTANCE NODES MUST MOVE TO CONTINUE ITERATIONS
22 C RO = AN UNDER- OR OVER-RELAXATION FACTOR (NORMALLY 1.0)
23
24 C***********************************************************************
25
26 DIMENSION AREA(20)
27
28 DIMENSION KLIST(20), NODES(4)
29 DIMENSION XN(MXND), YN(MXND), ZN(MXND)
30 DIMENSION LXN(4, MXND), NXL(2, 3*MXND)
31 DIMENSION LXK(4, MXND), KXL(2, 3*MXND)
32 DIMENSION LINES(20), LNODES (MLN, MXND), BNSIZE (2, MXND)
33
34 LOGICAL BIG, CCW, ERR, GRAPH, NEAR2L, TEST, AVER
35
36 CHARACTER*3 DEV1
37
38 PI = ATAN2(0.0, -1.0)
39
40 nodes(1) = -1
41 nodes(2) = -1
42 nodes(3) = -1
43 nodes(4) = -1
44
45 IF (RO .LT. 0.01) RO = 1.
46 DRO = 1.0
47 VRO = 1.0
48 EPS2 = EPS * RO
49 TEST = .FALSE.
50 AVER = .TRUE.
51
52 C ITERATION LOOP
53
54 DO 160 IT = 1, NIT
55 IF (IT .EQ. NIT) THEN
56 CALL MESSAGE('THE ROWSMO ROUTINE IS NOT CONVERGING')
57 ENDIF
58 BIG = .FALSE.
59
60 C NODE LOOP
61
62 NBEGIN = MAX0 (NNN2 - 1, 1)
63 NEND = NNN + 1
64 DO 150 J = NBEGIN, NEND
65 IF (J .EQ. NEND) THEN
66 NODE = LNODES (3, NNN)
67 ELSEIF (J .EQ. NBEGIN) THEN
68 NODE = LNODES (2, NBEGIN)
69 ELSE
70 NODE = J
71 ENDIF
72
73 C SKIP CONTINUATION LINES, EXTERIOR BOUNDARY LINES, AND NODES
74 C THAT ARE ON THE INTERIOR
75
76 IF (NODE .gt. 0) THEN
77 IF ((LXN(1, NODE) .GT. 0) .AND. (LXN(2, NODE) .GT. 0) .AND.
78 & (LNODES (4, NODE) .EQ. - 1)) THEN
79
80 C FIND ELEMENTS AND LINES ATTACHED TO NODE
81
82 CALL GKXN (MXND, KXL, LXN, NODE, KS, KLIST, ERR)
83 CALL GETLXN (MXND, LXN, NODE, LINES, NL, ERR)
84
85 SUMX = 0.0
86 SUMY = 0.0
87
88 C PERFORM AN AREA PULL AND LAPLACIAN
89 C ON ANY NODE ATTACHED TO A 2-LINE NODE
90
91 C TWOL = .FALSE.
92 C NEAR2L = .FALSE.
93 C IF (LXN (3, NODE) . EQ. 0) THEN
94 C TWOL = .TRUE.
95 C NFROM = 0
96 C ELSE
97 C IF (NL .EQ. 3) THEN
98 C DO 100 IL = 1, NL
99 C ILL = LINES (IL)
100 C IF (NXL (1, ILL) .EQ. NODE) THEN
101 C NTEST = NXL (2, ILL)
102 C ELSEIF (NXL (2, ILL) .EQ. NODE) THEN
103 C NTEST = NXL (1, ILL)
104 C ELSE
105 C CALL MESSAGE('** PROBLEMS IN ROWSMO **')
106 C GOTO 110
107 C ENDIF
108 C NODES(IL) = NTEST
109 C IF (LXN (3, NTEST) .EQ. 0) THEN
110
111 C MAKE SURE THAT THE OTHER END OF THE 2-LINE NODE HAS ONLY 3 LINES
112
113 C IF (LXN (1, NTEST) .EQ. ILL) THEN
114 C LTEST = LXN (2, NTEST)
115 C ELSEIF (LXN (2, NTEST) .EQ. ILL) THEN
116 C LTEST = LXN (1, NTEST)
117 C ELSE
118 C CALL MESSAGE('** PROBLEMS IN ROWSMO **')
119 C GOTO 110
120 C ENDIF
121 C IF (NXL (1, LTEST) .EQ. NTEST) THEN
122 C NTEST = NXL (2, LTEST)
123 C ELSEIF (NXL (2, LTEST) .EQ. NTEST) THEN
124 C NTEST = NXL (1, LTEST)
125 C ELSE
126 C CALL MESSAGE('** PROBLEMS IN ROWSMO **')
127 C GOTO 110
128 C ENDIF
129 C IF ((LXN (3, NTEST) .GT. 0) .AND.
130 C & (LXN (4, NTEST) .EQ. 0)) THEN
131 C NEAR2L = .TRUE.
132 C ENDIF
133 C ENDIF
134 C 100 CONTINUE
135 C 110 CONTINUE
136 C NFROM = NODES(2)
137 C ELSE
138 C NFROM = 0
139 C ENDIF
140 C ENDIF
141
142 NEAR2L = .FALSE.
143 IF ((NEAR2L) .OR. (TEST)) THEN
144 THETA1 = ATAN2 (YN (NODES (3)) - YN (NODES (1)),
145 & XN (NODES (3)) - XN (NODES (1)) ) + PI / 2.0
146 THETA2 = ATAN2 (YN (NODES (3)) - YN (NODES (2)),
147 & XN (NODES (3)) - XN (NODES (2)) ) + PI / 2.0
148 DET = - COS (THETA1) * SIN (THETA2) + COS (THETA2) *
149 & SIN (THETA1)
150 X11 = 0.5 * (XN (NODES (1)) + XN (NODES (3)))
151 Y11 = 0.5 * (YN (NODES (1)) + YN (NODES (3)))
152 X21 = 0.5 * (XN (NODES (2)) + XN (NODES (3)))
153 Y21 = 0.5 * (YN (NODES (2)) + YN (NODES (3)))
154 R = (- SIN (THETA2) * (X21 - X11) + COS (THETA2) *
155 & (Y21 - Y11)) / DET
156 XNEW = X11 + R * COS (THETA1)
157 YNEW = Y11 + R * SIN (THETA1)
158 XDEL = XNEW - XN (NODE)
159 YDEL = YNEW - YN (NODE)
160
161 C PERFORM AN ISOPARAMETRIC SMOOTH ON OTHER NODES
162
163 ELSE
164 DO 120 KL = 1, KS
165 CCW = .FALSE.
166 KK = KLIST(KL)
167 CALL GNXKA (MXND, XN, YN, KK, NODES, AREA(KL), LXK,
168 & NXL, CCW)
169
170 DO 100 IN = 1, 4
171 IF (NODES(IN) .EQ. NODE) THEN
172 J1 = IN + 1
173 IF (J1 .GT. 4) J1 = 1
174 GO TO 110
175 END IF
176 100 CONTINUE
177 110 CONTINUE
178 J2 = J1 + 1
179 IF (J2 .GT. 4) J2 = 1
180 J3 = J2 + 1
181 IF (J3 .GT. 4) J3 = 1
182
183 SUMX = SUMX + XN(NODES(J1)) + XN(NODES(J3))
184 & - WFAC * XN(NODES(J2))
185 SUMY = SUMY + YN(NODES(J1)) + YN(NODES(J3))
186 & - WFAC * YN(NODES(J2))
187 120 CONTINUE
188 SUMX = SUMX/(DBLE(KS) * (2.0 - WFAC))
189 SUMY = SUMY/(DBLE(KS) * (2.0 - WFAC))
190 XDEL = (RO * ( SUMX - XN (NODE) ))
191 YDEL = (RO * ( SUMY - YN (NODE) ))
192
193 CALL GETFRM (MXND, LINES, NL, NXL, NODE,
194 & LNODES (2, NODE), LNODES (3, NODE), NFROM)
195 IF (NFROM .GT. 0)
196 & THEN
197
198 C FACTOR IN THE LENGTH CONSTANT (GENERATED LENGTH) OF THE NODE
199
200 DIST0 = BNSIZE (1,NODE) * BNSIZE (2,NODE)
201 XDIST = XDEL + XN (NODE) - XN (NFROM)
202 YDIST = YDEL + YN (NODE) - YN (NFROM)
203 DIST1 = SQRT (XDIST **2 + YDIST **2)
204 DFACT = (DIST0 / DIST1) * DRO
205 SUMX = XN (NFROM) + XDIST * DFACT
206 SUMY = YN (NFROM) + YDIST * DFACT
207 XDEL = SUMX - XN (NODE)
208 YDEL = SUMY - YN (NODE)
209
210 C FACTOR IN THE EQUAL ANGLE VECTORS
211
212 IF (LNODES (2, NODE) .NE. LNODES (3, NODE)) THEN
213 CALL EQLANG (MXND, XN, YN, LXN, NODE,
214 & LNODES (2, NODE), LNODES (3, NODE), NFROM,
215 & DIST0, VRO, VX, VY)
216 IF (AVER) THEN
217 XDEL = (XDEL + VX) * .5
218 YDEL = (YDEL + VY) * .5
219 ELSE
220 XDEL = VX
221 YDEL = VY
222 ENDIF
223 ENDIF
224
225 ENDIF
226
227 ENDIF
228
229 C NOW CHECK THAT THE ROW IS NOT BENDING OVER ON ITSELF WITH THIS SMOOTH
230
231 IF (LXN (4, NODE) .EQ. 0) CALL INVERT_FQ (MXND, MLN, XN,
232 & YN, ZN, LXK, KXL, NXL, LXN, LLL, LNODES, XMIN, XMAX,
233 & YMIN, YMAX, ZMIN, ZMAX, DEV1, KREG, NODE, XDEL, YDEL)
234
235 C REDEFINE THIS NODE'S COORDINATES
236 C AND PLOT THE NEW NODE AND LINES
237
238 IF ((XDEL * XDEL + YDEL * YDEL) .GT. EPS2) BIG = .TRUE.
239 IF (GRAPH) THEN
240 CALL LCOLOR ('BLACK')
241 DO 130 II = 1, NL
242 IDRAW = LINES(II)
243 NODE1 = NXL (1, IDRAW)
244 NODE2 = NXL (2, IDRAW)
245 CALL D2NODE (MXND, XN, YN, NODE1, NODE2)
246 130 CONTINUE
247 CALL LCOLOR ('WHITE')
248 CALL SFLUSH
249 ENDIF
250
251 XN(NODE) = XN(NODE) + XDEL
252 YN(NODE) = YN(NODE) + YDEL
253
254 IF (GRAPH) THEN
255 DO 140 II = 1, NL
256 IDRAW = LINES(II)
257 NODE1 = NXL (1, IDRAW)
258 NODE2 = NXL (2, IDRAW)
259 CALL D2NODE (MXND, XN, YN, NODE1, NODE2)
260 140 CONTINUE
261 CALL SFLUSH
262 ENDIF
263
264 C CHECK FOR CONVERGENCE
265
266 ENDIF
267 ENDIF
268 150 CONTINUE
269
270 C IF NO SIGNIFICANT MOVEMENTS OCCURRED, RETURN
271
272 IF (.NOT.BIG) RETURN
273 160 CONTINUE
274
275 C NOW SMOOTH THE INTERIOR
276
277 RETURN
278 END