ElInfo2d.cc 17.3 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include "ElInfo2d.h"
#include "BasisFunction.h"
#include "Element.h"
#include "Line.h"
#include "Triangle.h"
#include "Tetrahedron.h"
#include "FiniteElemSpace.h"
#include "Flag.h"
#include "MacroElement.h"
#include "Mesh.h"
#include "Global.h"
#include "FixVec.h"
#include "DOFVector.h"

namespace AMDiS {

17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
  double ElInfo2d::mat_d1_val[3][3] = {{1.0, 0.0, 0.0}, 
				       {0.0, 1.0, 0.0}, 
				       {0.0, 0.0, 1.0}};
  mtl::dense2D<double> ElInfo2d::mat_d1(mat_d1_val);

  double ElInfo2d::mat_d1_left_val[3][3] = {{0.0, 1.0, 0.5}, 
					    {0.0, 0.0, 0.5},
					    {1.0, 0.0, 0.0}};
  mtl::dense2D<double> ElInfo2d::mat_d1_left(mat_d1_left_val);

  double ElInfo2d::mat_d1_right_val[3][3] = {{0.0, 0.0, 0.5}, 
					     {1.0, 0.0, 0.5},
					     {0.0, 1.0, 0.0}};
  mtl::dense2D<double> ElInfo2d::mat_d1_right(mat_d1_right_val);

32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
  ElInfo2d::ElInfo2d(Mesh *aMesh) 
    : ElInfo(aMesh) 
  {
    e1 = NEW WorldVector<double>;
    e2 = NEW WorldVector<double>;
    normal = NEW WorldVector<double>;
  }

  ElInfo2d::~ElInfo2d()
  {
    DELETE e1;
    DELETE e2;
    DELETE normal;
  }

47
48
  void ElInfo2d::fillMacroInfo(const MacroElement * mel)
  {
49
50
    FUNCNAME("ElInfo::fillMacroInfo()");
 
51
    macroElement_ = const_cast<MacroElement*>(mel);
52
53
    element_ = const_cast<Element*>(mel->getElement());
    parent_ = NULL;
54
    level = 0;
55
56
57
58

    if (fillFlag_.isSet(Mesh::FILL_COORDS) || 
	fillFlag_.isSet(Mesh::FILL_DET)    ||
	fillFlag_.isSet(Mesh::FILL_GRD_LAMBDA)) {
59
60

      int vertices = mesh_->getGeo(VERTEX);
61
      for (int i = 0; i < vertices; i++)
62
63
64
65
66
	coord_[i] = mel->coord[i];
    }

    int neighbours = mesh_->getGeo(NEIGH);

67
68
69
70
    if (fillFlag_.isSet(Mesh::FILL_OPP_COORDS) || 
	fillFlag_.isSet(Mesh::FILL_NEIGH)) {

      bool fill_opp_coords = (fillFlag_.isSet(Mesh::FILL_OPP_COORDS));
71
    
72
73
74
75
      for (int i = 0; i < neighbours; i++) {
	MacroElement *macroNeighbour = mel->getNeighbour(i);

	if (macroNeighbour) {
Thomas Witkowski's avatar
Thomas Witkowski committed
76
	  neighbour_[i] = macroNeighbour->getElement();	  
77
78
79
80
81
82
83
84
85
86
87
88
89
	  Element *nb = const_cast<Element*>(neighbour_[i]);

	  int edgeNo = oppVertex_[i] = mel->getOppVertex(i);
	  if (nb->getFirstChild() && (edgeNo != 2)) {   // make nb nearest el.
	    if (edgeNo == 0) {
	      nb = neighbour_[i] = nb->getSecondChild();
	    } else {
	      nb = neighbour_[i] = nb->getFirstChild();
	    }

	    oppVertex_[i] = 2;

	    if (fill_opp_coords) {
90
	      if (nb->isNewCoordSet()) {
91
92
93
94
95
96
97
98
99
100
101
102
103
		oppCoord_[i] = *(nb->getNewCoord());
	      } else {
		oppCoord_[i] = (macroNeighbour->coord[0] + macroNeighbour->coord[1]) * 0.5;
	      }	    	      
	      
	      switch (i) {
	      case 0:
		if (*(macroNeighbour->getElement()->getDOF(2)) == *(element_->getDOF(2))) {
		  neighbourCoord_[i][0] = macroNeighbour->coord[2];
		  neighbourCoord_[i][1] = macroNeighbour->coord[0];
		} else if (*(macroNeighbour->getElement()->getDOF(2)) == *(element_->getDOF(1))) {
		  neighbourCoord_[i][0] = macroNeighbour->coord[1];
		  neighbourCoord_[i][1] = macroNeighbour->coord[2];
104
		} else {
Thomas Witkowski's avatar
Thomas Witkowski committed
105
		  ERROR_EXIT("Should not happen!\n");
106
		}
107
108
109
110
111
112
113
114
115
116
117
118
	
		neighbourCoord_[i][2] = oppCoord_[i];
		break;
		
	      case 1:
		if (*(macroNeighbour->getElement()->getDOF(2)) == *(element_->getDOF(2))) {
		  neighbourCoord_[i][0] = macroNeighbour->coord[1];
		  neighbourCoord_[i][1] = macroNeighbour->coord[2];
		} else if (*(macroNeighbour->getElement()->getDOF(2)) == *(element_->getDOF(0))) {
		  neighbourCoord_[i][0] = macroNeighbour->coord[2];
		  neighbourCoord_[i][1] = macroNeighbour->coord[0];
		} else {
Thomas Witkowski's avatar
Thomas Witkowski committed
119
		  ERROR_EXIT("Should not happen!\n");
120
121
122
123
124
		}
		
		neighbourCoord_[i][2] = oppCoord_[i];
		break;
		
Thomas Witkowski's avatar
Thomas Witkowski committed
125
126
127
128
129
130
131
132
133
134
135
136
	      case 2:
		if (*(macroNeighbour->getElement()->getDOF(2)) == *(element_->getDOF(0))) {
		  neighbourCoord_[i][0] = macroNeighbour->coord[2];
		  neighbourCoord_[i][1] = macroNeighbour->coord[1];
		} else if (*(macroNeighbour->getElement()->getDOF(2)) == *(element_->getDOF(1))) {
		  neighbourCoord_[i][0] = macroNeighbour->coord[0];
		  neighbourCoord_[i][1] = macroNeighbour->coord[2];		 
		} else {
		  ERROR_EXIT("Should not happen!\n");
		}
		break;

137
	      default:
Thomas Witkowski's avatar
Thomas Witkowski committed
138
		std::cout << "------------- Error --------------" << std::endl;
Thomas Witkowski's avatar
Thomas Witkowski committed
139
140
		std::cout << "  Neighbour counter = " << i << "\n";
		std::cout << "  Element index     = " << element_->getIndex() << "\n\n";
Thomas Witkowski's avatar
Thomas Witkowski committed
141
142
143
144
145
146
147
148
149
150
151
		for (int j = 0; j < neighbours; j++) {
		  if (mel->getNeighbour(j)) {
		    std::cout << "  Neighbour " << j << ": " 
			      << mel->getNeighbour(j)->getElement()->getIndex() 
			      << std::endl;
		  } else {
		    std::cout << "  Neighbour " << j << ": not existing" << std::endl;
		  }
		  std::cout << "  OppVertex " << j << ": " << static_cast<int>(mel->getOppVertex(j)) << std::endl;
		  std::cout << std::endl;
		}
152
153
		ERROR_EXIT("should not happen!\n");
		break;
154
155
156
	      }
	    }
	  } else {
157
158
159
160
161
	    if (fill_opp_coords) {
	      oppCoord_[i] = macroNeighbour->coord[edgeNo];

	      neighbourCoord_[i] = macroNeighbour->coord;	      
	    }
162
	  }
163
164
165
	} else {
	  neighbour_[i] = NULL;
        }
166
      }
167
    }
168
    
169
170
    if (fillFlag_.isSet(Mesh::FILL_BOUND)) {   
      for (int i = 0; i < element_->getGeo(BOUNDARY); i++) {
171
172
173
	boundary_[i] = mel->getBoundary(i);
      }

174
      for (int i = 0; i < element_->getGeo(PROJECTION); i++) {
175
176
177
178
179
180
181
182
183
184
	projection_[i] = mel->getProjection(i);
      }
    }
  }


  /****************************************************************************/
  /*   fill ElInfo structure for one child of an element   		    */
  /****************************************************************************/

185
  void ElInfo2d::fillElInfo(int ichild, const ElInfo *elInfoOld)
186
  {
187
    FUNCNAME("ElInfo::fillElInfo()");
188

189
    Element *elem = elInfoOld->element_;
190
191
    Element *nb;

192
    Flag fill_flag = elInfoOld->fillFlag_;
193

194
195
196
197
198
    TEST_EXIT_DBG(elem->getFirstChild())("no children?\n");
    element_ = const_cast<Element*>((ichild == 0) ? 
				    elem->getFirstChild() : 
				    elem->getSecondChild());
    TEST_EXIT_DBG(element_)("missing child %d?\n", ichild);
199

200
    macroElement_  = elInfoOld->macroElement_;
201
    fillFlag_ = fill_flag;
202
    parent_ = elem;
203
    level = elInfoOld->level + 1;
204
    iChild = ichild;
205
206
207

    if (fillFlag_.isSet(Mesh::FILL_COORDS) || 
	fillFlag_.isSet(Mesh::FILL_DET)    ||
208
209
	fillFlag_.isSet(Mesh::FILL_GRD_LAMBDA)) {
      
210
      if (elem->isNewCoordSet()) {
211
212
	coord_[2] = *(elem->getNewCoord());
      } else {
213
	coord_[2].setMidpoint(elInfoOld->coord_[0], elInfoOld->coord_[1]);
214
215
216
      }
      
      if (ichild == 0) {
217
218
	coord_[0] = elInfoOld->coord_[2];
	coord_[1] = elInfoOld->coord_[0];
219
      } else {
220
221
	coord_[0] = elInfoOld->coord_[1];
	coord_[1] = elInfoOld->coord_[2];
222
223
224
225
226
227
228
229
230
231
      }
    }

    bool fill_opp_coords = (fill_flag.isSet(Mesh::FILL_OPP_COORDS));

    if (fill_flag.isSet(Mesh::FILL_NEIGH) || fill_opp_coords) {     
      if (ichild == 0) {
	// Calculation of the neighbour 2, its oppCoords and the
	// cooresponding oppVertex.

232
233
	neighbour_[2] = elInfoOld->neighbour_[1];
	oppVertex_[2] = elInfoOld->oppVertex_[1];
234
235
	
	if (neighbour_[2] && fill_opp_coords) {
236
237
	  oppCoord_[2] = elInfoOld->oppCoord_[1];
	  neighbourCoord_[2] = elInfoOld->neighbourCoord_[1];
238
	}
239
240
241
242
243
244
245
246
247
248
249
250
251
	
	
	// Calculation of the neighbour 1, its oppCoords and the
	// cooresponding oppVertex.
	
	if (elem->getFirstChild()  &&  
	    elem->getSecondChild()->getFirstChild()  &&  
	    elem->getSecondChild()->getFirstChild()) {
	  
	  neighbour_[1] = elem->getSecondChild()->getSecondChild();
	  oppVertex_[1] = 2;
	  
	  if (fill_opp_coords) {
252
            if (elem->getSecondChild()->isNewCoordSet()) {
253
254
	      oppCoord_[1] = *(elem->getSecondChild()->getNewCoord());
	    } else {      
255
256
	      oppCoord_[1].setMidpoint(elInfoOld->coord_[1], 
				       elInfoOld->coord_[2]);
257
	    }
258

259
260
261
	    neighbourCoord_[1][0] = coord_[0];
	    neighbourCoord_[1][1] = coord_[2];
	    neighbourCoord_[1][2] = oppCoord_[1];  
262
263
	  }
	} else {
264
265
266
267
	  neighbour_[1] = elem->getSecondChild();
	  oppVertex_[1] = 0;

	  if (fill_opp_coords) {
268
	    oppCoord_[1] = elInfoOld->coord_[1];
269

270
271
	    neighbourCoord_[1][0] = elInfoOld->coord_[1];
	    neighbourCoord_[1][1] = elInfoOld->coord_[2];
272
	    neighbourCoord_[1][2] = coord_[2];
273
274
275
276
	  }
	}


277
278
279
	// Calculation of the neighbour 0, its oppCoords and the
	// cooresponding oppVertex.
	
280
	nb = elInfoOld->neighbour_[2];
281
	if (nb) {
282
	  TEST(elInfoOld->oppVertex_[2] == 2)("invalid neighbour\n"); 
283
284
	  TEST_EXIT_DBG(nb->getFirstChild())("missing first child?\n");
	  TEST_EXIT_DBG(nb->getSecondChild())("missing second child?\n");
285
286
287
288
289
290
	 
	  nb = nb->getSecondChild();

	  if (nb->getFirstChild()) {
	    oppVertex_[0] = 2;

291
	    if (fill_opp_coords) {
292
	      if (nb->isNewCoordSet()) {
293
294
		oppCoord_[0] = *(nb->getNewCoord());
	      } else {
295
296
		oppCoord_[0].setMidpoint(elInfoOld->neighbourCoord_[2][1],
					 elInfoOld->neighbourCoord_[2][2]);
297
	      }
298

299
300
301
	      neighbourCoord_[0][0].setMidpoint(elInfoOld->neighbourCoord_[2][0],
						elInfoOld->neighbourCoord_[2][1]);
	      neighbourCoord_[0][1] = elInfoOld->neighbourCoord_[2][1];
302
303
304
305
306
307
308
	      neighbourCoord_[0][2] = oppCoord_[0];
	    }	   
 
	    nb = nb->getFirstChild();
	  } else {
	    oppVertex_[0] = 1;

309
	    if (fill_opp_coords) {
310
	      oppCoord_[0] = elInfoOld->oppCoord_[2];    
311

312
313
314
315
	      neighbourCoord_[0][0] = elInfoOld->neighbourCoord_[2][0];
	      neighbourCoord_[0][1] = elInfoOld->neighbourCoord_[2][2];
	      neighbourCoord_[0][2].setMidpoint(elInfoOld->neighbourCoord_[2][0],
						elInfoOld->neighbourCoord_[2][1]);
316
317
	    }
	  }
318
319
320
321
322
323
324
	}
	
	neighbour_[0] = nb;
      } else {   /* ichild == 1 */
	// Calculation of the neighbour 2, its oppCoords and the
	// cooresponding oppVertex.

325
326
	neighbour_[2] = elInfoOld->neighbour_[0];
	oppVertex_[2] = elInfoOld->oppVertex_[0];
327
328

	if (neighbour_[2] && fill_opp_coords) {
329
330
	  oppCoord_[2] = elInfoOld->oppCoord_[0];
	  neighbourCoord_[2] = elInfoOld->neighbourCoord_[0];
331
332
333
334
335
336
337
338
339
340
341
	}
	

	// Calculation of the neighbour 0, its oppCoords and the
	// cooresponding oppVertex.

	if (elem->getFirstChild()->getFirstChild()) {
	  neighbour_[0] = elem->getFirstChild()->getFirstChild();
	  oppVertex_[0] = 2;

	  if (fill_opp_coords) {
342
            if (elem->getFirstChild()->isNewCoordSet()) {
343
	      oppCoord_[0] = *(elem->getFirstChild()->getNewCoord());
344
	    } else {
345
346
	      oppCoord_[0].setMidpoint(elInfoOld->coord_[0], 
				       elInfoOld->coord_[2]);
347
	    }
348
349
350
351

	    neighbourCoord_[0][0] = coord_[2];
	    neighbourCoord_[0][1] = coord_[1];
	    neighbourCoord_[0][2] = oppCoord_[0];
352
	  }
353
354
355
356
357
	} else {
	  neighbour_[0] = elem->getFirstChild();
	  oppVertex_[0] = 1;

	  if (fill_opp_coords) {
358
	    oppCoord_[0] = elInfoOld->coord_[0];
359

360
361
	    neighbourCoord_[0][0] = elInfoOld->coord_[2];
	    neighbourCoord_[0][1] = elInfoOld->coord_[0];
362
	    neighbourCoord_[0][2] = coord_[2];
363
	  }
364
365
366
367
368
	}

	// Calculation of the neighbour 1, its oppCoords and the
	// cooresponding oppVertex.

369
	nb = elInfoOld->neighbour_[2];
370
	if (nb) {
371
	  TEST(elInfoOld->oppVertex_[2] == 2)("invalid neighbour\n"); 
372
373
374
375
376
	  TEST((nb = nb->getFirstChild()))("missing child?\n");

	  if (nb->getFirstChild()) {
	    oppVertex_[1] = 2;

377
	    if (fill_opp_coords) {
378
	      if (nb->isNewCoordSet()) {
379
		oppCoord_[1] = *(nb->getNewCoord());
380
	      } else {
381
382
		oppCoord_[1].setMidpoint(elInfoOld->neighbourCoord_[2][0],
					 elInfoOld->neighbourCoord_[2][2]);
383
	      }
384

385
386
387
	      neighbourCoord_[1][0] = elInfoOld->neighbourCoord_[2][0];
	      neighbourCoord_[1][1].setMidpoint(elInfoOld->neighbourCoord_[2][0],
						elInfoOld->neighbourCoord_[2][1]);
388
	      neighbourCoord_[1][2] = oppCoord_[1];
389
	    }
390
391
	    nb = nb->getSecondChild();

392
	  } else {
393
394
	    oppVertex_[1] = 0;

395
	    if (fill_opp_coords) {
396
	      oppCoord_[1] = elInfoOld->oppCoord_[2];
397

398
399
400
401
	      neighbourCoord_[1][0] = elInfoOld->neighbourCoord_[2][2];	      
	      neighbourCoord_[1][1] = elInfoOld->neighbourCoord_[2][0];
	      neighbourCoord_[1][2].setMidpoint(elInfoOld->neighbourCoord_[2][0],
						elInfoOld->neighbourCoord_[2][1]);
402
403
404
	    }
	  }
	}
405
406
407
408
409
	neighbour_[1] = nb;
      } // if (ichild == 0) {} else
    } // if (fill_flag.isSet(Mesh::FILL_NEIGH) || fillFlag_.isSet(Mesh::FILL_OPP_COORDS))
    

410
    if (fill_flag.isSet(Mesh::FILL_BOUND)) {
411
412
      if (elInfoOld->getBoundary(2)) {
	boundary_[5] = elInfoOld->getBoundary(2);
413
      } else {
414
	boundary_[5] = INTERIOR;
415
      }
416

417
      if (ichild == 0) {
418
419
420
	boundary_[3] = elInfoOld->getBoundary(5);
	boundary_[4] = elInfoOld->getBoundary(3);
	boundary_[0] = elInfoOld->getBoundary(2);
421
	boundary_[1] = INTERIOR;
422
	boundary_[2] = elInfoOld->getBoundary(1);
423
      } else {
424
425
	boundary_[3] = elInfoOld->getBoundary(4);
	boundary_[4] = elInfoOld->getBoundary(5);
426
	boundary_[0] = INTERIOR;
427
428
	boundary_[1] = elInfoOld->getBoundary(2);
	boundary_[2] = elInfoOld->getBoundary(0);
429
430
      }

431
432
      if (elInfoOld->getProjection(0) && 
	  elInfoOld->getProjection(0)->getType() == VOLUME_PROJECTION) {
433
	
434
	projection_[0] = elInfoOld->getProjection(0);
435
436
      } else { // boundary projection
	if (ichild == 0) {
437
	  projection_[0] = elInfoOld->getProjection(2);
438
	  projection_[1] = NULL;
439
	  projection_[2] = elInfoOld->getProjection(1);
440
441
	} else {
	  projection_[0] = NULL;
442
443
	  projection_[1] = elInfoOld->getProjection(2);
	  projection_[2] = elInfoOld->getProjection(0);
444
445
446
447
448
	}
      }
    }
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
449
  double ElInfo2d::calcGrdLambda(DimVec<WorldVector<double> >& grd_lam)
450
  {
451
    FUNCNAME("ElInfo2d::calcGrdLambda()");
452
453

    testFlag(Mesh::FILL_COORDS);
454
455
  
    double adet = 0.0;
456
457
    int dim = mesh_->getDim();

Thomas Witkowski's avatar
Thomas Witkowski committed
458
    for (int i = 0; i < dimOfWorld; i++) {
459
460
      (*e1)[i] = coord_[1][i] - coord_[0][i];
      (*e2)[i] = coord_[2][i] - coord_[0][i];
461
462
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
463
    if (dimOfWorld == 2) {
464
      double sdet = (*e1)[0] * (*e2)[1] - (*e1)[1] * (*e2)[0];
465
466
467
468
      adet = abs(sdet);

      if (adet < 1.0E-25) {
	MSG("abs(det) = %f\n", adet);
469
	for (int i = 0; i <= dim; i++)
Thomas Witkowski's avatar
Thomas Witkowski committed
470
	  for (int j = 0; j < dimOfWorld; j++)
471
	    grd_lam[i][j] = 0.0;
472
473
      } else {
	double det1 = 1.0 / sdet;
474
475
476
477
478

	grd_lam[1][0] = (*e2)[1] * det1;  // a11: (a_ij) = A^{-T}
	grd_lam[1][1] = -(*e2)[0] * det1; // a21
	grd_lam[2][0] = -(*e1)[1] * det1; // a12
	grd_lam[2][1] = (*e1)[0] * det1;  // a22
479
480
	grd_lam[0][0] = - grd_lam[1][0] - grd_lam[2][0];
	grd_lam[0][1] = - grd_lam[1][1] - grd_lam[2][1];
481
      }
482
483
    } else {  
      vectorProduct(*e1, *e2, *normal);
484

485
      adet = norm(normal);
486
487
488

      if (adet < 1.0E-15) {
	MSG("abs(det) = %lf\n", adet);
489
	for (int i = 0; i <= dim; i++)
Thomas Witkowski's avatar
Thomas Witkowski committed
490
	  for (int j = 0; j < dimOfWorld; j++)
491
492
	    grd_lam[i][j] = 0.0;
      } else {
493
494
	vectorProduct(*e2, *normal, grd_lam[1]);
	vectorProduct(*normal, *e1, grd_lam[2]);
495
      
496
	double adet2 = 1.0 / (adet * adet);
497

Thomas Witkowski's avatar
Thomas Witkowski committed
498
	for (int i = 0; i < dimOfWorld; i++) {
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
	  grd_lam[1][i] *= adet2;
	  grd_lam[2][i] *= adet2;
	}

	grd_lam[0][0] = - grd_lam[1][0] - grd_lam[2][0];
	grd_lam[0][1] = - grd_lam[1][1] - grd_lam[2][1];
	grd_lam[0][2] = - grd_lam[1][2] - grd_lam[2][2];
      }
    }

    return adet;
  }

  const int ElInfo2d::worldToCoord(const WorldVector<double>& xy,
				   DimVec<double>* lambda) const
  {
515
    FUNCNAME("ElInfo::worldToCoord()");
516

517
    TEST_EXIT_DBG(lambda)("lambda must not be NULL\n");
518

519
520
521
522
    DimVec<WorldVector<double> > edge(mesh_->getDim(), NO_INIT);
    WorldVector<double> x; 
    static DimVec<double> vec(mesh_->getDim(), NO_INIT);

523
524
    int dim = mesh_->getDim();

525
526
    for (int j = 0; j < dimOfWorld; j++) {
      double x0 = coord_[dim][j];
527
      x[j] = xy[j] - x0;
528
      for (int i = 0; i < dim; i++)
529
530
531
	edge[i][j] = coord_[i][j] - x0;
    }
  
532
533
534
    double det  = edge[0][0] * edge[1][1] - edge[0][1] * edge[1][0]; 
    double det0 =       x[0] * edge[1][1] -       x[1] * edge[1][0]; 
    double det1 = edge[0][0] * x[1]       - edge[0][1] * x[0]; 
535
536
537

    if (abs(det) < DBL_TOL) {
      ERROR("det = %le; abort\n", det);
538
539
      for (int i = 0; i <= dim; i++) 
	(*lambda)[i] = 1.0/dim;
540
541
542
543
544
545
546
547
548
      return 0;
    }

    (*lambda)[0] = det0 / det;
    (*lambda)[1] = det1 / det;
    (*lambda)[2] = 1.0 - (*lambda)[0] - (*lambda)[1];

    int k = -1;
    double lmin = 0.0;
549
    for (int i = 0; i <= dim; i++) {
550
551
552
553
554
555
556
557
558
559
560
561
      if ((*lambda)[i] < -1.E-5) {
	if ((*lambda)[i] < lmin) {
	  k = i;
	  lmin = (*lambda)[i];
	}
      }
    }

    return k;
  }


Thomas Witkowski's avatar
Thomas Witkowski committed
562
  double ElInfo2d::getNormal(int side, WorldVector<double> &normal)
563
  {
564
    FUNCNAME("ElInfo::getNormal()");
565

566
567
    int i0 = (side + 1) % 3;
    int i1 = (side + 2) % 3;
568

Thomas Witkowski's avatar
Thomas Witkowski committed
569
    if (dimOfWorld == 2){
570
571
572
573
574
      normal[0] = coord_[i1][1] - coord_[i0][1];
      normal[1] = coord_[i0][0] - coord_[i1][0];
    } else { // dow == 3
      WorldVector<double> e0, e1,e2, elementNormal;

575
576
577
578
579
580
      e0 = coord_[i1]; 
      e0 -= coord_[i0];
      e1 = coord_[i1]; 
      e1 -= coord_[side];
      e2 = coord_[i0]; 
      e2 -= coord_[side];
581
582
583
584
585

      vectorProduct(e1, e2, elementNormal);
      vectorProduct(elementNormal, e0, normal);
    }

586
    double det = norm(&normal);
587

588
    TEST_EXIT_DBG(det > 1.e-30)("det = 0 on face %d\n", side);
589
590
591

    normal *= 1.0 / det;
    
Thomas Witkowski's avatar
Thomas Witkowski committed
592
    return det;
593
594
595
596
597
598
599
  }

  /****************************************************************************/
  /*  calculate the normal of the element for dim of world = dim + 1          */
  /*  return the absulute value of the determinant from the                   */
  /*  transformation to the reference element                                 */
  /****************************************************************************/
Thomas Witkowski's avatar
Thomas Witkowski committed
600
  double ElInfo2d::getElementNormal(WorldVector<double> &elementNormal) const
601
  {
602
    FUNCNAME("ElInfo::getElementNormal()");
603

Thomas Witkowski's avatar
Thomas Witkowski committed
604
605
    TEST_EXIT_DBG(dimOfWorld == 3)
      (" element normal only well defined for  DIM_OF_WORLD = DIM + 1 !!");
606

607
608
    WorldVector<double> e0 = coord_[1] - coord_[0];
    WorldVector<double> e1 = coord_[2] - coord_[0];
609
610
611

    vectorProduct(e0, e1, elementNormal);

612
    double det = norm(&elementNormal);
613

614
    TEST_EXIT_DBG(det > 1.e-30)("det = 0");
615
616
617

    elementNormal *= 1.0 / det;
    
Thomas Witkowski's avatar
Thomas Witkowski committed
618
    return det;
619
  }
620

621
}