Debian Codegraph @

packages/seacas/applications/blot/hidedg.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 C=======================================================================
8 SUBROUTINE HIDEDG (HIDEF, HIDENP, LENF, NLNKE, NLNKF, LINKF,
9 & NOTSEL, IELBST, IEDSET, NEDGES, NREF, LREF, MREF,
10 * ISBACK, NAMELB)
11 C=======================================================================
12
13 C --*** HIDEDG *** (MESH) Identify 3D lines on edge of visible mesh
14 C -- Written by Amy Gilkey - revised 02/26/88
15 C --
16 C --HIDEDG finds all lines that may make up the visible edge of the mesh.
17 C --"Edges" are lines of partially visible faces or lines of
18 C --totally visible faces which have no matching edge.
19 C --
20 C --Parameters:
21 C -- HIDEF(i) - IN - true iff face i is hidden
22 C -- HIDENP - IN - node status (as in HIDDEN)
23 C -- LENF - IN - the cumulative face counts by element block
24 C -- NLNKE - IN - the number of nodes per element
25 C -- NLNKF - IN - the number of nodes per face
26 C -- LINKF - IN - the connectivity for all faces
27 C -- NOTSEL - IN - true iff faces with selected element blocks
28 C -- are not needed
29 C -- IELBST - IN - the element block status (>0 if selected)
30 C -- IEDSET - OUT - the edge line set; (0) = face defining edge
31 C -- NEDGES - OUT - the number of lines in the edge set
32 C -- NREF - SCRATCH - the number of references to a node in the edge set;
33 C -- length = NUMNPF
34 C -- LREF - SCRATCH - the last edge set index of a node in the edge set;
35 C -- length = NUMNPF
36 C --
37 C --Common Variables:
38 C -- Uses NELBLK of /DBNUMS/
39 C -- Uses NUMNPF of /D3NUMS/
40
41 PARAMETER (KFVIS=0, KFNODH=10, KFPOUT=20, KFOUT=90, KFAWAY=100)
42 PARAMETER (KNVIS=0, KNFOVR=10, KNHID=100)
43
44 common /debugc/ cdebug
45 common /debugn/ idebug
46 character*8 cdebug
47
48 include 'dbnums.blk'
49 include 'd3nums.blk'
50
51 INTEGER HIDEF(*)
52 INTEGER HIDENP(*)
53 INTEGER LENF(0:NELBLK)
54 INTEGER NLNKE(NELBLK)
55 INTEGER NLNKF(NELBLK)
56 INTEGER LINKF(*)
57 LOGICAL NOTSEL
58 INTEGER IELBST(NELBLK)
59 INTEGER IEDSET(0:2,*)
60 INTEGER NREF(NUMNPF), LREF(NUMNPF), MREF(NUMNPF)
61 LOGICAL ISBACK(NUMNPF)
62 CHARACTER*(*) NAMELB(*)
63
64 LOGICAL ANYBRI, ANYSHE
65
66 ANYBRI = .FALSE.
67 ANYSHE = .FALSE.
68 DO 100 IELB = 1, NELBLK
69 IF (NLNKE(IELB) .GT. 4) ANYBRI = .TRUE.
70 IF (NAMELB(IELB)(:3) .EQ. 'TET') ANYBRI = .TRUE.
71 IF (NLNKE(IELB) .EQ. 4 .AND. NAMELB(IELB)(:3) .NE. 'TET')
72 $ ANYSHE = .TRUE.
73 100 CONTINUE
74
75 CALL INIINT (NUMNPF, 0, LREF)
76
77 IF (.NOT. ANYBRI) GOTO 200
78
79 C --Mark nodes in faces that point away
80
81 CALL INILOG (NUMNPF, .FALSE., ISBACK)
82
83 DO 130 IELB = 1, NELBLK
84 IF (NLNKE(IELB) .GT. 4 .OR. NAMELB(IELB)(:3) .eq. 'TET') THEN
85 IXL0 = IDBLNK (IELB, 0, LENF, NLNKF) - 1
86 DO 120 IFAC = LENF(IELB-1)+1, LENF(IELB)
87 IF (HIDEF(IFAC) .GE. KFAWAY) THEN
88 DO 110 ILINK = 1, NLNKF(IELB)
89 ISBACK(LINKF(IXL0+ILINK)) = .TRUE.
90 110 CONTINUE
91 END IF
92 IXL0 = IXL0 + NLNKF(IELB)
93 120 CONTINUE
94 END IF
95 130 CONTINUE
96
97 NEDGES = 0
98 nmov = 0
99 DO 190 IELB = 1, NELBLK
100 IF (NLNKE(IELB) .GT. 4 .OR. NAMELB(IELB)(:3) .eq. 'TET') THEN
101
102 C --Eliminate faces of a selected element block
103 IF (NOTSEL .AND. (IELBST(IELB) .GT. 0)) GOTO 190
104
105 DO 180 IFAC = LENF(IELB-1)+1, LENF(IELB)
106 IF (HIDEF(IFAC) .LT. KFOUT) THEN
107 IXL0 = IDBLNK (IELB, IFAC, LENF, NLNKF) - 1
108
109 C --Eliminate faces that do not have any nodes in faces
110 C --that point away
111
112 NBACK = 0
113 DO 140 ILINK = 1, NLNKF(IELB)
114 IF (ISBACK(LINKF(IXL0+ILINK))) NBACK = NBACK + 1
115 140 CONTINUE
116 IF (NBACK .LT. 2) GOTO 180
117
118 C --Extract face lines
119
120 NOLD = NEDGES
121 N2 = LINKF(IXL0+NLNKF(IELB))
122 LREFN2 = LREF(N2)
123 LSTREF = LREFN2
124
125 DO 170 ILINK = 1, NLNKF(IELB)
126 N1 = N2
127 N2 = LINKF(IXL0+ILINK)
128 LREFN1 = LREFN2
129 IF (ILINK .LT. NLNKF(IELB)) THEN
130 LREFN2 = LREF(N2)
131 ELSE
132 LREFN2 = LSTREF
133 END IF
134
135 IF (n1 .eq. n2) goto 170
136 IF (.NOT. ISBACK(N1)) GOTO 170
137 IF (.NOT. ISBACK(N2)) GOTO 170
138 IF ((HIDENP(N1) .GT. KNVIS)
139 & .AND. (HIDENP(N2) .GT. KNVIS)) GOTO 170
140 IF (HIDENP(N1) .GE. KNHID) GOTO 170
141 IF (HIDENP(N2) .GE. KNHID) GOTO 170
142 NMIN = MIN (N1, N2)
143 NMAX = MAX (N1, N2)
144
145 C --Search for line in existing lines
146
147 DO 150 IL = MIN (LREFN1, LREFN2, NOLD), 1, -1
148 IF (IEDSET(1,IL) .EQ. NMIN .AND.
149 * IEDSET(2,IL) .EQ. NMAX) GOTO 160
150 150 CONTINUE
151 160 CONTINUE
152
153 C --Insert new line or pointer to face if duplicate
154
155 IF (IL .GT. 0) THEN
156 IF (NBACK .LE. 2) IEDSET(0,IL) = IFAC
157 nmov = nmov + 1
158 ELSE
159 NEDGES = NEDGES + 1
160 IEDSET(0,NEDGES) = IFAC
161 IEDSET(1,NEDGES) = NMIN
162 IEDSET(2,NEDGES) = NMAX
163 LREF(N1) = NEDGES
164 LREF(N2) = NEDGES
165 END IF
166 170 CONTINUE
167 END IF
168 180 CONTINUE
169 END IF
170 190 CONTINUE
171
172 if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1))
173 & write (*, '(1x,a,i5)') 'non-shell visible edge set =', nedges
174 if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1))
175 & write (*, '(1x,a,i5)') '***removed =', nmov
176 200 CONTINUE
177
178 IF (.NOT. ANYSHE) GOTO 320
179
180 C --Mark nodes in shell faces with any nodes hidden
181
182 DO 210 INP = 1, NUMNPF
183 IF (LREF(INP) .LE. 0) THEN
184 NREF(INP) = 0
185 ELSE
186 NREF(INP) = 1
187 END IF
188 210 CONTINUE
189
190 CALL INILOG (NUMNPF, .FALSE., ISBACK)
191
192 DO 250 IELB = 1, NELBLK
193 IF (NLNKE(IELB) .EQ. 4 .AND. NAMELB(IELB)(:3) .ne. 'TET') THEN
194 IXL0 = IDBLNK (IELB, 0, LENF, NLNKF) - 1
195 DO 240 IFAC = LENF(IELB-1)+1, LENF(IELB)
196 NHID = 0
197 DO 220 ILINK = 1, NLNKF(IELB)
198 IF (HIDENP(LINKF(IXL0+ILINK)) .GT. KNVIS)
199 & NHID = NHID + 1
200 220 CONTINUE
201 IF (NHID .GT. 0) THEN
202 DO 230 ILINK = 1, NLNKF(IELB)
203 C???? ISBACK(LINKF(IXL0+ILINK)) = .TRUE.
204 230 CONTINUE
205 END IF
206 IXL0 = IXL0 + NLNKF(IELB)
207 240 CONTINUE
208 END IF
209 250 CONTINUE
210
211 NEWEDG = NEDGES + 1
212 nmov = 0
213
214 call iniint(numnpf, 0, mref)
215 do i=nedges, 1, -1
216 mref(iedset(1,i)) = i
217 mref(iedset(2,i)) = i
218 end do
219
220 DO 310 IELB = 1, NELBLK
221 IF (NLNKE(IELB) .EQ. 4 .AND. NAMELB(IELB)(:3) .ne. 'TET') THEN
222
223 C --Eliminate faces of a selected element block
224 IF (NOTSEL .AND. (IELBST(IELB) .GT. 0)) GOTO 310
225
226 DO 300 IFAC = LENF(IELB-1)+1, LENF(IELB)
227 IF (HIDEF(IFAC) .LT. KFOUT) THEN
228 IXL0 = IDBLNK (IELB, IFAC, LENF, NLNKF) - 1
229
230 C --Extract face lines
231
232 NOLD = NEDGES
233 N2 = LINKF(IXL0+NLNKF(IELB))
234 LREFN2 = LREF(N2)
235 LSTREF = LREFN2
236
237 DO 290 ILINK = 1, NLNKF(IELB)
238 N1 = N2
239 N2 = LINKF(IXL0+ILINK)
240 LREFN1 = LREFN2
241 IF (ILINK .LT. NLNKF(IELB)) THEN
242 LREFN2 = LREF(N2)
243 ELSE
244 LREFN2 = LSTREF
245 END IF
246
247 IF ((HIDENP(N1) .GT. KNVIS)
248 & .AND. (HIDENP(N2) .GT. KNVIS)) GOTO 290
249 IF (HIDENP(N1) .GE. KNHID) GOTO 290
250 IF (HIDENP(N2) .GE. KNHID) GOTO 290
251 NMIN = MIN (N1, N2)
252 NMAX = MAX (N1, N2)
253
254 C --Search for line in existing lines
255
256 IMIN = max(mref(n1), mref(n2),1)
257 DO 260 IL = MIN (LREFN1, LREFN2, NOLD), IMIN, -1
258 IF (IEDSET(1,IL) .EQ. NMIN .AND.
259 * IEDSET(2,IL) .EQ. NMAX) GOTO 270
260 260 CONTINUE
261 270 CONTINUE
262
263 IF (IL .GT. 0) THEN
264 IF (IL .LT. NEWEDG) THEN
265
266 C --Leave edge matching non-shell as edge
267 CONTINUE
268
269 ELSE IF (ISBACK(N1) .OR. ISBACK(N2)) THEN
270
271 C --Adjust pointer to face if duplicate line and either
272 C --node is hidden in a shell quad
273 NHID = 0
274 DO 280 I = 1, NLNKF(IELB)
275 IF (HIDENP(LINKF(IXL0+I)) .GT. KNVIS)
276 & NHID = NHID + 1
277 280 CONTINUE
278 IF (NHID .LE. 0) IEDSET(0,NEDGES) = IFAC
279 C????C should check the ZQ coordinate
280
281 ELSE
282
283 C --Delete duplicate line if both nodes visible
284 C --in all shell quads
285
286 IEDSET(0,IL) = IEDSET(0,NEDGES)
287 IEDSET(1,IL) = IEDSET(1,NEDGES)
288 IEDSET(2,IL) = IEDSET(2,NEDGES)
289 NREF(N1) = NREF(N1) - 1
290 NREF(N2) = NREF(N2) - 1
291 IF (NREF(N1) .LE. 0) LREF(N1) = 0
292 IF (NREF(N2) .LE. 0) LREF(N2) = 0
293 NEDGES = NEDGES - 1
294 IF (NOLD .GT. NEDGES) NOLD = NEDGES
295 nmov = nmov + 1
296 END IF
297 ELSE
298
299 C --Insert new line
300
301 NEDGES = NEDGES + 1
302 IEDSET(0,NEDGES) = IFAC
303 IEDSET(1,NEDGES) = NMIN
304 IEDSET(2,NEDGES) = NMAX
305 NREF(N1) = NREF(N1) + 1
306 NREF(N2) = NREF(N2) + 1
307 LREF(N1) = NEDGES
308 LREF(N2) = NEDGES
309 if (mref(n1) .eq. 0) mref(n1) = nedges
310 if (mref(n2) .eq. 0) mref(n2) = nedges
311 END IF
312 290 CONTINUE
313 END IF
314 300 CONTINUE
315 END IF
316 310 CONTINUE
317
318 if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1))
319 & write (*, '(1x,a,i5)') 'shell visible edge set =',
320 & nedges - newedg + 1
321 if ((cdebug .eq. 'HIDDEN') .and. (idebug .ge. 1))
322 & write (*, '(1x,a,i5)') '***removed =', nmov
323 320 CONTINUE
324
325 C --Make sure hidden node is in IEDSET(2,x)
326
327 DO 330 IEDG = 1, NEDGES
328 IF (HIDENP(IEDSET(1,IEDG)) .GT. KNVIS) THEN
329 I = IEDSET(1,IEDG)
330 IEDSET(1,IEDG) = IEDSET(2,IEDG)
331 IEDSET(2,IEDG) = I
332 END IF
333 330 CONTINUE
334
335 RETURN
336 END