Debian Codegraph @

packages/seacas/applications/mapvar-kd/srcht-kd.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 SRCHT (
8 * NPSRF, NFSRF, LINKSRF, XYZSRF,
9 * NPTS, XYZPTS, TOLSRCH,
10 * NISR, NRSR, NISS, NRSS, ISRCHR, RSRCHR,
11 * LIST, IERR)
12
13 C-----------------------------------------------------------------------
14
15 C DESCRIPTION:
16
17 C THIS SUBROUTINE CALCULATES THE CLOSEST POINT PROBLEM
18 C BETWEEN NPTS POINTS AND NFSRF SURFACES AND RETURNS RESULTS OF
19 C SEARCH IN ISRCHR,RSRCHR
20
21 C USED HERE FOR FINDING LOCATION OF EITHER NODE OR ELEMENT CENTROID
22 C FROM MESH-B IN TET-8 ELEMENT OF MESH-A
23
24 C-----------------------------------------------------------------------
25
26 C FORMAL PARAMETERS
27
28 C MEMORY : P=PERMANENT, S=SCRATCH
29 C NAME : IMPLICIT A-H,O-Z REAL, I-N INTEGER
30 C TYPE : INPUT_STATUS/OUTPUT_STATUS (I=INPUT,O=OUTPUT,P=PASSED,
31 C U=UNMODIFIED,-=UNDEFINED)
32 C DESCRIPTION : DESCRIPTION OF VARIABLE
33
34 C-----------------------------------------------------------------------
35
36 C CALLING ARGUMENTS:
37
38 C MEMORY NAME TYPE DESCRIPTION
39 C --- ---- --- -----------
40 C P NPSRF I/U NUMBER OF POINTS THAT DEFINE THE SURFACE
41 C P NFSRF I/U NUMBER OF SURFACES
42 C P LINKSRF I/U CONNECTIVITY OF SURFACES OF SIZE (8*NFSRF),
43 C NUMBERS REFER TO LOCATIONS IN XYZSRF ARRAY
44 C P XYZSRF I/U XYZ COORDS OF POINTS DEFINING SURFACE
45 C P NPTS I/U NUMBER OF POINTS TO BE SEARCHED
46 C P XYZPTS I/U XYZ COORDS OF POINTS TO BE SEARCHED
47 C P TOLSRCH I/U PROXIMITY TOLERANCE FOR POINT-TO-SURFACE SEARCH
48 C P NISR I/U NUMBER OF INTEGER SEARCH RESULTS (>=1)
49 C P NRSR I/U NUMBER OF REAL SEARCH RESULTS (>=4)
50 C P NISS I/U NUMBER OF INTEGER SEARCH SCRATCH (=5)
51 C P NRSS I/U NUMBER OF REAL SEARCH SCRATCH (=10)
52 C P ISRCHR -/O INTEGER SEARCH RESULTS
53 C P RSRCHR -/O REAL SEARCH RESULTS
54 C S LIST -/- LIST OF POTENTIAL CONTACTS FOR A SURFACE
55 C P IERR -/O ERROR FLAG
56
57 C-----------------------------------------------------------------------
58
59 include 'tapes.blk'
60 include 'debg.blk'
61
62 C INPUT/OUTPUT ARRAYS
63
64 C ... Needed to interact with C routines on 64-bit systems which have
65 C 8-byte integers in Fortran and 4-byte integers in C.
66 INTEGER*4 NPTS4, NDIM4, NLIST, LIST(*)
67
68 DIMENSION
69 * LINKSRF(4,NFSRF), XYZSRF(NPSRF,3),
70 * XYZPTS(NPTS,3),
71 * ISRCHR(NISR,NPTS), RSRCHR(NRSR,NPTS)
72 DIMENSION
73 * XMIN(3), XMAX(3), GXMIN(3), GXMAX(3)
74
75 C ISRCHR and RSRCHR must be initialized to zero
76
77 DO 1 I = 1, NPTS
78 DO 2 J = 1, NISR
79 ISRCHR(J,I) = 0
80 2 CONTINUE
81 DO 3 K = 1, NRSR
82 RSRCHR(K,I) = 0.
83 3 CONTINUE
84 1 CONTINUE
85
86 IF( NISR .LT. 1 .OR. NRSR .LT. 3 .OR. NISS .LT. 5 .OR.
87 * NRSS .LT. 10 )THEN
88 IERR = 1
89 RETURN
90 ENDIF
91 C DIMENSION OF COORDINATES
92 NDIM = 3
93 NDIM4 = 3
94 NPTS4 = NPTS
95
96 c ... Calculate min/max extents of all points...
97 GXMIN(1) = XYZPTS(1,1)
98 GXMAX(1) = XYZPTS(1,1)
99 GXMIN(2) = XYZPTS(1,2)
100 GXMAX(2) = XYZPTS(1,2)
101 GXMIN(3) = XYZPTS(1,3)
102 GXMAX(3) = XYZPTS(1,3)
103 DO 10 I=2,NPTS
104 GXMIN(1) = MIN(GXMIN(1), XYZPTS(I,1))
105 GXMIN(2) = MIN(GXMIN(2), XYZPTS(I,2))
106 GXMIN(3) = MIN(GXMIN(3), XYZPTS(I,3))
107
108 GXMAX(1) = MAX(GXMAX(1), XYZPTS(I,1))
109 GXMAX(2) = MAX(GXMAX(2), XYZPTS(I,2))
110 GXMAX(3) = MAX(GXMAX(3), XYZPTS(I,3))
111 10 CONTINUE
112
113 C Build KD Tree
114 if (idebug .ge. 2) then
115 call excpus(t1)
116 write(nout, *) ' In kdBuildTree ', npts4
117 write(ntpout, *) ' In kdBuildTree', npts4
118 end if
119
120 call kdbuildtree(xyzpts, npts4, ndim4)
121
122 if (idebug .ge. 2) then
123 call excpus(t2)
124 write(nout, *) ' Out of kdBuildTree', t2-t1
125 write(ntpout, *) ' Out of kdBuildTree', t2-t1
126 end if
127
128 C LOOP OVER SURFACES AND SEARCH FOR POINTS WITHIN CAPTURE BOX
129 qt = 0.0
130 j = 0
131 nlistt = 0
132 nlistp = 0
133 nskip = 0
134 call excpus(t3p)
135
136 DO 100 IFSRF = 1, NFSRF
137
138 C CONSTRUCT THE BOUNDING BOX FOR NE SURFACES
139 NI = LINKSRF(1,IFSRF)
140 NJ = LINKSRF(2,IFSRF)
141 NK = LINKSRF(3,IFSRF)
142 NL = LINKSRF(4,IFSRF)
143
144 XMINMS = MIN(XYZSRF(NI,1),XYZSRF(NJ,1),
145 * XYZSRF(NK,1),XYZSRF(NL,1))
146 XMAXMS = MAX(XYZSRF(NI,1),XYZSRF(NJ,1),
147 * XYZSRF(NK,1),XYZSRF(NL,1))
148 YMINMS = MIN(XYZSRF(NI,2),XYZSRF(NJ,2),
149 * XYZSRF(NK,2),XYZSRF(NL,2))
150 YMAXMS = MAX(XYZSRF(NI,2),XYZSRF(NJ,2),
151 * XYZSRF(NK,2),XYZSRF(NL,2))
152 ZMINMS = MIN(XYZSRF(NI,3),XYZSRF(NJ,3),
153 * XYZSRF(NK,3),XYZSRF(NL,3))
154 ZMAXMS = MAX(XYZSRF(NI,3),XYZSRF(NJ,3),
155 * XYZSRF(NK,3),XYZSRF(NL,3))
156
157 TOLER = TOLSRCH * (XMAXMS - XMINMS)
158 XMIN(1) = XMINMS - TOLER
159 XMAX(1) = XMAXMS + TOLER
160 TOLER = TOLSRCH * (YMAXMS - YMINMS)
161 XMIN(2) = YMINMS - TOLER
162 XMAX(2) = YMAXMS + TOLER
163 TOLER = TOLSRCH * (ZMAXMS - ZMINMS)
164 XMIN(3) = ZMINMS - TOLER
165 XMAX(3) = ZMAXMS + TOLER
166
167 C ... Build a list of points in the query region...
168 j = j + 1
169 C ... Skip past points that are outside search domain.
170 C This is much faster than the failed search in kdrectquery, but
171 C does add overhead if all points are in the domain....
172
173 if (xmax(1) .lt. gxmin(1) .or. xmin(1) .gt. gxmax(1) .or.
174 * xmax(2) .lt. gxmin(2) .or. xmin(2) .gt. gxmax(2) .or.
175 * xmax(3) .lt. gxmin(3) .or. xmin(3) .gt. gxmax(3)) then
176 nskip = nskip + 1
177 nlist = 0
178 else
179 call excpus(t4)
180 call kdrectquery(xyzpts,npts4,ndim4, xmin,xmax, list,nlist)
181 call excpus(t5)
182 qt = qt + (t5-t4)
183 end if
184
185 C ... Debugging statistics. Also give user an idea that calculation is progressing...
186 if (idebug .ge. 2) then
187 nlistp = nlistp + nlist
188 nlistt = nlistt + nlist
189 if (j .eq. 100000 .or. ifsrf .eq. nfsrf) then
190 call excpus(t3)
191 write (nout, 190) ifsrf, nfsrf, t3-t3p, t3-t2,
192 * j/(t3-t3p), ifsrf/(t3-t2), nlistp, nlistt
193 write (ntpout, 190) ifsrf, nfsrf, t3-t3p, t3-t2,
194 * j/(t3-t3p), ifsrf/(t3-t2), nlistp, nlistt
195 j = 0
196 t3p = t3
197 nlistp = 0
198 end if
199 end if
200
201 DO 140 K = 1, NLIST
202 lval = list(k)
203 CALL TETSRC(
204 * NDIM, NPTS, NPSRF, NFSRF, NISR,
205 * NRSR, NRSS, XYZSRF, XYZPTS, LINKSRF,
206 * ISRCHR, RSRCHR, LVAL, IFSRF,
207 * IERR )
208 140 CONTINUE
209 100 CONTINUE
210
211 C ... More debugging stats
212 if (idebug .ge. 2) then
213 call excpus(t3)
214 write(nout, *) ' Finish Queries', t3-t2, NFSRF/(t3-t2), qt
215 write(ntpout, *) ' Finish Queries', t3-t2, NFSRF/(t3-t2), qt
216 write(nout, *) ' Matches = ',nlistt,' Rate = ',nlistt/(t3-t2)
217 write(ntpout, *) ' Matches = ',nlistt,' Rate = ',nlistt/(t3-t2)
218 end if
219
220 call kdkilltree()
221
222 190 format(1x,i9,'/',i9,' T= ',1pe10.3,'/',1pe10.3,
223 * ', R= ',1pe10.3,'/',1pe10.3,' M = ',i10,'/',i10)
224 RETURN
225 END