Debian Codegraph @

packages/seacas/applications/fastq/pickm3.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 PICKM3 (N, X, Y, ANGLE, M1, M2, IFIRST)
8 C***********************************************************************
9
10 C SUBROUTINE PICKM3 = DETERMINES A REASONABLE SHAPE FOR A LOGICAL
11 C TRIANGLE WITH PERIMETER GIVEN IN X AND Y
12
13 C***********************************************************************
14
15 PARAMETER (RLARGE = 100000.)
16 DIMENSION X (N), Y (N), ANGLE (N)
17 DIMENSION SMANG (7), INDEX (7)
18 DIMENSION ISORT (3)
19
20 C FORM THE LIST OF SMALLEST ANGLES
21
22 NSA = 6
23 DO 100 I = 1, NSA
24 SMANG (I) = 10.
25 INDEX (I) = 0
26 100 CONTINUE
27
28 PI = ATAN2(0.0, -1.0)
29 TWOPI = PI + PI
30 AGOLD = ATAN2 (Y (1) - Y (N), X (1) - X (N))
31
32 DO 130 J = 1, N
33
34 C GET THE ANGLE FORMED BY THIS SET OF POINTS
35
36 NEXT = J + 1
37 IF (NEXT .GT. N) NEXT = 1
38 AGNEW = ATAN2 (Y (NEXT) - Y (J) , X (NEXT) - X (J))
39 DIFF = AGNEW - AGOLD
40 IF (DIFF .GT. PI)DIFF = DIFF - TWOPI
41 IF (DIFF .LT. - PI)DIFF = DIFF + TWOPI
42 ANGLE (J) = PI - DIFF
43 AGOLD = AGNEW
44
45 C SORT THIS ANGLE AGAINST PREVIOUS ANGLES TO SEE IF IT IS ONE OF
46 C THE SMALLEST
47
48 SMANG (NSA + 1) = ANGLE (J)
49 INDEX (NSA + 1) = J
50 DO II = 1, NSA
51 I = NSA + 1 - II
52 IF (SMANG (I + 1) .GE. SMANG (I)) GO TO 120
53 TEMP = SMANG (I)
54 ITEMP = INDEX (I)
55 SMANG (I) = SMANG (I + 1)
56 INDEX (I) = INDEX (I + 1)
57 SMANG (I + 1) = TEMP
58 INDEX (I + 1) = ITEMP
59 end do
60 120 CONTINUE
61
62 130 CONTINUE
63
64 C DETERMINE OPTIMUM ORIGIN / SHAPE COMBINATION FOR A TRIANGLE
65
66 ATOL = PI * 150. / 180.
67
68 C FIND SIDE DIVISION USING 5 SMALLEST ANGLES AND CHECK CONDITION
69
70 DO 140 I = 1, 3
71 ISORT (I) = INDEX (I)
72 140 CONTINUE
73 DO 160 I = 1, 2
74 DO 150 J = I + 1, 3
75 IF (ISORT (I) .GT. ISORT (J)) THEN
76 ITMP = ISORT (I)
77 ISORT (I) = ISORT (J)
78 ISORT (J) = ITMP
79 ENDIF
80 150 CONTINUE
81 160 CONTINUE
82 I1 = ISORT (1)
83 I2 = ISORT (2)
84 I3 = ISORT (3)
85 MM1 = I2 - I1
86 IF (MM1 .LT. 0) MM1 = N + MM1
87 MM2 = I3 - I2
88 IF (MM2 .LT. 0) MM2 = N + MM2
89 MM3 = N - MM1 - MM2
90 MAX = MAX0 (MM1, MM2, MM3)
91 IF (MAX .LE. N - MAX - 2) THEN
92
93 C ADD UP ASSIGNED ANGLES
94
95 IFIRST = I1
96 M1 = MM1
97 M2 = MM2
98 GBEST = ANGLE (I1) + ANGLE (I2) + ANGLE (I3)
99 ELSE
100 IFIRST = 1
101 GBEST = RLARGE
102 END IF
103
104 C LIMIT THE SIZE OF ANY SIDE
105
106 MMAX = (N - 2) / 2
107
108 C GO AROUND THE PERIMETER USING THE 10 SMALLEST ANGLES AS POSSIBLE
109 C STARTING POINTS, AND THEN FIND THE BEST COMBINATION OF SIDE LENGTHS
110
111 DO 190 ISA = 1, NSA
112 IF (SMANG (ISA) .LE. ATOL) THEN
113 I1 = INDEX (ISA)
114 SUM1 = ANGLE (I1)
115 IF (SUM1 .GE. GBEST) GO TO 190
116
117 C ASSIGN A TRIAL SECOND NODE
118
119 DO 180 N1 = 2, MMAX
120 I2 = I1 + N1
121 IF (I2 .GT. N)I2 = I2 - N
122 SUM2 = SUM1 + ANGLE (I2)
123 IF (SUM2 .GE. GBEST) GO TO 180
124
125 C ASSIGN A TRIAL THIRD NODE
126
127 DO 170 N2 = 2, N - N1 - 2
128 I3 = I2 + N2
129 IF (I3 .GT. N)I3 = I3 - N
130 GVAL = SUM2 + ANGLE (I3)
131 IF (GVAL .GE. GBEST) GO TO 170
132
133 C FIND SIDE DIVISION AND CHECK CONDITION
134
135 MM1 = I2 - I1
136 IF (MM1 .LT. 0) MM1 = N + MM1
137 MM2 = I3 - I2
138 IF (MM2 .LT. 0) MM2 = N + MM2
139 C ... Guess by GDS, MM1 substituted for MM?
140 MM3 = N - MM1 - MM2
141 MAX = MAX0 (MM1, MM2, MM3)
142 IF (MAX .LE. N - MAX - 2) THEN
143
144 C ADD UP ASSIGNED ANGLES AND COMPARE TO PREVIOUS TRIALS
145
146 IFIRST = I1
147 M1 = MM1
148 M2 = MM2
149 GBEST = GVAL
150 ENDIF
151 170 CONTINUE
152 180 CONTINUE
153 ENDIF
154 190 CONTINUE
155
156 RETURN
157
158 END