Debian Codegraph @

packages/seacas/applications/fastq/match2.f

raw
1 C Copyright(C) 1999-2020, 2024 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 MATCH2 (MXND, MLN, XN, YN, NXL, LXN, LNODES, ANGLE,
8 & N0, N1, N2, N3, N0TEST, N1TEST, N2TEST, N3TEST, I1, I2,
9 & J1, J2, KOUNTL, LMATCH, KOUNT2, NODE, U, W, NLOOP, PMATCH, ERR)
10 C***********************************************************************
11
12 C SUBROUTINE MATCH2 = MATCHES UP THE BEST PAIR OF LINES FOR COLLAPSING
13
14 C***********************************************************************
15
16 DIMENSION XN (MXND), YN (MXND), NXL (2, 3*MXND), LXN (4, MXND)
17 DIMENSION ANGLE (MXND), LNODES (MLN, MXND)
18
19 LOGICAL LMATCH, CORNP, SIDEP, BWINS, FWINS, MATCHK, ERR, PMATCH
20
21 ERR = .FALSE.
22 LMATCH = .TRUE.
23 BWINS = .FALSE.
24 FWINS = .FALSE.
25
26 C MAKE SURE THAT AN ODD NUMBER OR SMALL NUMBER IN A LOOP HAS NOT BEEN
27 C CUT OFF, AND IF IT HAS ADJUST THE INTERSECTION ACCORDINGLY.
28
29 C FIRST CHECK A 2 NODE LOOP - A HIGHLY UNLIKELY CONDITION
30
31 IF (PMATCH) THEN
32 I1 = N1
33 I2 = N2
34 J1 = N1TEST
35 J2 = N2TEST
36 KOUNTL = KOUNT2 - 1
37 ELSEIF (KOUNT2 .EQ. 2) THEN
38 IF ((CORNP (ANGLE (N2)) ) .AND. (LXN (4, N2) .NE. 0) ) THEN
39 I1 = N1
40 I2 = N2
41 J1 = N2TEST
42 J2 = N3TEST
43 KOUNTL = 2
44 ELSEIF ((CORNP (ANGLE (N1TEST)) ) .AND.
45 & (LXN (4, N1TEST) .NE. 0) ) THEN
46 I1 = N1
47 I2 = N2
48 J1 = N2TEST
49 J2 = N3TEST
50 KOUNTL = 2
51 ELSE
52 IF (CORNP (ANGLE (N2)) ) THEN
53 NODE = N2
54 ELSEIF (CORNP (ANGLE (N1TEST)) ) THEN
55 NODE = N1TEST
56 ELSE
57 NODE = N2
58 ENDIF
59 LMATCH = .FALSE.
60 GOTO 100
61 ENDIF
62
63 C NEXT CHECK A 3 NODE LOOP - THIS IS A MUCH MORE PLAUSIBLE CONDITION
64
65 ELSEIF (KOUNT2 .EQ. 3) THEN
66
67 C CHECK FOR A 3-1 SEMICIRCLE BEING FORMED EITHER WAY
68
69 IF ( ( CORNP (ANGLE (N2)) ) .AND.
70 & ( LXN (4, N2) .NE. 0) .AND.
71 & ( SIDEP (ANGLE (N3)) ) ) THEN
72 I1 = N0
73 I2 = N1
74 J1 = N3
75 J2 = N1TEST
76 KOUNTL = 2
77 ELSEIF ( ( CORNP (ANGLE (N1TEST)) ) .AND.
78 & ( LXN (4, N1TEST) .NE. 0) .AND.
79 & ( SIDEP (ANGLE (N3)) ) ) THEN
80 I1 = N2
81 I2 = N3
82 J1 = N2TEST
83 J2 = N3TEST
84 KOUNTL = 2
85
86 C JUST PUT IT AT TWO NODES LEFT
87
88 ELSE
89 I1 = N1
90 I2 = N2
91 J1 = N1TEST
92 J2 = N2TEST
93 KOUNTL = 2
94 ENDIF
95
96 C NODE LOOP FOR AN EVEN NUMBER OF SPLITS - THE MATCH IS
97 C NOT FINE, SO A SHIFT ONE WAY OR THE OTHER IS NEEDED
98
99 ELSEIF (MOD (KOUNT2, 2) .EQ. 0) THEN
100 I1 = N1
101 I2 = N2
102
103 XI = XN (I2) - XN (I1)
104 YI = YN (I2) - YN (I1)
105 XJF = XN (N2TEST) - XN (N3TEST)
106 YJF = YN (N2TEST) - YN (N3TEST)
107 XJB = XN (N0TEST) - XN (N1TEST)
108 YJB = YN (N0TEST) - YN (N1TEST)
109
110 FDOT = ( (XI * XJF) + (YI * YJF) ) /
111 & ( SQRT ( (XI * XI) + (YI * YI) ) *
112 & SQRT ( (XJF * XJF) + (YJF * YJF) ) )
113 D1F = SQRT ( (XN (N2TEST) - XN (I2)) ** 2 +
114 & (YN (N2TEST) - YN (I2)) ** 2 )
115 D2F = SQRT ( (XN (N3TEST) - XN (I1)) ** 2 +
116 & (YN (N3TEST) - YN (I1)) ** 2 )
117 DF = (D1F + D2F) * .5
118
119 BDOT = ( (XI * XJB) + (YI * YJB) ) /
120 & ( SQRT ( (XI * XI) + (YI * YI) ) *
121 & SQRT ( (XJB * XJB) + (YJB * YJB) ) )
122 D1B = SQRT ( (XN (N0TEST) - XN (I2)) ** 2 +
123 & (YN (N0TEST) - YN (I2)) ** 2 )
124 D2B = SQRT ( (XN (N1TEST) - XN (I1)) ** 2 +
125 & (YN (N1TEST) - YN (I1)) ** 2 )
126 DB = (D1B + D2B) * .5
127
128 C NOW COMPARE A FORWARD OR BACKWARD SHIFT AND PICK THE MOST
129 C APPROPRIATE ONE BASED ON ANGLE COSINE AND END DISTANCES
130 C IF ANY STICK OUT AS THE MOST APPROPRIATE
131
132 IF ((FDOT .GT. BDOT) .AND. (DF .LE. DB)) THEN
133 J1 = N2TEST
134 J2 = N3TEST
135 KOUNTL = KOUNT2
136 ELSEIF ((BDOT .GT. FDOT) .AND. (DB .LE. DF) .AND.
137 & (KOUNT2 .GT. 4)) THEN
138 J1 = N0TEST
139 J2 = N1TEST
140 KOUNTL = KOUNT2 - 2
141 ELSEIF (ABS (ABS( ACOS (BDOT)) - ABS (ACOS (FDOT))) .LE.
142 & .3490659) THEN
143 IF ((DF .LE. DB) .OR. (KOUNT2 .LE. 4)) THEN
144 J1 = N2TEST
145 J2 = N3TEST
146 KOUNTL = KOUNT2
147 ELSE
148 J1 = N0TEST
149 J2 = N1TEST
150 KOUNTL = KOUNT2 - 2
151 ENDIF
152
153 C NONE STICK OUT AS THE OBVIOUS WINNER - TAKE ONE BASED ON
154 C INTERSECTION PORTIONS
155
156 ELSE
157 IF (U .LT. .5) THEN
158 IF ((W .LT. .5) .AND. (KOUNT2 .GT. 4)) THEN
159 J1 = N0TEST
160 J2 = N1TEST
161 KOUNTL = KOUNT2 - 2
162 ELSE
163 J1 = N2TEST
164 J2 = N3TEST
165 KOUNTL = KOUNT2
166 ENDIF
167 ELSE
168 IF ((W .LT. .5) .AND. (KOUNT2 .GT. 4)) THEN
169 J1 = N0TEST
170 J2 = N1TEST
171 KOUNTL = KOUNT2 - 2
172 ELSE
173 J1 = N2TEST
174 J2 = N3TEST
175 KOUNTL = KOUNT2
176 ENDIF
177 ENDIF
178 ENDIF
179
180 C NODE LOOP FOR AN ODD NUMBER OF SPLITS - THE MATCH IS FINE
181
182 ELSE
183 I1 = N1
184 I2 = N2
185 J1 = N1TEST
186 J2 = N2TEST
187 KOUNTL = KOUNT2 - 1
188 ENDIF
189
190 C NOW THAT THE INITIAL MATCH IS MADE, CHECK MOVING BOTH SIDES
191 C FORWARD OR BACKWARD ONE NOTCH AND SEE IF THAT MATCH MAKES MORE SENSE
192 C THEN THE CURRENT MATCH
193
194 IFOR1 = I2
195 IFOR2 = LNODES (3, I2)
196 IBAC1 = LNODES (2, I1)
197 IBAC2 = I1
198
199 JFOR1 = J1
200 JFOR2 = LNODES (2, J1)
201 JBAC1 = LNODES (3, J2)
202 JBAC2 = J2
203
204 C NOW CALCULATE THE CROSS PRODUCT AND END DISTANCES
205
206 XIF = XN (IFOR2) - XN (IFOR1)
207 YIF = YN (IFOR2) - YN (IFOR1)
208 XJF = XN (JFOR2) - XN (JFOR1)
209 YJF = YN (JFOR2) - YN (JFOR1)
210 FDOT = ( (XIF * XJF) + (YIF * YJF) ) /
211 & ( SQRT ( (XIF * XIF) + (YIF * YIF) ) *
212 & SQRT ( (XJF * XJF) + (YJF * YJF) ) )
213 D1F = SQRT ( (XN (IFOR1) - XN (JFOR1)) ** 2 +
214 & (YN (IFOR1) - YN (JFOR1)) ** 2 )
215 D2F = SQRT ( (XN (IFOR2) - XN (JFOR2)) ** 2 +
216 & (YN (IFOR2) - YN (JFOR2)) ** 2 )
217 DF = (D1F + D2F) * .5
218
219 XIB = XN (IBAC2) - XN (IBAC1)
220 YIB = YN (IBAC2) - YN (IBAC1)
221 XJB = XN (JBAC2) - XN (JBAC1)
222 YJB = YN (JBAC2) - YN (JBAC1)
223 BDOT = ( (XIB * XJB) + (YIB * YJB) ) /
224 & ( SQRT ( (XIB * XIB) + (YIB * YIB) ) *
225 & SQRT ( (XJB * XJB) + (YJB * YJB) ) )
226 D1B = SQRT ( (XN (IBAC1) - XN (JBAC1)) ** 2 +
227 & (YN (IBAC1) - YN (JBAC1)) ** 2 )
228 D2B = SQRT ( (XN (IBAC2) - XN (JBAC2)) ** 2 +
229 & (YN (IBAC2) - YN (JBAC2)) ** 2 )
230 DB = (D1B + D2B) * .5
231
232 XI = XN (I2) - XN (I1)
233 YI = YN (I2) - YN (I1)
234 XJ = XN (J1) - XN (J2)
235 YJ = YN (J1) - YN (J2)
236 DOT = ( (XI * XJ) + (YI * YJ) ) /
237 & ( SQRT ( (XI * XI) + (YI * YI) ) *
238 & SQRT ( (XJ * XJ) + (YJ * YJ) ) )
239 D1 = SQRT ( (XN (I1) - XN (J2)) ** 2 +
240 & (YN (I1) - YN (J2)) ** 2 )
241 D2 = SQRT ( (XN (I2) - XN (J1)) ** 2 +
242 & (YN (I2) - YN (J1)) ** 2 )
243 D0 = (D1 + D2) * .5
244
245 C NOW COMPARE TO SEE IF ANOTHER COMBINATION MAKES BETTER SENSE
246
247 IF ( ( ((FDOT .GT. DOT) .AND. (DF .LT. D0)) .OR.
248 & ((.6 * FDOT .GT. DOT) .AND. (DF * .7 .LT. D0)) .OR.
249 & ((.2 * FDOT .GT. DOT) .AND. (DF * .5 .LT. D0)) ) .AND.
250 & (KOUNTL .GT. 4) ) THEN
251 FWINS = .TRUE.
252 D0 = DF
253 DOT = FDOT
254 ENDIF
255 IF ( ((BDOT .GT. DOT) .AND. (DB .LT. D0)) .OR.
256 & ((.6 * BDOT .GT. DOT) .AND. (DB * .7 .LT. D0)) .OR.
257 & ((.2 * BDOT .GT. DOT) .AND. (DB * .5 .LT. D0)) .AND.
258 & (NLOOP - KOUNTL - 2 .GT. 4) ) THEN
259 BWINS = .TRUE.
260 ENDIF
261
262 IF (BWINS) THEN
263 I1 = IBAC1
264 I2 = IBAC2
265 J1 = JBAC2
266 J2 = JBAC1
267 KOUNTL = KOUNTL + 2
268 ELSEIF (FWINS) THEN
269 I1 = IFOR1
270 I2 = IFOR2
271 J1 = JFOR2
272 J2 = JFOR1
273 KOUNTL = KOUNTL - 2
274 ENDIF
275
276 C NOW CHECK THAT TWO BOUNDARY LINES OR LINES CONNECTED TO THE
277 C BOUNDARY ARE NOT BEING JOINED INAPPROPRIATELY
278
279 IF (MATCHK (MXND, I1, I2, J1, J2, LXN)) THEN
280 CONTINUE
281
282 C TRY THE CURRENT I'S AND J'2 REVERSED
283
284 ELSEIF (MATCHK (MXND, J1, J2, I1, I2, LXN)) THEN
285 I1HOLD = I1
286 I2HOLD = I2
287 I1 = J1
288 I2 = J2
289 J1 = I1HOLD
290 J2 = I2HOLD
291 KOUNTL = NLOOP - KOUNTL - 2
292 ELSE
293
294 C TRY ONE STEP FORWARD AND BACKWARDS (NORMAL AND I'S AND J'S REVERSED)
295
296 IFOR1 = I2
297 IFOR2 = LNODES (3, I2)
298 JFOR1 = J1
299 JFOR2 = LNODES (2, J1)
300
301 IBAC1 = LNODES (2, I1)
302 IBAC2 = I1
303 JBAC1 = LNODES (3, J2)
304 JBAC2 = J2
305
306 IF (MATCHK (MXND, IFOR1, IFOR2, JFOR2, JFOR1, LXN)) THEN
307 I1 = IFOR1
308 I2 = IFOR2
309 J1 = JFOR2
310 J2 = JFOR1
311 KOUNTL = KOUNTL - 2
312 ELSEIF (MATCHK (MXND, JFOR2, JFOR1, IFOR1, IFOR2, LXN)) THEN
313 I1 = JFOR2
314 I2 = JFOR1
315 J1 = IFOR1
316 J2 = IFOR2
317 KOUNTL = NLOOP - KOUNTL
318 ELSEIF (MATCHK (MXND, IBAC1, IBAC2, JBAC2, JBAC1, LXN)) THEN
319 I1 = IBAC1
320 I2 = IBAC2
321 J1 = JBAC2
322 J2 = JBAC1
323 KOUNTL = KOUNTL + 2
324 ELSEIF (MATCHK (MXND, JBAC2, JBAC1, IBAC1, IBAC2, LXN)) THEN
325 I1 = JBAC2
326 I2 = JBAC1
327 J1 = IBAC1
328 J2 = IBAC2
329 KOUNTL = NLOOP - KOUNTL - 4
330 ELSE
331 ERR = .TRUE.
332 GOTO 100
333 ENDIF
334
335 ENDIF
336
337 100 CONTINUE
338
339 RETURN
340
341 END