Debian Codegraph @

packages/seacas/applications/fastq/bcross.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 BCROSS (MXND, MLN, XN, YN, ZN, LXK, KXL, NXL, LXN,
8 & LNODES, I1, I2, J1, J2, NLOOP, BOK, LLL, XMIN, XMAX, YMIN,
9 & YMAX, ZMIN, ZMAX, DEV1, KREG, ERR)
10 C***********************************************************************
11
12 C SUBROUTINE BCROSS = CHECKS TO MAKE SURE THAT A BOUNDARY IS NOT
13 C BECOMING A PERMANENT CROSS
14
15 C***********************************************************************
16
17 DIMENSION XN(MXND), YN(MXND), ZN(MXND)
18 DIMENSION NXL(2, 3*MXND), LXN(4, MXND)
19 DIMENSION LXK(4, MXND), KXL(2, 3*MXND)
20 DIMENSION LNODES(MLN, MXND)
21
22 LOGICAL BOK, LCROSS, ERR
23
24 CHARACTER*3 DEV1
25
26 BOK = .TRUE.
27 ERR = .FALSE.
28
29 J0 = LNODES(2, J1)
30 J3 = LNODES(3, J2)
31
32 C IF J0 TO I2, OR J3 TO I1 IS TO BECOME A BOUNDARY LINE,
33 C THEN TEST THE CONNECTION TO SEE IF IT INTERSECTS ANY OTHER
34 C BOUNDARY LINES
35
36 KOUNT = 0
37
38 C FIRST TEST THE J0 TO I2 LINE
39
40 IF ((LXN(2, J0) .LT. 0) .AND. (LXN(2, I2) .LT. 0)) THEN
41 NODE1 = I1
42 NODE2 = I2
43 100 CONTINUE
44 NODE1 = NODE2
45 NODE2 = LNODES(3, NODE2)
46 IF ((LXN(2, NODE1) .LT. 0) .AND. (LXN(2, NODE2) .LT. 0)) THEN
47 IF (NODE2 .EQ. J0) THEN
48 CALL GETANG (MXND, MLN, XN, YN, LNODES, LXK, KXL,
49 & NXL, LXN, NODE1, J0, J1, ANGLE, ERR)
50 IF (ANGLE .LT. 0) THEN
51 BOK = .FALSE.
52 GOTO 130
53 ELSE
54 GOTO 110
55 ENDIF
56
57 ELSE
58 CALL INTSCT (XN(NODE1), YN(NODE1), XN(NODE2), YN(NODE2),
59 & XN(J0), YN(J0), XN(I2), YN(I2), U, W, LCROSS)
60 IF (LCROSS) THEN
61 BOK = .FALSE.
62 GOTO 130
63 ENDIF
64 ENDIF
65 ENDIF
66 KOUNT = KOUNT + 1
67 IF (KOUNT .LT. NLOOP) THEN
68 GOTO 100
69 ELSE
70 ERR = .TRUE.
71 GOTO 130
72 ENDIF
73 ENDIF
74
75 110 CONTINUE
76
77 C NEXT TEST THE J3 TO I1 LINE
78
79 KOUNT = 0
80 IF ((LXN(2, J3) .LT. 0) .AND. (LXN(2, I1) .LT. 0)) THEN
81 NODE1 = J3
82 NODE2 = LNODES(3, J3)
83 120 CONTINUE
84 NODE1 = NODE2
85 NODE2 = LNODES(3, NODE2)
86 IF ((LXN(2, NODE1) .LT. 0) .AND. (LXN(2, NODE2) .LT. 0)) THEN
87 IF (NODE2 .EQ. I1) THEN
88 CALL GETANG (MXND, MLN, XN, YN, LNODES, LXK, KXL,
89 & NXL, LXN, NODE1, I1, I2, ANGLE, ERR)
90 IF (ANGLE .LT. 0) THEN
91 BOK = .FALSE.
92 GOTO 130
93 ELSE
94 GOTO 130
95 ENDIF
96
97 ELSE
98 CALL INTSCT (XN(NODE1), YN(NODE1), XN(NODE2), YN(NODE2),
99 & XN(J3), YN(J3), XN(I1), YN(I1), U, W, LCROSS)
100 IF (LCROSS) THEN
101 BOK = .FALSE.
102 GOTO 130
103 ENDIF
104 ENDIF
105 ENDIF
106 KOUNT = KOUNT + 1
107 IF (KOUNT .LT. NLOOP) THEN
108 GOTO 120
109 ELSE
110 ERR = .TRUE.
111 GOTO 130
112 ENDIF
113 ENDIF
114
115 130 CONTINUE
116
117 RETURN
118
119 END