| 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 |
C======================================================================= |
| 8 |
SUBROUTINE HIDPAR (LINSET, IPSET, NPART, IEDSET, NEDGES, |
| 9 |
& LENF, NLNKE, NLNKF, LINKF, XN, YN, ZN, HIDEF, |
| 10 |
& HIDENP, TVHMAX, ICROSS, XP, YP, ZP) |
| 11 |
C======================================================================= |
| 12 |
|
| 13 |
C --*** HIDPAR *** (MESH) Create new nodes for partial lines |
| 14 |
C -- Written by Amy Gilkey - revised 02/24/88 |
| 15 |
C -- |
| 16 |
C --HIDPAR finds the amount of a partial line that is hidden. It then |
| 17 |
C --creates a new node at the last visible point and changes the LINSET(3,x) |
| 18 |
C --to point to the new node. |
| 19 |
C -- |
| 20 |
C --Parameters: |
| 21 |
C -- LINSET - I/O - the sorted line set |
| 22 |
C -- IPSET - I/O - the indices of the partial line set |
| 23 |
C -- NPART - I/O - the number of lines in the partial line set |
| 24 |
C -- IEDSET - IN - the edge line set; |
| 25 |
C -- (0) = face defining edge; 0 to delete edge |
| 26 |
C -- NEDGES - I/O - the number of lines in the edge set |
| 27 |
C -- LENF - IN - the cumulative face counts by element block |
| 28 |
C -- NLNKE - IN - the number of nodes per element |
| 29 |
C -- NLNKF - IN - the number of nodes per face |
| 30 |
C -- LINKF - IN - the connectivity for all faces |
| 31 |
C -- XN,YN,ZN - IN - the nodal coordinates |
| 32 |
C -- HIDEF(i) - IN - true iff face i is hidden |
| 33 |
C -- HIDENP - I/O - node status (as in HIDDEN) |
| 34 |
C -- TVHMAX - SCR - size is NPART |
| 35 |
C -- CROSS - SCR - size is NPART |
| 36 |
C -- |
| 37 |
C --Common Variables: |
| 38 |
C -- Uses NUMNPF, LLNSET of /D3NUMS/ |
| 39 |
|
| 40 |
PARAMETER (KFVIS=0, KFNODH=10, KFPOUT=20, KFOUT=90, KFAWAY=100) |
| 41 |
PARAMETER (KNVIS=0, KNFOVR=10, KNHID=100) |
| 42 |
|
| 43 |
PARAMETER (EPS = .001) |
| 44 |
C --EPS is a normalized error allowance |
| 45 |
|
| 46 |
include 'debug.blk' |
| 47 |
include 'dbnums.blk' |
| 48 |
include 'd3nums.blk' |
| 49 |
include 'sizes.blk' |
| 50 |
|
| 51 |
INTEGER LINSET(LLNSET,*) |
| 52 |
INTEGER IPSET(*) |
| 53 |
INTEGER IEDSET(0:2,*) |
| 54 |
INTEGER LENF(0:NELBLK) |
| 55 |
INTEGER NLNKE(NELBLK) |
| 56 |
INTEGER NLNKF(NELBLK) |
| 57 |
INTEGER LINKF(*) |
| 58 |
REAL XN(*), YN(*), ZN(*) |
| 59 |
INTEGER HIDEF(*) |
| 60 |
INTEGER HIDENP(*) |
| 61 |
REAL TVHMAX(*) |
| 62 |
INTEGER ICROSS(*) |
| 63 |
REAL XP(*), YP(*), ZP(*) |
| 64 |
|
| 65 |
LOGICAL CKCROS |
| 66 |
|
| 67 |
C --Clear out partial line parameter |
| 68 |
|
| 69 |
CALL INIREA (NPART, -99.0, TVHMAX) |
| 70 |
CALL INIINT (NPART, 0, ICROSS) |
| 71 |
|
| 72 |
C --Find an epsilon based on the average edge size |
| 73 |
|
| 74 |
XLEN = 0.0 |
| 75 |
YLEN = 0.0 |
| 76 |
DO 100 IEDG = 1, NEDGES |
| 77 |
IF (IEDSET(0,IEDG) .EQ. 0) GOTO 100 |
| 78 |
N1 = IEDSET(1,IEDG) |
| 79 |
N2 = IEDSET(2,IEDG) |
| 80 |
X1 = XN(N1) |
| 81 |
X2 = XN(N2) |
| 82 |
Y1 = YN(N1) |
| 83 |
Y2 = YN(N2) |
| 84 |
XLEN = XLEN + ABS (X2-X1) |
| 85 |
YLEN = YLEN + ABS (Y2-Y1) |
| 86 |
100 CONTINUE |
| 87 |
|
| 88 |
IF (NEDGES .GT. 0) THEN |
| 89 |
XLEN = XLEN / NEDGES |
| 90 |
YLEN = YLEN / NEDGES |
| 91 |
EPSDAT = SQRT (XLEN**2 + YLEN**2) * .01 |
| 92 |
END IF |
| 93 |
|
| 94 |
C --Check each edge line against each partial line for overlap |
| 95 |
|
| 96 |
NOLDPT = NPART |
| 97 |
|
| 98 |
nhid = 0 |
| 99 |
DO 130 IEDG = 1, NEDGES |
| 100 |
IFAC = IEDSET(0,IEDG) |
| 101 |
IF (IFAC .EQ. 0) GOTO 130 |
| 102 |
N1 = IEDSET(1,IEDG) |
| 103 |
N2 = IEDSET(2,IEDG) |
| 104 |
|
| 105 |
C --Calculate X-Y-Z box enclosing edge line |
| 106 |
|
| 107 |
X1 = XN(N1) |
| 108 |
X2 = XN(N2) |
| 109 |
XMIN = MIN (X1, X2) - EPSDAT |
| 110 |
XMAX = MAX (X1, X2) + EPSDAT |
| 111 |
Y1 = YN(N1) |
| 112 |
Y2 = YN(N2) |
| 113 |
YMIN = MIN (Y1, Y2) - EPSDAT |
| 114 |
YMAX = MAX (Y1, Y2) + EPSDAT |
| 115 |
Z1 = ZN(N1) |
| 116 |
Z2 = ZN(N2) |
| 117 |
ZMIN = MIN (Z1, Z2) - EPSDAT |
| 118 |
ZMAX = MAX (Z1, Z2) + EPSDAT |
| 119 |
|
| 120 |
XLN = X2 - X1 |
| 121 |
YLN = Y2 - Y1 |
| 122 |
|
| 123 |
IP = 1 |
| 124 |
110 CONTINUE |
| 125 |
IF (IP .LE. NPART) THEN |
| 126 |
IH = LINSET(2,IPSET(IP)) |
| 127 |
IV = LINSET(1,IPSET(IP)) |
| 128 |
|
| 129 |
C --Determine if partial line is within X-Y-Z box enclosing edge line |
| 130 |
|
| 131 |
X0 = XN(IH) |
| 132 |
XV = XN(IV) |
| 133 |
IF (XMAX .LT. MIN (X0, XV)) GOTO 120 |
| 134 |
IF (XMIN .GT. MAX (X0, XV)) GOTO 120 |
| 135 |
Y0 = YN(IH) |
| 136 |
YV = YN(IV) |
| 137 |
IF (YMAX .LT. MIN (Y0, YV)) GOTO 120 |
| 138 |
IF (YMIN .GT. MAX (Y0, YV)) GOTO 120 |
| 139 |
Z0 = ZN(IH) |
| 140 |
ZV = ZN(IV) |
| 141 |
IF (ZMAX .LT. MIN (Z0, ZV)) GOTO 120 |
| 142 |
|
| 143 |
IF ((N1 .EQ. IV) .OR. (N2 .EQ. IV)) THEN |
| 144 |
IF (N2 .NE. IH) ICROSS(IP) = IEDG |
| 145 |
GOTO 120 |
| 146 |
END IF |
| 147 |
IF (N2 .EQ. IH) GOTO 120 |
| 148 |
|
| 149 |
C --Calculate the intersection of the edge and the partial line |
| 150 |
C --Solve the simultaneous equations: |
| 151 |
C -- X = X0 + (XV - X0) * TVH = X1 + (X2 - X1) * TLN |
| 152 |
C -- Y = Y0 + (YV - Y0) * TVH = Y1 + (Y2 - Y1) * TLN |
| 153 |
|
| 154 |
XVH = XV - X0 |
| 155 |
YVH = YV - Y0 |
| 156 |
XLH = X1 - X0 |
| 157 |
YLH = Y1 - Y0 |
| 158 |
DET = XVH * (-YLN) - YVH * (-XLN) |
| 159 |
IF (DET .EQ. 0.0) GOTO 120 |
| 160 |
|
| 161 |
TVH = (-YLN * XLH + XLN * YLH) / DET |
| 162 |
IF ((TVH .GE. 0) .AND. (TVH .LE. 1+EPS)) THEN |
| 163 |
TLN = (-YVH * XLH + XVH * YLH) / DET |
| 164 |
IF ((TLN .GE. -EPS) .AND. (TLN .LE. 1+EPS)) THEN |
| 165 |
|
| 166 |
C --Save the overlap farthest from the hidden node |
| 167 |
|
| 168 |
IF (TVHMAX(IP) .LT. TVH) THEN |
| 169 |
IF (ZMIN .GT. Z0) THEN |
| 170 |
TVHNEW = TVH |
| 171 |
ELSE |
| 172 |
ZCR = Z0 + (ZV - Z0) * TVH |
| 173 |
ZCLN = Z1 + (Z2 - Z1) * TLN |
| 174 |
IF (ZCR .LE. ZCLN) THEN |
| 175 |
TVHNEW = TVH |
| 176 |
ELSE |
| 177 |
TVHNEW = TVHMAX(IP) |
| 178 |
END IF |
| 179 |
END IF |
| 180 |
|
| 181 |
C --Delete totally hidden lines from partial set |
| 182 |
|
| 183 |
IF (TVHNEW .GE. 1-EPS) THEN |
| 184 |
IF (TLN .LE. 0.5) THEN |
| 185 |
N = N1 |
| 186 |
ELSE |
| 187 |
N = N2 |
| 188 |
END IF |
| 189 |
IELB = 0 |
| 190 |
IXL = IDBLNK (IELB, IFAC, LENF, NLNKF) |
| 191 |
IF (CKCROS (N, IH, NLNKF(IELB), LINKF(IXL), |
| 192 |
& XN, YN, ZN)) THEN |
| 193 |
|
| 194 |
C --If face hides the line, move partial line to totally |
| 195 |
C --hidden list |
| 196 |
|
| 197 |
I = IPSET(IP) |
| 198 |
IPSET(IP) = IPSET(NPART) |
| 199 |
IPSET(NPART) = I |
| 200 |
TVHMAX(IP) = TVHMAX(NPART) |
| 201 |
ICROSS(IP) = ICROSS(NPART) |
| 202 |
NPART = NPART - 1 |
| 203 |
IP = IP - 1 |
| 204 |
ELSE IF (ICROSS(IP) .EQ. 0) THEN |
| 205 |
ICROSS(IP) = IEDG |
| 206 |
END IF |
| 207 |
|
| 208 |
ELSE IF ((TLN .GE. 0.0) .AND. (TLN .LE. 1.0)) THEN |
| 209 |
TVHMAX(IP) = TVHNEW |
| 210 |
END IF |
| 211 |
END IF |
| 212 |
END IF |
| 213 |
END IF |
| 214 |
120 CONTINUE |
| 215 |
IP = IP + 1 |
| 216 |
GOTO 110 |
| 217 |
END IF |
| 218 |
130 CONTINUE |
| 219 |
if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1)) |
| 220 |
& write (*, '(1x,a,i5)') 'invisible lines =', noldpt-npart |
| 221 |
|
| 222 |
C --Group those partial lines which may end on an edge |
| 223 |
|
| 224 |
NNPART = NPART |
| 225 |
DO 140 IP = NNPART, 1, -1 |
| 226 |
IF ((ICROSS(IP) .NE. 0) .OR. (TVHMAX(IP) .LT. EPS)) THEN |
| 227 |
I = IPSET(IP) |
| 228 |
IPSET(IP) = IPSET(NPART) |
| 229 |
IPSET(NPART) = I |
| 230 |
T = TVHMAX(IP) |
| 231 |
TVHMAX(IP) = TVHMAX(NPART) |
| 232 |
TVHMAX(NPART) = T |
| 233 |
I = ICROSS(IP) |
| 234 |
ICROSS(IP) = ICROSS(NPART) |
| 235 |
ICROSS(NPART) = I |
| 236 |
NPART = NPART - 1 |
| 237 |
END IF |
| 238 |
140 CONTINUE |
| 239 |
if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1)) |
| 240 |
& write (*, '(1x,a,i5)') 'questionable lines =', NNPART-npart |
| 241 |
|
| 242 |
C --Find the midpoint of the questionable partial lines |
| 243 |
|
| 244 |
DO 150 IP = NPART+1, NNPART |
| 245 |
IH = LINSET(2,IPSET(IP)) |
| 246 |
IV = LINSET(1,IPSET(IP)) |
| 247 |
TVH = TVHMAX(IP) |
| 248 |
if (tvh .lt. 0) tvh = 0.0 |
| 249 |
XP(IP) = 0.5 * (XN(IV) + XN(IH) + (XN(IV) - XN(IH)) * TVH) |
| 250 |
YP(IP) = 0.5 * (YN(IV) + YN(IH) + (YN(IV) - YN(IH)) * TVH) |
| 251 |
ZP(IP) = 0.5 * (ZN(IV) + ZN(IH) + (ZN(IV) - ZN(IH)) * TVH) |
| 252 |
150 CONTINUE |
| 253 |
|
| 254 |
C --Find out if the midpoint of the questionable partial lines are |
| 255 |
C --hidden by a visible face |
| 256 |
|
| 257 |
NQUES = NNPART - NPART |
| 258 |
IQUES = NPART+1 |
| 259 |
DO 170 IELB = 1, NELBLK |
| 260 |
IF (NLNKE(IELB) .GE. 4) THEN |
| 261 |
IXL = IDBLNK (IELB, 0, LENF, NLNKF) |
| 262 |
DO 160 IFAC = LENF(IELB-1)+1, LENF(IELB) |
| 263 |
IF (HIDEF(IFAC) .LT. KFOUT) THEN |
| 264 |
CALL HIDMID (NLNKF(IELB), LINKF(IXL), |
| 265 |
& XN, YN, ZN, LINSET, |
| 266 |
& IPSET(IQUES), TVHMAX(IQUES), ICROSS(IQUES), |
| 267 |
& XP(IQUES), YP(IQUES), ZP(IQUES), NQUES) |
| 268 |
END IF |
| 269 |
IXL = IXL + NLNKF(IELB) |
| 270 |
160 CONTINUE |
| 271 |
END IF |
| 272 |
170 CONTINUE |
| 273 |
NPART = NPART + NQUES |
| 274 |
if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1)) |
| 275 |
& write (*, '(1x,a,i5)') 'invisible lines =', NNPART-npart |
| 276 |
|
| 277 |
C --Delete the edges which are totally hidden lines |
| 278 |
|
| 279 |
nhid = 0 |
| 280 |
DO 190 IP = NPART+1, NOLDPT |
| 281 |
IV = LINSET(1,IPSET(IP)) |
| 282 |
IH = LINSET(2,IPSET(IP)) |
| 283 |
DO 180 IEDG = 1, NEDGES |
| 284 |
IF (IEDSET(1,IEDG) .EQ. IV) THEN |
| 285 |
IF (IEDSET(2,IEDG) .EQ. IH) THEN |
| 286 |
IEDSET(0,IEDG) = 0 |
| 287 |
nhid = nhid + 1 |
| 288 |
GOTO 190 |
| 289 |
END IF |
| 290 |
END IF |
| 291 |
180 CONTINUE |
| 292 |
190 CONTINUE |
| 293 |
if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1)) |
| 294 |
& write (*, '(1x,a,i5)') 'invisible edges =', nhid |
| 295 |
|
| 296 |
C --Delete totally visible lines from partial set |
| 297 |
|
| 298 |
nwhole = 0 |
| 299 |
DO 200 IP = IQUES, NPART |
| 300 |
IF (TVHMAX(IP) .LT. 0.001) THEN |
| 301 |
C --Line is totally visible, so delete from partial line set as visible |
| 302 |
C --and mark hidden node as visible |
| 303 |
nwhole = nwhole + 1 |
| 304 |
IH = LINSET(2,IPSET(IP)) |
| 305 |
HIDENP(IH) = KNVIS |
| 306 |
LINSET(3,IPSET(IP)) = 1 |
| 307 |
END IF |
| 308 |
200 CONTINUE |
| 309 |
if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1)) |
| 310 |
& write (*, '(1x,a,i5)') 'whole lines =', nwhole |
| 311 |
|
| 312 |
C --Calculate the visible part of each partial line, put coordinates into |
| 313 |
C --XP, YP, ZP (cannot overwrite coordinates until done using them |
| 314 |
C --for partial line calculation) |
| 315 |
|
| 316 |
DO 210 IP = 1, NPART |
| 317 |
IF (LINSET(3,IPSET(IP)) .EQ. 0) THEN |
| 318 |
IH = LINSET(2,IPSET(IP)) |
| 319 |
IV = LINSET(1,IPSET(IP)) |
| 320 |
TVH = TVHMAX(IP) |
| 321 |
XP(IP) = XN(IH) + (XN(IV) - XN(IH)) * TVH |
| 322 |
YP(IP) = YN(IH) + (YN(IV) - YN(IH)) * TVH |
| 323 |
ZP(IP) = ZN(IH) + (ZN(IV) - ZN(IH)) * TVH |
| 324 |
END IF |
| 325 |
210 CONTINUE |
| 326 |
|
| 327 |
C --Make new partial line nodes by filling in coordinates of hidden nodes |
| 328 |
C --and pointing LINSET(3,i) to these nodes |
| 329 |
|
| 330 |
C --Skip node 1 since LINSET(3,x) = 1 is reserved for whole lines |
| 331 |
IPART = NUMNPF |
| 332 |
|
| 333 |
DO 230 IP = 1, NPART |
| 334 |
IF (LINSET(3,IPSET(IP)) .EQ. 0) THEN |
| 335 |
IPART = IPART + 1 |
| 336 |
IF (IPART .GT. NPSIZ) THEN |
| 337 |
WRITE (*, 10000) 'ERROR in HIDPAR', IP, IPART, NUMNPF |
| 338 |
10000 FORMAT (1X, A, 3I5) |
| 339 |
GOTO 240 |
| 340 |
END IF |
| 341 |
LINSET(3,IPSET(IP)) = IPART |
| 342 |
XN(IPART) = XP(IP) |
| 343 |
YN(IPART) = YP(IP) |
| 344 |
ZN(IPART) = ZP(IP) |
| 345 |
END IF |
| 346 |
230 CONTINUE |
| 347 |
240 CONTINUE |
| 348 |
if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1)) |
| 349 |
& write (*, '(1x,a,i5)') 'partial lines =', npart |
| 350 |
|
| 351 |
C --Reset partial line set to include totally KNVISible lines |
| 352 |
NPART = NNPART |
| 353 |
|
| 354 |
RETURN |
| 355 |
END |