Debian Codegraph @

packages/seacas/applications/fastq/getm5.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 GETM5 (IA, ML, MS, MNNPS, NS, ISLIST, NINT, IFLINE,
8 & NLPS, ILLIST, LINKL, LINKS, X, Y, NID, NNPS, ANGLE, NPER,
9 & M1A, M1B, M2, M3A, M3B, M4A, M4B, M5, MC, XCEN, YCEN, CCW, ERR)
10 C***********************************************************************
11
12 C SUBROUTINE GETM5 = GETS THE APPROPRIATE SIDE LENGTHS AND DIVISIONS
13 C FOR A PENTAGON REGION
14
15 C WRITTEN BY: HORACIO RECALDE DATE: JAN 1988
16
17 C***********************************************************************
18
19 C SUBROUTINE CALLED BY:
20 C QMESH = GENERATES QUAD ELEMENTS
21
22 C***********************************************************************
23
24 C VARIABLES USED:
25 C NNPS = ARRAY OF NUMBER OF NODES PER SIDE
26 C CCW = .TRUE. IF THE SIDE IS ORIENTED CCW
27 C NORM = .TRUE. IF THE FIRST SIDE IS TO BE TRIED AS THE BASE
28
29 C***********************************************************************
30
31 DIMENSION IA(1)
32 DIMENSION NNPS(MNNPS), ISLIST(NS), LINKL(2, ML), LINKS(MS*2)
33 DIMENSION NLPS(MS), NINT(ML), IFLINE(MS), ILLIST(MS*3)
34 DIMENSION X(NPER), Y(NPER), NID(NPER), ANGLE(NPER)
35 DIMENSION XJ(3), YJ(3)
36
37 LOGICAL CCW, ERR
38
39 C CALCULATE THE NUMBER OF NODES PER SIDE
40
41 CALL NPS (ML, MS, MNNPS, NS, ISLIST, NINT, IFLINE, NLPS, ILLIST,
42 & LINKL, LINKS, NNPS, ERR)
43 IF (ERR)RETURN
44 IF (.NOT.CCW) CALL IREVER (NNPS, NS)
45
46 C RESERVE MEMORY FOR THE STACKS
47
48 CALL MDRSRV ('IST2', IP2, NPER)
49 CALL MDRSRV ('IST3', IP3, NPER)
50 CALL MDRSRV ('IST4', IP4, NPER)
51 CALL MDRSRV ('IST5', IP5, NPER)
52 CALL MDRSRV ('INDST', INDP, NPER)
53
54 C FIND THE BEST CORNER NODES IN THE LIST
55
56 CALL PICKM5 (NPER, X, Y, ANGLE, IA(IP2), IA(IP3), IA(IP4),
57 & IA(IP5), IA(INDP), IFIRST, M1, M2, M3, M4)
58 IF (IFIRST .EQ. 0) THEN
59 ERR = .TRUE.
60 CALL MESSAGE('ERROR FITTING LOGICAL PENTAGON TO DATA')
61 RETURN
62 ELSE IF (IFIRST .EQ. -1) THEN
63 ERR = .TRUE.
64 CALL MESSAGE('TOLERANCE EXCEEDED')
65 RETURN
66 ELSE IF (IFIRST.NE.1) THEN
67 CALL FQ_ROTATE (NPER, X, Y, NID, IFIRST)
68 END IF
69
70 C DELETE THE STACKS
71
72 CALL MDDEL ('IST2')
73 CALL MDDEL ('IST3')
74 CALL MDDEL ('IST4')
75 CALL MDDEL ('IST5')
76 CALL MDDEL ('INDST')
77
78 C NOW SORT THE LIST SO THE LONGEST SIDE IS FIRST
79
80 M5 = NPER - M1 - M2 - M3 - M4
81 MMAX = MAX0(M1, M2, M3, M4, M5)
82 IF (M1 .EQ. MMAX) THEN
83 KNUM = 0
84 ELSE IF (M2 .EQ. MMAX) THEN
85 CALL FQ_ROTATE (NPER, X, Y, NID, M1 + 1)
86 KNUM = 1
87 ELSE IF (M3 .EQ. MMAX) THEN
88 CALL FQ_ROTATE (NPER, X, Y, NID, M1 + M2 + 1)
89 KNUM = 2
90 ELSE IF (M4 .EQ. MMAX) THEN
91 CALL FQ_ROTATE (NPER, X, Y, NID, M1 + M2 + M3 + 1)
92 KNUM = 3
93 ELSE IF (M5 .EQ. MMAX) THEN
94 CALL FQ_ROTATE (NPER, X, Y, NID, M1 + M2 + M3 + M4 + 1)
95 KNUM = 4
96 END IF
97 DO 100 KK = 1, KNUM
98 MHOLD = M1
99 M1 = M2
100 M2 = M3
101 M3 = M4
102 M4 = M5
103 M5 = MHOLD
104 100 CONTINUE
105
106 C SPLIT THE SIDES INTO LOGICAL DIVISIONS
107
108 M1A = (M1 + M4 + M5 - M2 - M3)/2
109 M1B = (M1 + M2 + M3 - M4 - M5)/2
110 M3A = M1B
111 M3B = (M3 + M4 + M5 - M1 - M2)/2
112 M4A = (M2 + M3 + M4 - M1 - M5)/2
113 M4B = M1A
114 MC = (M1 + M2 + M5 - M3 - M4)/2
115
116 C DEFINE THE MIDDLE POINT AS THE AVERAGE OF PROPORIONAL DIVISIONS
117 C OF SIDE DIVISION POINT TO OPPOSITE TRIANGLE CORNER LINES
118
119 I1 = M1A + 1
120 I2 = I1 + M1B + M2 + M3A
121 I3 = I2 + M3B + M4A
122
123 C FIND DISTANCES FROM CORNER TO CORNER, AND CORNERS TO SIDE DIVISIONS
124
125 D1 = SQRT((X(I2) - X(I1))**2 + (Y(I2) - Y(I1))**2)
126 D2 = SQRT((X(I3) - X(I2))**2 + (Y(I3) - Y(I2))**2)
127 D3 = SQRT((X(I1) - X(I3))**2 + (Y(I1) - Y(I3))**2)
128 D1A = DBLE(M4B)*D1/DBLE(M4)
129 D1B = D1 - D1A
130 D2A = DBLE(M1B)*D2/DBLE(M1)
131 D2B = D2 - D1A
132 D3A = DBLE(M3B)*D3/DBLE(M3)
133 D3B = D3 - D3A
134 XJ(1) = X(I1) + (X(I2) - X(I1))*D1A/D1
135 YJ(1) = Y(I1) + (Y(I2) - Y(I1))*D1A/D1
136 XJ(2) = X(I2) + (X(I3) - X(I2))*D2A/D2
137 YJ(2) = Y(I2) + (Y(I3) - Y(I2))*D2A/D2
138 XJ(3) = X(I3) + (X(I1) - X(I3))*D3A/D3
139 YJ(3) = Y(I3) + (Y(I1) - Y(I3))*D3A/D3
140
141 C GET MIDPOINT TRIALS 1, 2, AND 3 AS PROPORTIONS
142
143 PRO1 = .5*((D3A/D3) + (D1B/D1))
144 X1 = XJ(2) - (PRO1*(XJ(2) - X(I1)))
145 Y1 = YJ(2) - (PRO1*(YJ(2) - Y(I1)))
146 PRO2 = .5*((D2B/D2) + (D1A/D1))
147 X2 = XJ(3) - (PRO2*(XJ(3) - X(I2)))
148 Y2 = YJ(3) - (PRO2*(YJ(3) - Y(I2)))
149 PRO3 = .5*((D2A/D2) + (D3B/D3))
150 X3 = XJ(1) - (PRO3*(XJ(1) - X(I3)))
151 Y3 = YJ(1) - (PRO3*(YJ(1) - Y(I3)))
152
153 C AVERAGE POINTS TO GET THE CENTER
154
155 XCEN = (X1 + X2 + X3)/3.
156 YCEN = (Y1 + Y2 + Y3)/3.
157
158 ERR = .FALSE.
159 RETURN
160
161 END