interpol.h 14.9 KB
Newer Older
Phillip Lino Rall's avatar
Phillip Lino Rall committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**********************************************************************************
 * Copyright 2010 Christoph Pflaum 
 * 		Department Informatik Lehrstuhl 10 - Systemsimulation
 *		Friedrich-Alexander Universität Erlangen-Nürnberg
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 **********************************************************************************/

// ------------------------------------------------------------
//
Phillip Lino Rall's avatar
Phillip Lino Rall committed
21
// variable.h
Phillip Lino Rall's avatar
Phillip Lino Rall committed
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
//
// ------------------------------------------------------------

#ifndef INTERPOL_H
#define INTERPOL_H

/////////////////////////////////////////////////////////////
// 1. Interpolate from  blockgrid to rectangular blockgrid
// 2. Interpolate from  blockgrid  to  blockgrid
/////////////////////////////////////////////////////////////


/////////////////////////////////////////////////////////////
// 1. Interpolate from  blockgrid to rectangular blockgrid
/////////////////////////////////////////////////////////////


/*
data structure on structured grid
Phillip Lino Rall's avatar
Phillip Lino Rall committed
41
42
ny    *  *  *  *  *  *
ny-1  *  +  +  +  +  *
Phillip Lino Rall's avatar
Phillip Lino Rall committed
43
44
45
46
3     *  +  +  +  +  *
2     *  +  +  +  +  *
1     *  +  +  +  +  *
0     *  *  *  *  *  *
Phillip Lino Rall's avatar
Phillip Lino Rall committed
47
      0  1  2  3 nx-1 nx
Phillip Lino Rall's avatar
Phillip Lino Rall committed
48
49
50
51
*/



Phillip Lino Rall's avatar
Phillip Lino Rall committed
52
/***
Phillip Lino Rall's avatar
Phillip Lino Rall committed
53
 * interpolates data from blockgrid_ to rectangular block [pWSD, pENT]
Phillip Lino Rall's avatar
Phillip Lino Rall committed
54
***/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
55
56
class Interpolate_on_structured_grid {
 public:
Phillip Lino Rall's avatar
Phillip Lino Rall committed
57
/***
Phillip Lino Rall's avatar
Phillip Lino Rall committed
58
59
60
61
62
63
64
 * preparation for interpolation
 @param  nx_ number of structured grid points x-direction
 @param  ny_ number of structured grid points y-direction
 @param  nz_ number of structured grid points z-direction
 @param  pWSD Corner WSD of structured grid
 @param  pENT Corner WSD of structured grid
 @param  blockgrid_ of unstructured grid
Phillip Lino Rall's avatar
Phillip Lino Rall committed
65
***/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
66
67
68
  Interpolate_on_structured_grid(int nx_, int ny_, int nz_,
				 D3vector pWSD, D3vector pENT,
				 Blockgrid& blockgrid_);
Phillip Lino Rall's avatar
Phillip Lino Rall committed
69
70
  Interpolate_on_structured_grid(int nx_, int ny_, int nz_,
				 Blockgrid& blockgrid_);
71
  ~Interpolate_on_structured_grid();
Phillip Lino Rall's avatar
Phillip Lino Rall committed
72
/***
Phillip Lino Rall's avatar
Phillip Lino Rall committed
73
74
75
 * interpolates from Variable u(of unstructured blockgrid) to structured data
 @param  u:  Variable on unstructured blockgrid
 @param  data: pointer to structured grid data i+nx*(j+ny*k)
Phillip Lino Rall's avatar
Phillip Lino Rall committed
76
***/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
77
78
  template <class DTyp>
    void interpolate(Variable<DTyp>& u, DTyp* data, DTyp defaultInterpolation);
Phillip Lino Rall's avatar
Phillip Lino Rall committed
79
80
81
82
  public:
  int nx, ny, nz;
  D3vector pENT,pWSD;
  private:
Phillip Lino Rall's avatar
Phillip Lino Rall committed
83
84
85
86
87
88
  int* ids_hex;
  int *ids_i, *ids_j, *ids_k;
  int *typ_tet;

  D3vector *lambda;

Phillip Lino Rall's avatar
Phillip Lino Rall committed
89
  
Phillip Lino Rall's avatar
Phillip Lino Rall committed
90
91
92
93
94
95
  double hx, hy, hz;

  Blockgrid*        blockgrid;
  Unstructured_grid*       ug;
};

96
97


Phillip Lino Rall's avatar
Phillip Lino Rall committed
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
template <class DTyp>
class Give_corner_data_of_cube {
 public:
  Give_corner_data_of_cube(Variable<DTyp>& u_, int hex_, int i_, int j_, int k_);
  
  DTyp WSD() { return u->template Give_data<hexahedronEl>(id, i,   j,   k,   Nx, Ny); }
  DTyp ESD() { return u->template Give_data<hexahedronEl>(id, i+1, j,   k,   Nx, Ny); }
  DTyp WND() { return u->template Give_data<hexahedronEl>(id, i,   j+1, k,   Nx, Ny); }
  DTyp END() { return u->template Give_data<hexahedronEl>(id, i+1, j+1, k,   Nx, Ny); }
  DTyp WST() { return u->template Give_data<hexahedronEl>(id, i,   j,   k+1, Nx, Ny); }
  DTyp EST() { return u->template Give_data<hexahedronEl>(id, i+1, j,   k+1, Nx, Ny); }
  DTyp WNT() { return u->template Give_data<hexahedronEl>(id, i,   j+1, k+1, Nx, Ny); }
  DTyp ENT() { return u->template Give_data<hexahedronEl>(id, i+1, j+1, k+1, Nx, Ny); }

 private:
  int id, i, j, k;
  int Nx, Ny;
  Variable<DTyp>* u;
};

template <class DTyp>
Give_corner_data_of_cube<DTyp>::Give_corner_data_of_cube(Variable<DTyp>& u_,
							 int hex_, int i_, int j_, int k_) {
  Blockgrid*        blockgrid;

  u = &u_;
  blockgrid = u->Give_blockgrid();
  id = hex_; i = i_;  j = j_;  k = k_;
  
  Nx = blockgrid->Give_Nx_hexahedron(id);
  Ny = blockgrid->Give_Ny_hexahedron(id);
}


template <class DTyp>
void Interpolate_on_structured_grid::interpolate(Variable<DTyp>& u, DTyp* data, DTyp defaultInterpolation) {
  int i,j,k, id_hex, typ;
  int ind_global;


  for(int id=0;id<ug->Give_number_hexahedra();++id)
    u.template Update<hexahedronEl>(id);

  for(int ks = 0; ks < nz;++ks)
    for(int js = 0; js < ny;++js)
      for(int is = 0; is < nx;++is) {
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
    ind_global = is+nx*(js+ny*ks);
    i = ids_i[ind_global];
    j = ids_j[ind_global];
    k = ids_k[ind_global];
    id_hex = ids_hex[ind_global];

    /*
    // test : das geht nicht::
    if(id_hex < 0) {
      ind_global = is+nx*((ny-1-js)+ny*ks);
      i = ids_i[ind_global];
      j = ids_j[ind_global];
      k = ids_k[ind_global];
      id_hex = ids_hex[ind_global];
    }
*/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
	if(id_hex < 0) data[ind_global] = defaultInterpolation;
	else {
	  Give_corner_data_of_cube<DTyp> du(u, id_hex, i,j,k);

	  typ = typ_tet[ind_global];

	
	  /*
	  if( ind_global == 3)
	    cout << " \n ind_global: " << is + nx * (js + ny * ks)
	         << " typ: " << typ
	         << " id_hex " << id_hex
	         << " i: " << i
	         << " j: " << j
	         << " k: " << k
	         << endl;
  	  */

178
      if(typ==0) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
179
							   du.WND(),du.WNT(),du.WST(),du.EST());
180
      if(typ==1) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
181
							   du.EST(),du.WND(),du.WST(),du.ESD());
182
      if(typ==2) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
183
							   du.WND(),du.WSD(),du.WST(),du.ESD());
184
185
186
      if(typ==3) data[ind_global] = interpolate_in_tet(lambda[ind_global],
                               du.EST(),du.WND(),du.ESD(),du.END());
      if(typ==4) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
187
							   du.ENT(),du.WNT(),du.EST(),du.END());
188
      if(typ==5) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
189
190
191
192
193
194
195
196
197
							   du.WNT(),du.WND(),du.EST(),du.END());
	}
      }
}

/////////////////////////////////////////////////////////////
// 2. Interpolate from  blockgrid  to  blockgrid
/////////////////////////////////////////////////////////////

Phillip Lino Rall's avatar
Phillip Lino Rall committed
198
199
200
/***
 * interpolates data from blockgrid_from to blockgrid_to_ using an internal rectangular grid if size nx,ny,nz
***/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
201
202
class Interpolate_on_block_grid {
 public:
Phillip Lino Rall's avatar
Phillip Lino Rall committed
203
/***
Phillip Lino Rall's avatar
Phillip Lino Rall committed
204
205
206
207
208
 * preparation for interpolation
 @param  nx_ number of structured grid points x-direction
 @param  ny_ number of structured grid points y-direction
 @param  nz_ number of structured grid points z-direction
 @param  blockgrid_ of unstructured grid
Phillip Lino Rall's avatar
Phillip Lino Rall committed
209
***/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
  Interpolate_on_block_grid(int nx_, int ny_, int nz_,
		            Blockgrid* blockgrid_from, Blockgrid* blockgrid_to_);
  ~Interpolate_on_block_grid();
  
  /**
   * interpoliert Daten. Falls an einem Punkt nicht interpoliert werden kann
   * da U_from keine Zelle hat, dann wird
   *     defaultInterpolation
   * verwendet.
   ***/ 
  void interpolate(Variable<double>* U_from, Variable<double>* U_to, double defaultInterpolation = 0.0);
    		
  double evaluate(double coord_x, double coord_y, double coord_z);
		  
private:
  int nx, ny, nz;
  double hx, hy, hz;
  Interpolate_on_structured_grid* interpolatorStructured;
  double* data;
  Blockgrid* blockgrid_to;
  
  D3vector pWSD;
  D3vector pENT;
  
};

Phillip Lino Rall's avatar
Phillip Lino Rall committed
236

Phillip Lino Rall's avatar
Phillip Lino Rall committed
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324

/////////////////////////////////////////////////////////////
// 3. Interpolate from Variable on a blockgrid to any point using structured intermediate grid  
/////////////////////////////////////////////////////////////

/*
class Intermadiate_grid_for_PointInterpolator : public Interpolate_on_structured_grid
{
public:
  Intermadiate_grid_for_PointInterpolator(int nx_, int ny_, int nz_, Variable<double>* U_from);
  int nx, ny, nz;
  Interpolate_on_structured_grid* interpolatorStructured(int nx_, int ny_, int nz_,D3vector pWSD, D3vector pENT,
		                                          Variable<double>* U_from);  
  
  D3vector pWSD;
  D3vector pENT;
};

 * interpolates data from blockgrid_from to blockgrid_to_ using an internal rectangular grid if size nx,ny,nz
***/
class PointInterpolator {
  friend Interpolate_on_structured_grid;
 public:
/***
 * preparation for interpolation
 @param  nx_ number of structured grid points x-direction
 @param  ny_ number of structured grid points y-direction
 @param  nz_ number of structured grid points z-direction
 @param  blockgrid_ of unstructured grid
***/
  PointInterpolator(int nx_, int ny_, int nz_,
		    Variable<double>* U_from, double defaultInterpolation_ = 0.0);
  
  PointInterpolator(int nx_, int ny_, int nz_,
	            D3vector pWSD, D3vector pENT,
		    Variable<double>* U_from, double defaultInterpolation_ = 0.0);  
  
  PointInterpolator(Interpolate_on_structured_grid* intermediateGrid,
		    Variable<double>* U_from, double defaultInterpolation_ = 0.0);  
  




  /**
   * Calculates an intermediate Grid for above constructor
   */
  Interpolate_on_structured_grid* intermediateGrid;  

  
  ~PointInterpolator();
  
  
  
  /**
   * interpoliert Daten. Falls an einem Punkt nicht interpoliert werden kann
   * da U_from keine Zelle hat, dann wird
   *     defaultInterpolation
   * verwendet.
   * @param coord_x, coord_y, coord_z, Koordinaten des Punktes
   * @return interpolierter Wert
   ***/
  double evaluate(double coord_x, double coord_y, double coord_z);
  std::vector<double> evaluateGradient(double coord_x, double coord_y, double coord_z);
  void smoothGrid();
		 

  void writeOnInterpolatedGrid(double coord_x, double coord_y, double coord_z, double value);
  void subtractOnInterpolatedGrid(double coord_x, double coord_y, double coord_z, double value);
  void shiftInterpolatedGrid(double coord_x, double coord_y, double coord_z);
  void scaleInterpolatedData(double scale, double zeroVal = 0.0);

  void QPrint_VTK(QString DateiName);
  
private:
  int nx, ny, nz;
  double hx, hy, hz;
  double shiftx, shifty, shiftz;
  Interpolate_on_structured_grid* interpolatorStructured;
  double* data;
  
  D3vector pWSD;
  D3vector pENT;
  
  double defaultInterpolation;
  
};

325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344

//template <class DTyp>
class Interpolate_direct {
 public:

    Interpolate_direct (Blockgrid* bg):blockgrid(bg)
      ,idHexPrev(-1)
      ,iPrev(-1)
      ,jPrev(-1)
      ,kPrev(-1)
      ,idHexPrevPrev(-1)
      ,iPrevPrev(-1)
      ,jPrevPrev(-1)
      ,kPrevPrev(-1)
      ,idHexPrevPrevPrev(-1)
      ,iPrevPrevPrev(-1)
      ,jPrevPrevPrev(-1)
      ,kPrevPrevPrev(-1)
      ,counterFast(0)
      ,counterFastest(0)
345
      ,counterSamePoint(0)
346
      ,counterSecondTry(0)
347
      ,counterThirdTry(0)
348
349
350
351
352
353
354
355
356
357
358
359
360
      ,counterSlow(0)
      ,counterHexa(0)
      ,checkCounter(0)
      ,counterEdge(0)
      ,counterCorner(0)
      ,typCounter0(0)
      ,typCounter1(0)
      ,typCounter2(0)
      ,typCounter3(0)
      ,typCounter4(0)
      ,typCounter5(0){}

    void init();
361
362
363
364
365
366
367
368
369
370
371
372
373
374
    std::vector<std::vector<int> > calculateNeighbourIndexRelation(std::vector<std::vector<int> > inner, std::vector<std::vector<int> > outer);
    std::vector<int> calculateNeighbourIndex(std::vector<std::vector<int> > relation, int id_hex_outside,int id_hex_inside, int i, int j, int k, int Nx, int Ny, int Nz);
    std::vector<std::vector<int> > filterCorrectNeighbours(std::vector<std::vector<int> > outer);
    bool compareIndicies(std::vector<std::vector<int> > inner, std::vector<std::vector<int> > outer, int notCheck);


    std::vector<std::vector<int> > switchIJ(std::vector<std::vector<int> > v);
    std::vector<std::vector<int> > switchIK(std::vector<std::vector<int> > v);
    std::vector<std::vector<int> > switchJK(std::vector<std::vector<int> > v);
    std::vector<std::vector<int> > invertI (std::vector<std::vector<int> > v);
    std::vector<std::vector<int> > invertJ (std::vector<std::vector<int> > v);
    std::vector<std::vector<int> > invertK (std::vector<std::vector<int> > v);


375
376
377
378
379
380
381
382
383
384
385

    void find_cell(D3vector v);
    void setPrevIndex();
    void setPrevPrevIndex();
    void setPrevPrevPrevIndex();
    int checkBox(int idHex, int i, int j, int k, D3vector v);
    int checkBoxSurrounding(int idHex, int i, int j, int k, D3vector v);
    int checkBoxSurroundingOptimized(int idHex, int i, int j, int k, D3vector v);
    int checkCorner(int idHex, int i, int j, int k, D3vector v);
    int checkEdge(int idHex, int i, int j, int k, D3vector v);
    bool checkOverlapOfBoxes(D3vector vWSD, D3vector vENT, D3vector wWSD, D3vector wENT);
386
    double calculateOverlapOfBoxes(D3vector vWSD, D3vector vENT, D3vector wWSD, D3vector wENT);
387
    void writeBox(D3vector vWSD, D3vector vENT, std::string str);
388
389
390
    static void writePoint(D3vector v, std::string str, int Counter);
   void writeInterpolationEfficiency();
    int checkForHexaNeighbours(int idHex, int i, int j, int k, D3vector v);
391
392
393
394
   //   void interpolate(Variable<DTyp>& u, DTyp* data, DTyp defaultInterpolation);
    template <class DTyp>
    DTyp evaluate(Variable<DTyp>& u);

395
    int counterFast, counterFastest, counterSamePoint, counterSecondTry, counterThirdTry, counterSlow, counterHexa, counterCorner, counterEdge;
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
    int checkCounter;
    int boxCounter = 0;
    int typCounter0,typCounter1,typCounter2,typCounter3,typCounter4,typCounter5;
    bool debugTest;
    D3vector lambda;
    D3vector vNow, vPrev, vPrevPrev, vPrevPrevPrev;
    private:
      int idHexPrevPrevPrev, iPrevPrevPrev, jPrevPrevPrev, kPrevPrevPrev;
      int idHexPrevPrev, iPrevPrev, jPrevPrev, kPrevPrev;
      int idHexPrev, iPrev, jPrev, kPrev;
      int idHexNow, iNow, jNow, kNow;

      int typ_tet;


      Blockgrid    *blockgrid;
      std::vector<std::vector<std::vector<D3vector> > > arrayBoxWSDENT;

      std::vector<std::vector<std::vector<int> > > array_box_boundary;
    //  template <class DTyp>
    //  Variable<DTyp>* u;
};


template<class DTyp>
DTyp Interpolate_direct::evaluate(Variable<DTyp> &u)
{
 int i,j,k, id_hex, typ;
 int ind_global;

 DTyp returnVal;

 //for(int id=0;id<ug->Give_number_hexahedra();++id)
  // u.template Update<hexahedronEl>(id);


   if(idHexNow < 0)
   {returnVal = -1;}
   else {
     Give_corner_data_of_cube<DTyp> du(u, idHexNow , iNow,jNow,kNow);

     int typ = typ_tet;

     if (lambda == D3vector(0,0,0))
     {
         cout << "no point found " << endl;
     }
     //cout << "lambda : " ; lambda.Print();cout<<endl;
     if(typ==0) returnVal = interpolate_in_tet(lambda,
                              du.WND(),du.WNT(),du.WST(),du.EST());
     if(typ==1) returnVal = interpolate_in_tet(lambda,
                              du.EST(),du.WND(),du.WST(),du.ESD());
     if(typ==2) returnVal = interpolate_in_tet(lambda,
                              du.WND(),du.WSD(),du.WST(),du.ESD());
     if(typ==3) returnVal = interpolate_in_tet(lambda,
                              du.EST(),du.WND(),du.ESD(),du.END());
     if(typ==4) returnVal = interpolate_in_tet(lambda,
                              du.ENT(),du.WNT(),du.EST(),du.END());
     if(typ==5) returnVal = interpolate_in_tet(lambda,
                              du.WNT(),du.WND(),du.EST(),du.END());
   }
    return returnVal;
};


Phillip Lino Rall's avatar
Phillip Lino Rall committed
461
#endif // INTERPOL_H