interpol.h 18.5 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
//
// ------------------------------------------------------------

#ifndef INTERPOL_H
#define INTERPOL_H

/////////////////////////////////////////////////////////////
// 1. Interpolate from  blockgrid to rectangular blockgrid
// 2. Interpolate from  blockgrid  to  blockgrid
31
32
// 3. Interpolate from Variable on a blockgrid to any point using structured intermediate grid
// 4. Interpolate from blockgrid direct to any point
Phillip Lino Rall's avatar
Phillip Lino Rall committed
33
34
35
36
37
38
/////////////////////////////////////////////////////////////

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

Christoph Pflaum's avatar
Christoph Pflaum committed
39
40
41
42
/** \addtogroup InterpolationOperators **/
/* @{ */  
/**
 * Interpolation 3D:
Phillip Lino Rall's avatar
Phillip Lino Rall committed
43
data structure on structured grid
Christoph Pflaum's avatar
Christoph Pflaum committed
44
 \verbatim
Phillip Lino Rall's avatar
Phillip Lino Rall committed
45
46
ny    *  *  *  *  *  *
ny-1  *  +  +  +  +  *
Phillip Lino Rall's avatar
Phillip Lino Rall committed
47
48
49
50
3     *  +  +  +  +  *
2     *  +  +  +  +  *
1     *  +  +  +  +  *
0     *  *  *  *  *  *
Phillip Lino Rall's avatar
Phillip Lino Rall committed
51
      0  1  2  3 nx-1 nx
Christoph Pflaum's avatar
Christoph Pflaum committed
52
  \endverbatim      
Phillip Lino Rall's avatar
Phillip Lino Rall committed
53
 * interpolates data from blockgrid_ to rectangular block [pWSD, pENT]
Christoph Pflaum's avatar
Christoph Pflaum committed
54
**/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
55
56
class Interpolate_on_structured_grid {
 public:
Christoph Pflaum's avatar
Christoph Pflaum 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
Christoph Pflaum's avatar
Christoph Pflaum 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();
Christoph Pflaum's avatar
Christoph Pflaum 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)
Christoph Pflaum's avatar
Christoph Pflaum 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);
79
80
81
82
83
84
85
86
87

    int getNx(){return nx;}
    int getNy(){return ny;}
    int getNz(){return nz;}

    double getHx(){return hx;}
    double getHy(){return hy;}
    double getHz(){return hz;}
public:
Phillip Lino Rall's avatar
Phillip Lino Rall committed
88
89
90
  int nx, ny, nz;
  D3vector pENT,pWSD;
  private:
Phillip Lino Rall's avatar
Phillip Lino Rall committed
91
92
93
94
95
96
  int* ids_hex;
  int *ids_i, *ids_j, *ids_k;
  int *typ_tet;

  D3vector *lambda;

Phillip Lino Rall's avatar
Phillip Lino Rall committed
97
  
Phillip Lino Rall's avatar
Phillip Lino Rall committed
98
99
100
101
102
  double hx, hy, hz;

  Blockgrid*        blockgrid;
  Unstructured_grid*       ug;
};
Christoph Pflaum's avatar
Christoph Pflaum committed
103
/* @} */
104
105


Phillip Lino Rall's avatar
Phillip Lino Rall committed
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
144
145
146
147
148
149
150
151
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) {
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
    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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
	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;
  	  */

186
      if(typ==0) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
187
							   du.WND(),du.WNT(),du.WST(),du.EST());
188
      if(typ==1) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
189
							   du.EST(),du.WND(),du.WST(),du.ESD());
190
      if(typ==2) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
191
							   du.WND(),du.WSD(),du.WST(),du.ESD());
192
193
194
      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
195
							   du.ENT(),du.WNT(),du.EST(),du.END());
196
      if(typ==5) data[ind_global] = interpolate_in_tet(lambda[ind_global],
Phillip Lino Rall's avatar
Phillip Lino Rall committed
197
198
199
200
201
202
203
204
205
							   du.WNT(),du.WND(),du.EST(),du.END());
	}
      }
}

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

Christoph Pflaum's avatar
Christoph Pflaum committed
206
207
208
/** \addtogroup InterpolationOperators **/
/* @{ */  
/**
Phillip Lino Rall's avatar
Phillip Lino Rall committed
209
 * interpolates data from blockgrid_from to blockgrid_to_ using an internal rectangular grid if size nx,ny,nz
Christoph Pflaum's avatar
Christoph Pflaum 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
236
237
238
class PointInterpolator;

class Interpolate_on_block_grid_from_pointinterpolator {
public:
/**
* If a pointinterpolator is accesible, it can be used directly to interpolate on blockgrid_to
@param  blockgrid_ of unstructured grid
**/

 Interpolate_on_block_grid_from_pointinterpolator(PointInterpolator *interp, Blockgrid* blockgrid_to_ );
 ~Interpolate_on_block_grid_from_pointinterpolator();
 void interpolate(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;
 PointInterpolator *pointInterpolator;
 double* data;
 Blockgrid* blockgrid_to;

 D3vector pWSD;
 D3vector pENT;

};

Phillip Lino Rall's avatar
Phillip Lino Rall committed
239
240
class Interpolate_on_block_grid {
 public:
Christoph Pflaum's avatar
Christoph Pflaum committed
241
/**
Phillip Lino Rall's avatar
Phillip Lino Rall committed
242
243
244
245
246
 * 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
Christoph Pflaum's avatar
Christoph Pflaum committed
247
**/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
248
  Interpolate_on_block_grid(int nx_, int ny_, int nz_,
249
250
                    Blockgrid* blockgrid_from, Blockgrid* blockgrid_to_);
  Interpolate_on_block_grid(PointInterpolator *interp, Blockgrid* blockgrid_to_ );
Phillip Lino Rall's avatar
Phillip Lino Rall committed
251
252
253
254
255
256
257
  ~Interpolate_on_block_grid();
  
  /**
   * interpoliert Daten. Falls an einem Punkt nicht interpoliert werden kann
   * da U_from keine Zelle hat, dann wird
   *     defaultInterpolation
   * verwendet.
Christoph Pflaum's avatar
Christoph Pflaum committed
258
   **/ 
Phillip Lino Rall's avatar
Phillip Lino Rall committed
259
  void interpolate(Variable<double>* U_from, Variable<double>* U_to, double defaultInterpolation = 0.0);
260

Phillip Lino Rall's avatar
Phillip Lino Rall committed
261
  double evaluate(double coord_x, double coord_y, double coord_z);
262
263


Phillip Lino Rall's avatar
Phillip Lino Rall committed
264
265
266
267
private:
  int nx, ny, nz;
  double hx, hy, hz;
  Interpolate_on_structured_grid* interpolatorStructured;
268
  PointInterpolator *pointInterpolator;
Phillip Lino Rall's avatar
Phillip Lino Rall committed
269
270
271
272
273
274
275
  double* data;
  Blockgrid* blockgrid_to;
  
  D3vector pWSD;
  D3vector pENT;
  
};
Christoph Pflaum's avatar
Christoph Pflaum committed
276
/* @} */
Phillip Lino Rall's avatar
Phillip Lino Rall committed
277

Phillip Lino Rall's avatar
Phillip Lino Rall committed
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294

/////////////////////////////////////////////////////////////
// 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;
};
Christoph Pflaum's avatar
Christoph Pflaum committed
295
*/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
296

Christoph Pflaum's avatar
Christoph Pflaum committed
297
298
299
/** \addtogroup InterpolationOperators **/
/* @{ */  
/**
Phillip Lino Rall's avatar
Phillip Lino Rall committed
300
301
302
303
304
 * 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:
Christoph Pflaum's avatar
Christoph Pflaum committed
305
/**
Phillip Lino Rall's avatar
Phillip Lino Rall committed
306
307
308
309
310
 * 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
Christoph Pflaum's avatar
Christoph Pflaum committed
311
**/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
312
313
314
315
316
317
318
319
320
321
  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);  
  
322
  PointInterpolator(Interpolate_on_structured_grid* intermediateGrid, double defaultInterpolation_ = -1.0);
Phillip Lino Rall's avatar
Phillip Lino Rall committed
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342



  /**
   * 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
Christoph Pflaum's avatar
Christoph Pflaum committed
343
   **/
Phillip Lino Rall's avatar
Phillip Lino Rall committed
344
345
346
347
  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();
		 
348
  void normToNumberOfWritings();
Phillip Lino Rall's avatar
Phillip Lino Rall committed
349
350
351
352
353
354
  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);
355
356
357

  double shiftx, shifty, shiftz;
  double rotationx, rotationy, rotationz;
Phillip Lino Rall's avatar
Phillip Lino Rall committed
358
359
360
361
362
private:
  int nx, ny, nz;
  double hx, hy, hz;
  Interpolate_on_structured_grid* interpolatorStructured;
  double* data;
363
  int* dataCounter;
Phillip Lino Rall's avatar
Phillip Lino Rall committed
364
365
366
367
368
369
370
  
  D3vector pWSD;
  D3vector pENT;
  
  double defaultInterpolation;
  
};
Christoph Pflaum's avatar
Christoph Pflaum committed
371
/* @} */
372

373
374
375
376
377
378
379
380
381
382
383

/////////////////////////////////////////////////////////////
// 4. Interpolate from blockgrid direct to any point
/////////////////////////////////////////////////////////////


/** \addtogroup InterpolationOperators **/
/* @{ */
/**
 * Interpolate from blockgrid direct to any point
***/
384
385
class Interpolate_direct {
 public:
386
    Interpolate_direct (Blockgrid* bg):blockgrid(bg){}
387

388
389
390
391
    /**
     * preparation for interpolation : calculates the neighbour index for each cell.
     * also  calculates the neighbour cell, if in other blockgrid.
    **/
392
    void init();
393
    void updateBoundaryBoxes();
394

395
396
397
398
399
400
    /**
     * Iterates throuh all cells : if D3vector v is inside of a cell, the weighting of the 8 cell points are calculated (D3vector lambda).
     * Uses previously cell indexes and its neighbours, since it's assumed that two consecutive find_cell(v) calls are close to each other.
     * Saves : idNow, idPrev, ifPrevPrev, idPrevPrevPrev
     *
    **/
401
    void find_cell(D3vector v);
402
403
404
    /**
     * Print a vtk file with a box, surrounding the cell.
    **/
405
    void writeBox(D3vector vWSD, D3vector vENT, std::string str);
406
407
408
    /**
     * Print a vtk file with a point.
    **/
409
    static void writePoint(D3vector v, std::string str, int Counter);
410
411
412
    /**
     * Writes interpolation efficiency: how many direct hits, second try, iterate through all, ect...
    **/
413
   void writeInterpolationEfficiency();
414
415
416
417
   //   void interpolate(Variable<DTyp>& u, DTyp* data, DTyp defaultInterpolation);
    template <class DTyp>
    DTyp evaluate(Variable<DTyp>& u);

418
    std::vector<std::vector<std::vector<int> > > getBoundaryBox(){return array_box_boundary;}
419
420
421
422
    std::vector<std::vector<std::vector<D3vector> > > * getArrayBox() {return &arrayBoxWSDENT;}
    void setArrayBox(std::vector<std::vector<std::vector<D3vector> > > arrayBoxWSDENT_){arrayBoxWSDENT = arrayBoxWSDENT_;}


423

424
425
426
427
    int counterFast{}, counterFastest{}, counterSamePoint{}, counterSecondTry{}, counterThirdTry{}, counterSlow{}, counterHexa{}, counterCorner{}, counterEdge{};
    int checkCounter{};
    int boxCounter{};
    int typCounter0{},typCounter1{},typCounter2{},typCounter3{},typCounter4{},typCounter5{};
428
    bool debugTest;
429
430
    bool badLambdaFound;
    bool trilinearInterpolationFlag{false};
431
    D3vector lambda;
432
    D3vector vNow{1e10,1e10,1e10}, vPrev, vPrevPrev, vPrevPrevPrev;
433
434


435
    D3vector trilinarInterpolation(D3vector v, int id_Hex,int i,  int j,  int k );
436
437
        bool vectorInBox(D3vector vWSD, D3vector vENT, D3vector v, double eps = 1e-10);
        int checkBox(int idHex, int i, int j, int k, D3vector v);
438
    private:
439
440
441
442
      int idHexPrev{-1}, iPrev{-1}, jPrev{-1}, kPrev{-1};
      int idHexPrevPrevPrev{-1}, iPrevPrevPrev{-1}, jPrevPrevPrev{-1}, kPrevPrevPrev{-1};
      int idHexPrevPrev{-1}, iPrevPrev{-1}, jPrevPrev{-1}, kPrevPrev{-1};
      int idHexNow{-1}, iNow{-1}, jNow{-1}, kNow{-1};
443

444
445
      double lamLowerLimit{-0.1};
      double lamUpperLimit{1.1};
446
447
      int typ_tet;

448
449
      D3vector cWSD, cESD;
      D3vector cWND, cEND;
450

451
452
      D3vector cWST, cEST;
      D3vector cWNT, cENT;
453
454
455
456
      Blockgrid    *blockgrid;
      std::vector<std::vector<std::vector<D3vector> > > arrayBoxWSDENT;

      std::vector<std::vector<std::vector<int> > > array_box_boundary;
457
      std::vector<std::vector<std::vector<int> > > array_point_boundary;
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
private:
      /**
       * Necessary to calculate the neighbour relation.
      **/
      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);

      /**
       * Necessary to evaluate the neighbour cell relation.
      **/
      void setPrevIndex();
      void setPrevPrevIndex();
      void setPrevPrevPrevIndex();
      int checkForHexaNeighbours(int idHex, int i, int j, int k, D3vector v);
      int checkBoxSurrounding(int idHex, int i, int j, int k, D3vector v);
481
      int checkBoxSurroundingOptimized(int idHex, int i, int j, int k, D3vector v, bool neglectBadLambda = false);
482
483
484
485
      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);
      double calculateOverlapOfBoxes(D3vector vWSD, D3vector vENT, D3vector wWSD, D3vector wENT);
486
487


488
489
490
491
492


};

/* @} */
493
494
495
496
497
498
499
500
template<class DTyp>
DTyp Interpolate_direct::evaluate(Variable<DTyp> &u)
{
 int i,j,k, id_hex, typ;
 int ind_global;

 DTyp returnVal;

501
502
// for(int id=0;id<5;++id)
//   u.template Update<hexahedronEl>(id);
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528


   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());
529
530
     if(typ==6) returnVal = interpolate_in_tet_trilinear(lambda,du.END(),du.ESD(),du.WSD(),du.WND(),
                                                           du.WNT(),du.WST(),du.EST(),du.ENT());
531
   }
532
533
534
535
536
537
538
539
   //    D3vector cWSD = {1,1,0};      // 1,1,0 : x2
   //    D3vector cESD = {2,0,-1};     // 1,0,0 : x1
   //    D3vector cWND = {0,1,0};      // 0,1,0 : x3
   //    D3vector cEND = {-1,0,-1.0};  // 0,0,0 : x0
   //    D3vector cWST = {1,1,1};      // 1,1,1 : x5
   //    D3vector cEST = {2,0,2};      // 1,0,1 : x6
   //    D3vector cWNT = {0,1,1};      // 0,1,1 : x4
   //    D3vector cENT = {-1,0,2};     // 0,0,1 : x7
540
541
542
543
    return returnVal;
};


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