Debian Codegraph @

packages/seacas/applications/fastq/wedge.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 WEDGE (MXND, MLN, NUID, LXK, KXL, NXL, LXN, XN, YN,
8 & LNODES, BNSIZE, IAVAIL, NAVAIL, LLL, KKK, NNN, LLLOLD, NNNOLD,
9 & N1, N6, NLOOP, PWEDGE, GRAPH, VIDEO, NOROOM, ERR)
10 C***********************************************************************
11
12 C SUBROUTINE WEDGE = EXPANDS TWO SIDE LINES INTO A CORNER NODE
13 C THIS IS REFERRED TO AS A WEDGE.
14
15 C***********************************************************************
16
17 DIMENSION NUID (MXND), XN (MXND), YN (MXND)
18 DIMENSION LXK (4, MXND), KXL (2, 3*MXND)
19 DIMENSION NXL (2, 3*MXND), LXN (4, MXND)
20 DIMENSION LNODES (MLN, MXND), BNSIZE (2, MXND)
21 DIMENSION L1LIST(20)
22
23 LOGICAL GRAPH, ERR, NOROOM, PWEDGE, VIDEO, TWOLIN
24
25 ERR = .FALSE.
26 NNNOLD = MIN (NNN, NNNOLD)
27 IF (LXN (3, N1) .EQ. 0) THEN
28 TWOLIN = .TRUE.
29 ELSE
30 TWOLIN = .FALSE.
31 ENDIF
32
33 C GET ALL THE DEFINITIONS IN ORDER
34
35 l3 = 0
36 N0 = LNODES (2, N1)
37 N2 = LNODES (3, N1)
38 L1 = LNODES (5, N0)
39 L2 = LNODES (5, N1)
40 KL1 = KXL (1, L1)
41
42 C FIND L3, N4, AND KL3
43
44 IF (.NOT. TWOLIN) THEN
45 DO 100 I = 1, 4
46 LTEST = LXK (I, KL1)
47 IF (LTEST .NE. L1) THEN
48 IF (NXL (1, LTEST) .EQ. N1) THEN
49 L3 = LTEST
50 N4 = NXL (2, LTEST)
51 GOTO 110
52 ELSEIF (NXL (2, LTEST) .EQ. N1) THEN
53 L3 = LTEST
54 N4 = NXL (1, LTEST)
55 GOTO 110
56 ENDIF
57 ENDIF
58 100 CONTINUE
59 CALL MESSAGE('** PROBLEMS IN WEDGE FINDING L3 AND N4 **')
60 ERR = .TRUE.
61 GOTO 200
62 110 CONTINUE
63
64 C FIND THE ELEMENT KL3 - THE ELEMENT ON THE OTHER SIDE OF L3
65
66 IF (KXL (1, L3) .EQ. KL1) THEN
67 KL3 = KXL (2, L3)
68 ELSEIF (KXL (2, L3) .EQ. KL1) THEN
69 KL3 = KXL (1, L3)
70 ELSE
71 CALL MESSAGE('** PROBLEMS IN WEDGE FINDING KL3 **')
72 ERR = .TRUE.
73 GOTO 200
74 ENDIF
75 ENDIF
76
77 C GET ALL THE N1 LINES
78
79 CALL GETLXN (MXND, LXN, N1, L1LIST, NL, ERR)
80 IF (ERR) THEN
81 CALL MESSAGE('** PROBLEMS IN WEDGE GETTING N1 LINES **')
82 GOTO 200
83 ENDIF
84
85 C ERASE THE LINES
86
87 IF ((GRAPH) .OR. (VIDEO)) THEN
88 CALL LCOLOR ('BLACK')
89 DO 120 I = 1, NL
90 NODE1 = NXL (1, L1LIST (I))
91 NODE2 = NXL (2, L1LIST (I))
92 CALL D2NODE (MXND, XN, YN, NODE1, NODE2)
93 120 CONTINUE
94 IF (GRAPH) THEN
95 CALL LCOLOR ('WHITE')
96 ELSE
97 CALL LCOLOR ('YELOW')
98 ENDIF
99 CALL SFLUSH
100 ENDIF
101
102 C NOW THAT ALL THE NECESSARY VARIABLES HAVE BEEN DEFINED,
103 C START BY DEFINING THE LOCATION OF ALL THE NEW NODES
104
105 NNN = NNN + 2
106 IF (NNN .GT. MXND) THEN
107 NOROOM = .TRUE.
108 GOTO 200
109 ENDIF
110 N5 = NNN - 1
111 N6 = NNN
112 IF (PWEDGE) THEN
113 XN (N5) = XN (N1)
114 YN (N5) = YN (N1)
115 XN (N1) = XN (N0) + ( (XN (N5) - XN (N0)) * .33333 )
116 YN (N1) = YN (N0) + ( (YN (N5) - YN (N0)) * .33333 )
117 XN (N6) = XN (N0) + ( (XN (N5) - XN (N0)) * .66667 )
118 YN (N6) = YN (N0) + ( (YN (N5) - YN (N0)) * .66667 )
119 ELSE
120 XN (N6) = XN (N0) + XN (N2) - XN (N4)
121 YN (N6) = YN (N0) + YN (N2) - YN (N4)
122 XN (N5) = ( (XN (N1) + ( ( XN (N2) - XN (N1) ) / 3. ) ) +
123 & ((XN (N6) + XN (N2)) * .5) ) * .5
124 YN (N5) = ( (YN (N1) + ( ( YN (N2) - YN (N1) ) / 3. ) ) +
125 & ((YN (N6) + YN (N2)) * .5) ) * .5
126 XN (N1) = ( (XN (N0) + ( ( XN (N1) - XN (N0) ) * .666667 ) ) +
127 & ((XN (N6) + XN (N0)) * .5) ) * .5
128 YN (N1) = ( (YN (N0) + ( ( YN (N1) - YN (N0) ) * .666667 ) ) +
129 & ((YN (N6) + YN (N0)) * .5) ) * .5
130 ENDIF
131
132 C NOW ADD LINES L4, L5, AND L6
133
134 LLL = LLL + 3
135 L4 = LLL - 2
136 IF (TWOLIN) THEN
137 NXL (1, L4) = N1
138 NXL (2, L4) = N2
139 ELSE
140 NXL (1, L4) = N4
141 NXL (2, L4) = N5
142 ENDIF
143 L5 = LLL - 1
144 L6 = LLL
145 NXL (1, L5) = N1
146 NXL (2, L5) = N6
147 NXL (1, L6) = N5
148 NXL (2, L6) = N6
149
150 C NOW UPDATE THE LXN ARRAYS
151
152 DO 130 I = 1, 4
153 LXN (I, N5) = 0
154 LXN (I, N6) = 0
155 130 CONTINUE
156
157 CALL FIXLXN (MXND, LXN, NXL, NUID, NAVAIL, IAVAIL, NNN, LLL,
158 & NNNOLD, LLLOLD, NOROOM, ERR)
159 LLLOLD = LLL
160 NNNOLD = NNN
161 IF ((NOROOM) .OR. (ERR)) GOTO 200
162
163 C UPDATE EXISTING NODES AND THEIR LXN ARRAYS
164 C - FIRST MAKE SURE THAT N5 TAKES N1'S BOUNDARY STATUS IF PWEDGE IS ON
165
166 IF ((PWEDGE) .AND. (LXN (2, N1) .LT. 0))
167 & LXN (2, N5) = - IABS (LXN (2, N5))
168
169 C MAKE SURE THAT ALL THE LINES THAT WERE ATTACHED TO N1
170 C EXCLUDING L1, L3, (STILL HOOKED TO N1) L4 AND L6 (ALREADY
171 C HOOKED TO N5) ARE NOW ATTACHED TO N5 AND HAVE N5 AS THE
172 C CORRECT ENDPOINT
173
174 DO 140 I = 1, NL
175 LL = L1LIST (I)
176 IF ((LL .NE. L1) .AND. (LL .NE. L3) .AND. (LL .NE. L4) .AND.
177 & (LL .NE. L6)) THEN
178
179 CALL DELLXN (MXND, LXN, NUID, NAVAIL, IAVAIL, N1,
180 & LL, NNN, ERR, NOROOM)
181 IF ((NOROOM) .OR. (ERR)) THEN
182 CALL MESSAGE('** PROBLEMS IN WEDGE UNHOOKING LL FROM '//
183 & 'N1 **')
184 GOTO 200
185 ENDIF
186
187 CALL ADDLXN (MXND, LXN, NUID, NAVAIL, IAVAIL,
188 & N5, LL, NNN, ERR, NOROOM)
189 IF ((NOROOM) .OR. (ERR)) THEN
190 CALL MESSAGE('** PROBLEMS IN WEDGE HOOKING LL TO N5 **')
191 GOTO 200
192 ENDIF
193
194 IF (NXL (1, LL) .EQ. N1) THEN
195 NXL (1, LL) = N5
196 ELSEIF (NXL (2, LL) .EQ. N1) THEN
197 NXL (2, LL) = N5
198 ELSE
199 CALL MESSAGE('** PROBLEMS IN WEDGE CHANGING LL '//
200 & 'ENDPOINT FROM N1 TO N5 **')
201 ERR = .TRUE.
202 GOTO 200
203 ENDIF
204
205 ENDIF
206 140 CONTINUE
207
208 C NOW ADD THE NEW ELEMENT
209
210 KKK = KKK + 1
211 IF (TWOLIN) THEN
212 LXK (1, KKK) = L4
213 LXK (2, KKK) = L2
214 ELSE
215 LXK (1, KKK) = L3
216 LXK (2, KKK) = L4
217 ENDIF
218 LXK (3, KKK) = L6
219 LXK (4, KKK) = L5
220
221 C NOW FIX THE KXL ARRAY FOR LINE L3
222
223 IF (.NOT. TWOLIN) THEN
224 IF (KXL (1, L3) .EQ. KL3) THEN
225 KXL (1, L3) = KKK
226 ELSEIF (KXL (2, L3) .EQ. KL3) THEN
227 KXL (2, L3) = KKK
228 ELSE
229 CALL MESSAGE('** PROBLEMS IN WEDGE REPLACING KL3 FOR L3 **')
230 ERR = .TRUE.
231 GOTO 200
232 ENDIF
233 ENDIF
234
235 C ADD THE KXL ENTRIES FOR THE NEW LINES
236
237 IF (TWOLIN) THEN
238 KXL (1, L4) = KL1
239 KXL (2, L4) = KKK
240 KXL (1, L2) = KKK
241 ELSE
242 KXL (1, L4) = KKK
243 KXL (2, L4) = KL3
244 ENDIF
245 KXL (1, L5) = KKK
246 KXL (1, L6) = KKK
247
248 C NOW FIX THE LXK ARRAY FOR THE ELEMENT KL1 IF TWOLIN
249
250 IF (TWOLIN) THEN
251 DO 150 I = 1, 4
252 IF (LXK (I, KL1) .EQ. L2) THEN
253 LXK (I, KL1) = L4
254 GOTO 160
255 ENDIF
256 150 CONTINUE
257 CALL MESSAGE('** PROBLEMS IN WEDGE REPLACING L2 WITH L4 IN '//
258 & 'KL1 **')
259 ERR = .TRUE.
260 GOTO 200
261 160 CONTINUE
262
263 C OTHERWISE FIX THE LXK ARRAY FOR THE ELEMENT KL3
264
265 ELSE
266 DO 170 I = 1, 4
267 IF (LXK (I, KL3) .EQ. L3) THEN
268 LXK (I, KL3) = L4
269 GOTO 180
270 ENDIF
271 170 CONTINUE
272 CALL MESSAGE('** PROBLEMS IN WEDGE REPLACING L3 WITH L4 IN '//
273 & 'KL3 **')
274 ERR = .TRUE.
275 GOTO 200
276 180 CONTINUE
277 ENDIF
278
279 C NOW FIX THE LNODES ARRAY
280
281 LNODES (1, N5) = 0
282 LNODES (1, N6) = 0
283
284 LNODES (2, N6) = N1
285 LNODES (2, N5) = N6
286 LNODES (2, N2) = N5
287
288 LNODES (3, N1) = N6
289 LNODES (3, N6) = N5
290 LNODES (3, N5) = N2
291
292 LNODES (4, N5) = - 1
293 LNODES (4, N6) = - 1
294
295 LNODES (5, N1) = L5
296 LNODES (5, N6) = L6
297 LNODES (5, N5) = L2
298
299 LNODES (8, N5) = LNODES (8, N1)
300 LNODES (8, N6) = LNODES (8, N1)
301
302 C PUT THE BEGINNING BOUNDARY DISTANCE IN PLACE
303
304 BNSIZE (1, N5) = BNSIZE (1, N1)
305 BNSIZE (1, N6) = BNSIZE (1, N1)
306 IF (BNSIZE (1, N1) .GT. 0.) THEN
307 SIZMIN = AMIN1 (BNSIZE (1, N1) * BNSIZE (2, N1),
308 & BNSIZE (1, N0) * BNSIZE (2, N0),
309 & BNSIZE (1, N2) * BNSIZE (2, N2)) / BNSIZE (1, N1)
310 ELSE
311 SIZMIN = AMIN1 (BNSIZE (1, N1) * BNSIZE (2, N1),
312 & BNSIZE (1, N0) * BNSIZE (2, N0),
313 & BNSIZE (1, N2) * BNSIZE (2, N2)) /
314 & SQRT ( (XN (N1) - XN (N2)) ** 2 + (YN (N1) - YN (N2)) ** 2 )
315 ENDIF
316 IF (PWEDGE) THEN
317 BNSIZE (2, N6) = SIZMIN
318 BNSIZE (2, N5) = SIZMIN
319 BNSIZE (2, N1) = SIZMIN
320 ELSE
321 BNSIZE (2, N5) = BNSIZE (2, N1) * 1.15
322 BNSIZE (2, N6) = BNSIZE (2, N1)
323 BNSIZE (2, N1) = BNSIZE (2, N1) * 1.15
324 ENDIF
325
326 NLOOP = NLOOP + 2
327 ERR = .FALSE.
328
329 C NOW REDRAW THE LINES
330
331 IF ((GRAPH) .OR. (VIDEO)) THEN
332 DO 190 I = 1, NL
333 IF ((L1LIST (I) .NE. L1) .AND. (L1LIST (I) .NE. L3) .AND.
334 & (L1LIST (I) .NE. L2)) THEN
335 NODE1 = NXL (1, L1LIST (I))
336 NODE2 = NXL (2, L1LIST (I))
337 CALL D2NODE (MXND, XN, YN, NODE1, NODE2)
338 ENDIF
339 190 CONTINUE
340 CALL D2NODE (MXND, XN, YN, N0, N1)
341 CALL D2NODE (MXND, XN, YN, N1, N6)
342 CALL D2NODE (MXND, XN, YN, N2, N5)
343 CALL D2NODE (MXND, XN, YN, N6, N5)
344 IF (TWOLIN) THEN
345 CALL D2NODE (MXND, XN, YN, N1, N2)
346 ELSE
347 CALL D2NODE (MXND, XN, YN, N1, N4)
348 CALL D2NODE (MXND, XN, YN, N4, N5)
349 ENDIF
350 CALL SFLUSH
351 ENDIF
352
353 200 CONTINUE
354
355 RETURN
356
357 END