| 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 GETM3 (ML, MS, MNNPS, NS, ISLIST, NINT, IFLINE, NLPS, |
| 8 |
& ILLIST, LINKL, LINKS, X, Y, NID, NNPS, ANGLE, NPER, M1A, M1B, |
| 9 |
& M2A, M2B, M3A, M3B, XCEN, YCEN, CCW, ERR) |
| 10 |
C*********************************************************************** |
| 11 |
|
| 12 |
C SUBROUTINE GETM3 = GETS THE APPROPRIATE SIDE LENGTHS AND DIVISIONS |
| 13 |
C FOR A TRIANGULAR REGION |
| 14 |
|
| 15 |
C*********************************************************************** |
| 16 |
|
| 17 |
C SUBROUTINE CALLED BY: |
| 18 |
C QMESH = GENERATES QUAD ELEMENTS |
| 19 |
|
| 20 |
C*********************************************************************** |
| 21 |
|
| 22 |
C VARIABLES USED: |
| 23 |
C NNPS = ARRAY OF NUMBER OF NODES PER SIDE |
| 24 |
C CCW = .TRUE. IF THE SIDE IS ORIENTED CCW |
| 25 |
C NORM = .TRUE. IF THE FIRST SIDE IS TO BE TRIED AS THE BASE |
| 26 |
|
| 27 |
C*********************************************************************** |
| 28 |
|
| 29 |
DIMENSION NNPS (MNNPS), ISLIST (NS), LINKL (2, ML), LINKS (MS*2) |
| 30 |
DIMENSION NINT (ML), NLPS (MS), IFLINE (MS), ILLIST (MS*3) |
| 31 |
DIMENSION X (NPER), Y (NPER), NID (NPER), ANGLE (NPER) |
| 32 |
|
| 33 |
LOGICAL CCW, ERR |
| 34 |
|
| 35 |
C CALCULATE THE NUMBER OF NODES PER SIDE |
| 36 |
|
| 37 |
CALL NPS (ML, MS, MNNPS, NS, ISLIST, NINT, IFLINE, NLPS, ILLIST, |
| 38 |
& LINKL, LINKS, NNPS, ERR) |
| 39 |
IF (ERR) RETURN |
| 40 |
IF (.NOT. CCW) CALL IREVER (NNPS, NS) |
| 41 |
|
| 42 |
C FIND THE BEST CORNER NODES IN THE LIST |
| 43 |
|
| 44 |
CALL PICKM3 (NPER, X, Y, ANGLE, M1, M2, IFIRST) |
| 45 |
IF (IFIRST .NE. 1) CALL FQ_ROTATE (NPER, X, Y, NID, IFIRST) |
| 46 |
|
| 47 |
C NOW SORT THE LIST SO THE LONGEST SIDE IS FIRST |
| 48 |
|
| 49 |
M3 = NPER - M1 - M2 |
| 50 |
MMAX = MAX0 (M1, M2, M3) |
| 51 |
IF (M1 .EQ. MMAX)THEN |
| 52 |
CONTINUE |
| 53 |
ELSEIF (M2 .EQ. MMAX) THEN |
| 54 |
CALL FQ_ROTATE (NPER, X, Y, NID, M1 + 1) |
| 55 |
MHOLD = M1 |
| 56 |
M1 = M2 |
| 57 |
M2 = M3 |
| 58 |
M3 = MHOLD |
| 59 |
ELSEIF (M3 .EQ. MMAX) THEN |
| 60 |
CALL FQ_ROTATE (NPER, X, Y, NID, M1 + M2 + 1) |
| 61 |
MHOLD = M1 |
| 62 |
M1 = M3 |
| 63 |
M3 = M2 |
| 64 |
M2 = MHOLD |
| 65 |
ENDIF |
| 66 |
|
| 67 |
C SPLIT THE SIDES INTO LOGICAL DIVISIONS |
| 68 |
|
| 69 |
C IF (M2 .EQ. M3)THEN |
| 70 |
C M1A = (.5 * DBLE(M1)) + .001 |
| 71 |
C M1B = M1A |
| 72 |
C ELSEIF (M2 .LT. M3)THEN |
| 73 |
C FACT = DBLE(M2 - 1) / DBLE(M2 + M3 - 2) |
| 74 |
C M1A = FACT * M1 + .001 |
| 75 |
C M1A = MAX0 (M1A, 1) |
| 76 |
C M1A = MIN0 (M1A, M1-1) |
| 77 |
C M1B = M1 - M1A |
| 78 |
C ELSE |
| 79 |
C FACT = DBLE(M3 - 1) / DBLE(M2 + M3 - 2) |
| 80 |
C M1B = FACT * M1 + .001 |
| 81 |
C M1B = MAX0 (M1B, 1) |
| 82 |
C M1B = MIN0 (M1B, M1-1) |
| 83 |
C M1A = M1-M1B |
| 84 |
C ENDIF |
| 85 |
M1A = (M1 + M2 - M3) / 2 |
| 86 |
M1B = M1 - M1A |
| 87 |
M2A = M2 - M1A |
| 88 |
M2B = M1A |
| 89 |
M3A = M1B |
| 90 |
M3B = M3 - M3A |
| 91 |
|
| 92 |
ERR = .TRUE. |
| 93 |
IF (M3B .NE. M2A) THEN |
| 94 |
CALL MESSAGE('ERROR GENERATING TRIANGLE DIVISION POINT') |
| 95 |
RETURN |
| 96 |
ENDIF |
| 97 |
|
| 98 |
C DEFINE THE MIDDLE POINT AS THE AVERAGE OF PROPORIONAL DIVISIONS |
| 99 |
C OF SIDE DIVISION POINT TO OPPOSITE TRIANGLE CORNER LINES |
| 100 |
|
| 101 |
I1 = 1 |
| 102 |
I2 = M1 + 1 |
| 103 |
I3 = M1 + M2 + 1 |
| 104 |
J1 = I1 + M1A |
| 105 |
J2 = I2 + M2A |
| 106 |
J3 = I3 + M3A |
| 107 |
|
| 108 |
C FIND DISTANCES FROM CORNER TO CORNER, AND CORNERS TO SIDE DIVISIONS |
| 109 |
|
| 110 |
D1 = SQRT ( (X (I2) - X (I1)) **2 + (Y (I2) - Y (I1)) **2) |
| 111 |
D2 = SQRT ( (X (I3) - X (I2)) **2 + (Y (I3) - Y (I2)) **2) |
| 112 |
D3 = SQRT ( (X (I1) - X (I3)) **2 + (Y (I1) - Y (I3)) **2) |
| 113 |
D1A = SQRT ( (X (J1) - X (I1)) **2 + (Y (J1) - Y (I1)) **2) |
| 114 |
D1B = SQRT ( (X (I2) - X (J1)) **2 + (Y (I2) - Y (J1)) **2) |
| 115 |
D2A = SQRT ( (X (J2) - X (I2)) **2 + (Y (J2) - Y (I2)) **2) |
| 116 |
D2B = SQRT ( (X (I3) - X (J2)) **2 + (Y (I3) - Y (J2)) **2) |
| 117 |
D3A = SQRT ( (X (J3) - X (I3)) **2 + (Y (J3) - Y (I3)) **2) |
| 118 |
D3B = SQRT ( (X (I1) - X (J3)) **2 + (Y (I1) - Y (J3)) **2) |
| 119 |
|
| 120 |
C GET MIDPOINT TRIALS 1, 2, AND 3 AS PROPORTIONS |
| 121 |
|
| 122 |
PRO1 = .5 * ( (D3A / D3) + (D1B / D1)) |
| 123 |
X1 = X (J2) - (PRO1 * (X (J2) - X (I1))) |
| 124 |
Y1 = Y (J2) - (PRO1 * (Y (J2) - Y (I1))) |
| 125 |
PRO2 = .5 * ( (D2B / D2) + (D1A / D1)) |
| 126 |
X2 = X (J3) - (PRO2 * (X (J3) - X (I2))) |
| 127 |
Y2 = Y (J3) - (PRO2 * (Y (J3) - Y (I2))) |
| 128 |
PRO3 = .5 * ( (D2A / D2) + (D3B / D3)) |
| 129 |
X3 = X (J1) - (PRO3 * (X (J1) - X (I3))) |
| 130 |
Y3 = Y (J1) - (PRO3 * (Y (J1) - Y (I3))) |
| 131 |
|
| 132 |
C AVERAGE POINTS TO GET THE CENTER |
| 133 |
|
| 134 |
XCEN = (X1 + X2 + X3) / 3. |
| 135 |
YCEN = (Y1 + Y2 + Y3) / 3. |
| 136 |
|
| 137 |
ERR = .FALSE. |
| 138 |
RETURN |
| 139 |
|
| 140 |
END |