Mesh.cc 41.4 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
//
// Software License for AMDiS
//
// Copyright (c) 2010 Dresden University of Technology 
// All rights reserved.
// Authors: Simon Vey, Thomas Witkowski et al.
//
// This file is part of AMDiS
//
// See also license.opensource.txt in the distribution.


Thomas Witkowski's avatar
Thomas Witkowski committed
13
14
15
16
17
18
#include <algorithm>
#include <set>
#include <map>

#include "time.h"

19
#include "io/ArhReader.h"
20
21
22
23
#include "io/MacroReader.h"
#include "io/MacroInfo.h"
#include "io/MacroWriter.h"

24
25
26
27
#include "AdaptStationary.h"
#include "AdaptInstationary.h"
#include "FiniteElemSpace.h"
#include "ElementData.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
28
#include "ElementDofIterator.h"
29
30
31
#include "MacroElement.h"
#include "Mesh.h"
#include "Traverse.h"
32
#include "Initfile.h"
33
34
35
36
37
38
#include "FixVec.h"
#include "DOFVector.h"
#include "CoarseningManager.h"
#include "DOFIterator.h"
#include "VertexVector.h"
#include "Projection.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
39
#include "ElInfoStack.h"
40
#include "Serializer.h"
41
#include "Lagrange.h"
42
43
44
45
46
47
48
49
50

namespace AMDiS {

#define TIME_USED(f,s) ((double)((s)-(f))/(double)CLOCKS_PER_SEC)

  //**************************************************************************
  //  flags, which information should be present in the elInfo structure     
  //**************************************************************************

51
52
53
54
55
56
57
58
59
60
61
62
63
64
  const Flag Mesh::FILL_NOTHING    = 0X00L;
  const Flag Mesh::FILL_COORDS     = 0X01L;
  const Flag Mesh::FILL_BOUND      = 0X02L;
  const Flag Mesh::FILL_NEIGH      = 0X04L;
  const Flag Mesh::FILL_OPP_COORDS = 0X08L;
  const Flag Mesh::FILL_ORIENTATION= 0X10L;
  const Flag Mesh::FILL_DET        = 0X20L;
  const Flag Mesh::FILL_GRD_LAMBDA = 0X40L;
  const Flag Mesh::FILL_ADD_ALL    = 0X80L;


  const Flag Mesh::FILL_ANY_1D = (0X01L|0X02L|0X04L|0X08L|0x20L|0X40L|0X80L);
  const Flag Mesh::FILL_ANY_2D = (0X01L|0X02L|0X04L|0X08L|0x20L|0X40L|0X80L);
  const Flag Mesh::FILL_ANY_3D = (0X01L|0X02L|0X04L|0X08L|0X10L|0x20L|0X40L|0X80L);
65
66
67
68
69
70
71
72
73
74
75

  //**************************************************************************
  //  flags for Mesh traversal                                                
  //**************************************************************************

  const Flag Mesh::CALL_EVERY_EL_PREORDER  = 0X0100L;
  const Flag Mesh::CALL_EVERY_EL_INORDER   = 0X0200L;
  const Flag Mesh::CALL_EVERY_EL_POSTORDER = 0X0400L;
  const Flag Mesh::CALL_LEAF_EL            = 0X0800L;
  const Flag Mesh::CALL_LEAF_EL_LEVEL      = 0X1000L;
  const Flag Mesh::CALL_EL_LEVEL           = 0X2000L;
76
77
  const Flag Mesh::CALL_MG_LEVEL           = 0X4000L;  
  const Flag Mesh::CALL_REVERSE_MODE       = 0X8000L;
78
79


80
  vector<DegreeOfFreedom> Mesh::dof_used;
81
  const int Mesh::MAX_DOF = 100;
82
  map<pair<DegreeOfFreedom, int>, DegreeOfFreedom*> Mesh::serializedDOFs;
83

84
  Mesh::Mesh(string aName, int dimension) 
85
86
87
88
89
90
91
92
    : name(aName), 
      dim(dimension), 
      nVertices(0),
      nEdges(0),
      nLeaves(0), 
      nElements(0),
      parametric(NULL), 
      preserveCoarseDOFs(false),
93
94
      nDofEl(0),
      nDof(dimension, DEFAULT_VALUE, 0),
95
96
97
98
99
100
      nNodeEl(0),
      node(dimension, DEFAULT_VALUE, 0),
      elementPrototype(NULL),
      elementDataPrototype(NULL),
      elementIndex(-1),
      initialized(false),
101
      macroFileInfo(NULL),
102
      changeIndex(0),
103
104
      final_lambda(dimension, DEFAULT_VALUE, 0.0)
  {
105
    FUNCNAME("Mesh::Mesh()");
106

107
108
109
110
#ifdef HAVE_PARALLEL_DOMAIN_AMDIS
    nParallelPreRefinements = 0;
#endif

111
112
113
    // set default element prototype
    switch(dim) {
    case 1:
Thomas Witkowski's avatar
Thomas Witkowski committed
114
      elementPrototype = new Line(this);
115
116
      break;
    case 2:
Thomas Witkowski's avatar
Thomas Witkowski committed
117
      elementPrototype = new Triangle(this);
118
119
      break;
    case 3:
Thomas Witkowski's avatar
Thomas Witkowski committed
120
      elementPrototype = new Tetrahedron(this);
121
122
123
124
125
126
127
      break;
    default:
      ERROR_EXIT("invalid dimension\n");
    }

    elementPrototype->setIndex(-1);

128
129
    elementIndex = 0;
  }
130

131

132
  Mesh::~Mesh()
133
  {
134
    deleteMeshStructure();
135

136
137
138
139
140
141
    if (macroFileInfo != NULL)
      delete macroFileInfo;    
    if (elementPrototype)
      delete elementPrototype;    
    if (elementDataPrototype)
      delete elementDataPrototype;    
142
    
143
    for (unsigned int i = 0; i < admin.size(); i++)
144
      delete admin[i];    
145
  }
146

147

148
  Mesh& Mesh::operator=(const Mesh& m)
149
  {
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
    FUNCNAME("Mesh::operator=()");

    if (this == &m)
      return *this;

    TEST_EXIT(dim == m.dim)("operator= works only on meshes with equal dim!\n");

    name = m.name;
    nVertices = m.nVertices;
    nEdges = m.nEdges;
    nLeaves = m.nLeaves;
    nElements = m.nElements;
    nFaces = m.nFaces;
    maxEdgeNeigh = m.maxEdgeNeigh;
    diam = m.diam;
    parametric = NULL;

    preserveCoarseDOFs = m.preserveCoarseDOFs;
168
169
    nDofEl = m.nDofEl;
    nDof = m.nDof;
170
171
172
173
174
175
176
177
178
    nNodeEl = m.nNodeEl;
    node = m.node;
    elementIndex = m.elementIndex;
    initialized = m.initialized;
    final_lambda = m.final_lambda;
    
    /* ====================== Create new DOFAdmins ================== */
    admin.resize(m.admin.size());
    for (int i = 0; i < static_cast<int>(admin.size()); i++) {
Thomas Witkowski's avatar
Thomas Witkowski committed
179
      admin[i] = new DOFAdmin(this);
180
      *(admin[i]) = *(m.admin[i]);
181
182
      admin[i]->setMesh(this);
    }
183

184

185
    /* ====================== Copy macro elements =================== */
186
  
187
188
    // mapIndex[i] is the index of the MacroElement element in the vector
    // macroElements, for which holds: element->getIndex() = i    
189
    map<int, int> mapIndex;
190
191
192
193
194
195

    // We use this map for coping the DOFs of the Elements within the
    // MacroElements objects.
    Mesh::serializedDOFs.clear();

    int insertCounter = 0;
196

197
198
    macroElements.clear();

199
200
    // Go through all MacroElements of mesh m, and create for every a new
    // MacroElement in this mesh.
201
    for (deque<MacroElement*>::const_iterator it = m.macroElements.begin();
202
	 it != m.macroElements.end(); ++it, insertCounter++) {
203

204
      // Create new MacroElement.
Thomas Witkowski's avatar
Thomas Witkowski committed
205
      MacroElement *el = new MacroElement(dim);
206

207
208
209
210
211
212
213
214
215
216
      // Use copy operator to copy all the data to the new MacroElement.
      *el = **it;

      // Make a copy of the Element data, together with all DOFs
      el->setElement((*it)->getElement()->cloneWithDOFs());

      // Insert the new MacroElement in the vector of all MacroElements.
      macroElements.push_back(el);

      // Update the index map.
217
      mapIndex.insert(pair<int, int>(el->getIndex(), insertCounter));
218
219
220
221
222
    }

    // Now we have to go through all the new MacroElements, and update the neighbour
    // connections.
    insertCounter = 0;
223
    for (deque<MacroElement*>::const_iterator it = m.macroElements.begin();
224
225
226
227
228
229
230
231
232
	 it != m.macroElements.end();
	 ++it, insertCounter++) {
      // Go through all neighbours.
      for (int i = 0; i < dim; i++) {
	// 1. Get index of the old MacroElement for its i-th neighbour.
	// 2. Because the index in the new MacroElement is the same, search
	//    for the vector index the corresponding element is stored in.
	// 3. Get this element from macroElements, and set it as the i-th
	//    neighbour for the current element.
233
	if((*it)->getNeighbour(i)!=NULL) {
234
235
236
	macroElements[insertCounter]->
	  setNeighbour(i, macroElements[mapIndex[(*it)->getNeighbour(i)->getIndex()]]);
      }
237
      }
238
239
240
241
242
243
244
245
246
247
248
249
250
251
    }

    // Cleanup
    Mesh::serializedDOFs.clear();

    /* ================== Things will be done when required ============ */
      
    TEST_EXIT(elementDataPrototype == NULL)("TODO\n");
    TEST_EXIT(m.parametric == NULL)("TODO\n");
    TEST_EXIT(periodicAssociations.size() == 0)("TODO\n");

    return *this;
  }

252

253
254
255
256
257
258
259
260
261
262
263
264
  void Mesh::updateNumberOfLeaves()
  {
    nLeaves = 0;

    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(this, -1, Mesh::CALL_LEAF_EL);
    while (elInfo) {
      nLeaves++;
      elInfo = stack.traverseNext(elInfo);
    }
  }

265

266
267
268
269
270
271
  void Mesh::addMacroElement(MacroElement* me) 
  {
    macroElements.push_back(me); 
    me->setIndex(macroElements.size());
  }

272

273
  void Mesh::removeMacroElements(std::set<MacroElement*>& delMacros,
274
				 vector<const FiniteElemSpace*>& feSpaces) 
275
276
277
  {
    FUNCNAME("Mesh::removeMacroElement()");

278
279
    typedef map<const DegreeOfFreedom*, std::set<MacroElement*> > DofElMap;
    typedef map<const DegreeOfFreedom*, GeoIndex> DofPosMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
280

281
    TEST_EXIT(feSpaces.size() > 0)("Should not happen!\n");
Thomas Witkowski's avatar
Thomas Witkowski committed
282

283
284
285
286
    // Search for the FE space with the highest degree of polynomials. Using this
    // FE space ensures that deleting DOFs defined on it, also DOFs of lower
    // order FE spaces will be deleted correctly.
    const FiniteElemSpace *feSpace = FiniteElemSpace::getHighest(feSpaces);
287
288

    
289
290
    // === Determine to all DOFs in mesh the macro elements where the DOF  ===
    // === is part of.                                                     ===
291

292
293
    // Map that stores for each DOF pointer (which may have a list of DOFs)
    // all macro element indices that own this DOF.
Thomas Witkowski's avatar
Thomas Witkowski committed
294
295
    DofElMap dofsOwner;
    DofPosMap dofsPosIndex;
296

297
298
299
300
301
    ElementDofIterator elDofIter(feSpace);
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(this, -1, Mesh::CALL_LEAF_EL);
    while (elInfo) {
      elDofIter.reset(elInfo->getElement());
Thomas Witkowski's avatar
Thomas Witkowski committed
302
      do {
303
304
	dofsOwner[elDofIter.getBaseDof()].insert(elInfo->getMacroElement());
	dofsPosIndex[elDofIter.getBaseDof()] = elDofIter.getPosIndex();
Thomas Witkowski's avatar
Thomas Witkowski committed
305
      } while (elDofIter.nextStrict());
306
307
308
309

      elInfo = stack.traverseNext(elInfo);
    }		   

Thomas Witkowski's avatar
Thomas Witkowski committed
310

311
312
    // === Remove macro elements from mesh macro element list. ===

313
    // Removing arbitrary elements from an deque is very slow. Therefore, we
314
315
316
    // create a new deque with all macro elements that should not be deleted. The
    // macro element deque is than replaced by the new created one.

317
318
    deque<MacroElement*> newMacroElements;
    for (deque<MacroElement*>::iterator elIter = macroElements.begin();
319
	 elIter != macroElements.end(); ++elIter) {
320
321
322
      // If the current mesh macro element should not be deleted, i.e., it is not
      // a member of the list of macro elements to be deleted, is is inserted to
      // the new macro element list.
323
      if (delMacros.find(*elIter) == delMacros.end())
324
	newMacroElements.push_back(*elIter);     
325
    }
326

327
328
329
330
    // And replace the macro element list with the new one.
    macroElements.clear();
    macroElements = newMacroElements;

Thomas Witkowski's avatar
Thomas Witkowski committed
331

332
333
334
    // === For all macro elements to be deleted, delete them also to be       ===
    // === neighbours of some other macro elements. Furtheremore, delete the  ===
    // === whole element hierarchie structure of the macro element.           ===
335
    
336
337
    for (std::set<MacroElement*>::iterator macroIt = delMacros.begin();
	 macroIt != delMacros.end(); ++macroIt) {
Thomas Witkowski's avatar
Thomas Witkowski committed
338

339
340
      // Go through all neighbours of the macro element and remove this macro
      // element to be neighbour of some other macro element.
341
      for (int i = 0; i < getGeo(NEIGH); i++)
342
	if ((*macroIt)->getNeighbour(i))
343
	  for (int j = 0; j < getGeo(NEIGH); j++)
Thomas Witkowski's avatar
Thomas Witkowski committed
344
	    if ((*macroIt)->getNeighbour(i)->getNeighbour(j) == *macroIt)
345
346
	      (*macroIt)->getNeighbour(i)->setNeighbour(j, NULL);

347
      Element *mel = (*macroIt)->getElement();
348
      // Delete element hierarchie
349
350
351
      if (!(mel->isLeaf())) {
	delete mel->getChild(0);
	delete mel->getChild(1);
352

353
354
	mel->child[0] = NULL;
	mel->child[1] = NULL;
355

356
	mel->setElementData(elementDataPrototype->clone()); 
357
      }
358

359
      mel->delDofPtr();
360
    }     
361
362


363
364
    // === Check now all the DOFs that have no owner anymore and therefore  ===
    // === have to be removed.                                              ===
365

Thomas Witkowski's avatar
Thomas Witkowski committed
366
    for (DofElMap::iterator dofsIt = dofsOwner.begin(); 
367
368
369
370
371
372
	 dofsIt != dofsOwner.end(); ++dofsIt) {
      
      bool deleteDof = true;

      for (std::set<MacroElement*>::iterator elIter = dofsIt->second.begin();
	   elIter != dofsIt->second.end(); ++elIter) {
373
374
	std::set<MacroElement*>::iterator mIt = delMacros.find(*elIter);
	if (mIt == delMacros.end()) {
375
376
377
378
379
380
	  deleteDof = false;
	  break;
	}
      }

      if (deleteDof)
381
	freeDof(const_cast<DegreeOfFreedom*>(dofsIt->first), 
382
		dofsPosIndex[dofsIt->first]);      
383
384
    }

385

386
    // === Update number of elements, vertices, etc. ===
387

388
389
390
391
392
393
394
395
    nLeaves = 0;
    nElements = 0;

    std::set<const DegreeOfFreedom*> allVertices;

    elInfo = stack.traverseFirst(this, -1, Mesh::CALL_EVERY_EL_PREORDER);
    while (elInfo) {
      nElements++;
396

397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
      if (elInfo->getElement()->isLeaf()) {
	nLeaves++;

	for (int i = 0; i < getGeo(VERTEX); i++)
	  allVertices.insert(elInfo->getElement()->getDof(i));
      }

      elInfo = stack.traverseNext(elInfo);
    }

    nVertices = allVertices.size();

    // === Note: Although the macro elements are removed from the mesh,   ===
    // === they are not deleted from memory. The macro elements are still ===
    // === stored in macroInfo structure. They are needed, if the mesh is ===
    // === redistributed between the ranks.                               ===
413
  }
414

415

416
417
418
419
420
421
  void Mesh::addDOFAdmin(DOFAdmin *localAdmin)
  {    
    FUNCNAME("Mesh::addDOFAdmin()");

    localAdmin->setMesh(this);

422
    TEST_EXIT(find(admin.begin(), admin.end(), localAdmin) == admin.end())
Thomas Witkowski's avatar
Thomas Witkowski committed
423
424
      ("admin %s is already associated to mesh %s\n",
       localAdmin->getName().c_str(), this->getName().c_str());
425
426
427

    admin.push_back(localAdmin);

428
    nDofEl = 0;
429

430
    localAdmin->setNumberOfPreDofs(VERTEX, nDof[VERTEX]);
431
432
    nDof[VERTEX] += localAdmin->getNumberOfDofs(VERTEX);
    nDofEl += getGeo(VERTEX) * nDof[VERTEX];
433

434
    if (dim > 1) {
435
      localAdmin->setNumberOfPreDofs(EDGE, nDof[EDGE]);
436
437
      nDof[EDGE] += localAdmin->getNumberOfDofs(EDGE);
      nDofEl += getGeo(EDGE) * nDof[EDGE];
438
439
    }

440
441
    localAdmin->setNumberOfPreDofs(CENTER, nDof[CENTER]);
    nDof[CENTER] += localAdmin->getNumberOfDofs(CENTER);
442
    nDofEl += nDof[CENTER];
443

444
    TEST_EXIT_DBG(nDof[VERTEX] > 0)("no vertex dofs\n");
445

446
447
    node[VERTEX] = 0;
    nNodeEl = getGeo(VERTEX);
448

449
450
    if (dim > 1) {
      node[EDGE] = nNodeEl;
451
      if (nDof[EDGE] > 0) 
452
	nNodeEl += getGeo(EDGE);
453
454
    }

455
    if (dim == 3) {
456
      localAdmin->setNumberOfPreDofs(FACE, nDof[FACE]);
457
458
      nDof[FACE] += localAdmin->getNumberOfDofs(FACE);
      nDofEl += getGeo(FACE) * nDof[FACE];
459
      node[FACE] = nNodeEl;
460
      if (nDof[FACE] > 0) 
461
	nNodeEl += getGeo(FACE);
462
463
    }

464
    node[CENTER] = nNodeEl;
465
    if (nDof[CENTER] > 0)
466
      nNodeEl += 1;
467
468
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
469

470
471
  void Mesh::dofCompress()
  {
472
    FUNCNAME("Mesh::dofCompress()");
473

Thomas Witkowski's avatar
Thomas Witkowski committed
474
475
    for (unsigned int iadmin = 0; iadmin < admin.size(); iadmin++) {
      DOFAdmin* compressAdmin = admin[iadmin];
476
477

      TEST_EXIT_DBG(compressAdmin)("no admin[%d] in mesh\n", iadmin);
478
      
Thomas Witkowski's avatar
Thomas Witkowski committed
479
      int size = compressAdmin->getSize();
Thomas Witkowski's avatar
Thomas Witkowski committed
480
      if (size < 1 || 
481
	  compressAdmin->getUsedDofs() < 1 || 
Thomas Witkowski's avatar
Thomas Witkowski committed
482
	  compressAdmin->getHoleCount() < 1)    
483
	continue;
Thomas Witkowski's avatar
Thomas Witkowski committed
484

485
      vector<int> newDofIndex(size);     
486
      compressAdmin->compress(newDofIndex);
Thomas Witkowski's avatar
Thomas Witkowski committed
487
488
489
490

      Flag fill_flag = (preserveCoarseDOFs ?  
			Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NOTHING :
			Mesh::CALL_LEAF_EL | Mesh::FILL_NOTHING);          
491
492
493
      TraverseStack stack;
      ElInfo *elInfo = stack.traverseFirst(this, -1, fill_flag);
      while (elInfo) {
494
	elInfo->getElement()->newDofFct1(compressAdmin, newDofIndex);
495
496
497
498
499
	elInfo = stack.traverseNext(elInfo);
      }

      elInfo = stack.traverseFirst(this, -1, fill_flag);
      while (elInfo) {
500
	elInfo->getElement()->newDofFct2(compressAdmin);
501
502
	elInfo = stack.traverseNext(elInfo);
      }
503
    }       
504
505
506
  }


507
  DegreeOfFreedom *Mesh::getDof(GeoIndex position)
508
  {
509
    FUNCNAME("Mesh::getDof()");
510

511
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
512
      ("unknown position %d\n", position);
513

514
    int ndof = getNumberOfDofs(position);
515
    if (ndof <= 0) 
516
      return NULL;
517

518
    DegreeOfFreedom *dof = new DegreeOfFreedom[ndof];
519

520
    for (int i = 0; i < getNumberOfDOFAdmin(); i++) {
521
      const DOFAdmin *localAdmin = &getDofAdmin(i);
522
      TEST_EXIT_DBG(localAdmin)("no admin[%d]\n", i);
523
      
524
      int n  = localAdmin->getNumberOfDofs(position);
525
      int n0 = localAdmin->getNumberOfPreDofs(position);
526
      
527
528
      TEST_EXIT_DBG(n + n0 <= ndof)
	("n = %d, n0 = %d too large: ndof = %d\n", n, n0, ndof);
529
      
530
      for (int j = 0; j < n; j++)
531
532
	dof[n0 + j] = const_cast<DOFAdmin*>(localAdmin)->getDOFIndex();
    }
533
 
534
    return dof;
535
536
537
  }


Thomas Witkowski's avatar
Thomas Witkowski committed
538
  DegreeOfFreedom **Mesh::createDofPtrs()
539
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
540
    FUNCNAME("Mesh::createDofPtrs()");
541
542

    if (nNodeEl <= 0)
543
      return NULL;
544

545
    DegreeOfFreedom **ptrs = new DegreeOfFreedom*[nNodeEl];
546
    for (int i = 0; i < nNodeEl; i++)
547
548
      ptrs[i] = NULL;

549
    return ptrs;
550
551
  }

552

553
  void Mesh::freeDofPtrs(DegreeOfFreedom **ptrs)
554
  {
555
    FUNCNAME("Mesh::freeDofPtrs()");
556

557
    TEST_EXIT_DBG(ptrs)("ptrs is NULL!\n");
558
559
560
561

    if (nNodeEl <= 0)
      return;
  
562
    delete [] ptrs;
563
564
565
  }


566
  const DOFAdmin *Mesh::createDOFAdmin(string lname, DimVec<int> lnDof)
567
  {
568
    FUNCNAME("Mesh::createDOFAdmin()");
569
    
Thomas Witkowski's avatar
Thomas Witkowski committed
570
    DOFAdmin *localAdmin = new DOFAdmin(this, lname);
571

Thomas Witkowski's avatar
Thomas Witkowski committed
572
    for (int i = 0; i < dim + 1; i++)
573
      localAdmin->setNumberOfDofs(i, lnDof[i]);
574
575
576

    addDOFAdmin(localAdmin);

577
    return localAdmin;
578
579
580
581
582
583
584
  }


  const DOFAdmin* Mesh::getVertexAdmin() const
  {
    const DOFAdmin *localAdmin = NULL;

Thomas Witkowski's avatar
Thomas Witkowski committed
585
    for (unsigned int i = 0; i < admin.size(); i++) {
586
      if (admin[i]->getNumberOfDofs(VERTEX)) {
587
588
589
590
	if (!localAdmin)  
	  localAdmin = admin[i];
	else if (admin[i]->getSize() < localAdmin->getSize())
	  localAdmin = admin[i];
591
      }
592
593
    }

594
    return localAdmin;
595
596
  }

597

598
  void Mesh::freeDof(DegreeOfFreedom* dof, GeoIndex position)
599
  {
600
    FUNCNAME("Mesh::freeDof()");
601

602
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
603
      ("unknown position %d\n", position);
604

605
606
    if (nDof[position]) {
      TEST_EXIT_DBG(dof != NULL)("dof = NULL, but ndof = %d\n", nDof[position]);
607
    } else  {
608
      TEST_EXIT_DBG(dof == NULL)("dof != NULL, but ndof = 0\n");
609
    }
610

611
612
    TEST_EXIT_DBG(nDof[position] <= MAX_DOF)
      ("ndof too big: ndof = %d, MAX_DOF = %d\n", nDof[position], MAX_DOF);
613

614
    for (unsigned int i = 0; i < admin.size(); i++) {
615
616
      int n = admin[i]->getNumberOfDofs(position);
      int n0 = admin[i]->getNumberOfPreDofs(position);
617
      
618
619
      TEST_EXIT_DBG(n + n0 <= nDof[position])
	("n = %d, n0 = %d too large: ndof = %d\n", n, n0, nDof[position]);
620
621
      
      for (int j = 0; j < n; j++)
622
	admin[i]->freeDofIndex(dof[n0 + j]);      
623
    }
624

625
    delete [] dof;
626
627
  }

628

629
630
  void Mesh::freeElement(Element* el)
  {
631
    freeDofPtrs(const_cast<DegreeOfFreedom**>(el->getDof()));
Thomas Witkowski's avatar
Thomas Witkowski committed
632
    delete el;
633
634
635
636
637
638
  }


  Element* Mesh::createNewElement(Element *parent)
  {
    FUNCNAME("Mesh::createNewElement()");
639
640

    TEST_EXIT_DBG(elementPrototype)("no element prototype\n");
641
642

    Element *el = parent ? parent->clone() : elementPrototype->clone();
643

Thomas Witkowski's avatar
Thomas Witkowski committed
644
    if (!parent && elementDataPrototype)
645
      el->setElementData(elementDataPrototype->clone()); 
Thomas Witkowski's avatar
Thomas Witkowski committed
646
    else
647
      el->setElementData(NULL); // must be done in ElementData::refineElementData()
648

649
650
651
    return el;
  }

652

653
654
  ElInfo* Mesh::createNewElInfo()
  {
655
656
    FUNCNAME("Mesh::createNewElInfo()");

657
    switch (dim) {
658
    case 1:
Thomas Witkowski's avatar
Thomas Witkowski committed
659
      return new ElInfo1d(this);
660
661
      break;
    case 2:
Thomas Witkowski's avatar
Thomas Witkowski committed
662
      return new ElInfo2d(this);
663
664
      break;
    case 3:
Thomas Witkowski's avatar
Thomas Witkowski committed
665
      return new ElInfo3d(this);
666
667
      break;
    default:
668
      ERROR_EXIT("invalid dim [%d]\n",dim);
669
      return NULL;
670
    }
671
672
  }

673

674
675
  bool Mesh::findElInfoAtPoint(const WorldVector<double>& xy,
			       ElInfo *el_info,
676
677
			       DimVec<double>& bary,
			       const MacroElement *start_mel,
678
			       const WorldVector<double> *xy0,
679
			       double *sp)
680
681
682
  {
    static const MacroElement *mel = NULL;
    DimVec<double> lambda(dim, NO_INIT);
Thomas Witkowski's avatar
Thomas Witkowski committed
683
    ElInfo *mel_info = createNewElInfo();
684
685
686
687

    if (start_mel != NULL)
      mel = start_mel;
    else
Thomas Witkowski's avatar
Thomas Witkowski committed
688
      if (mel == NULL || mel->getElement()->getMesh() != this)
689
690
691
	mel = *(macroElements.begin());

    mel_info->setFillFlag(Mesh::FILL_COORDS);
692
    g_xy = &xy;
693
    g_xy0 = xy0;
694
    g_sp = sp;
695
696
697

    mel_info->fillMacroInfo(mel);

698
699
700
701
702
    // We have the care about not to visite a macro element twice. In this case the
    // function would end up in an infinite loop. If a macro element is visited a 
    // second time, what can happen with periodic boundary conditions, the point is
    // not within the mesh!
    std::set<int> macrosVisited;
703
704
705
    std::stack<MacroElement*> active;
    
//     macrosVisited.insert(mel->getIndex());
706

707
    int k;
708
    while ((k = mel_info->worldToCoord(xy, &lambda)) >= 0) {
709
      macrosVisited.insert(mel->getIndex());
710
      if (mel->getNeighbour(k) && !macrosVisited.count(mel->getNeighbour(k)->getIndex())) {
711
	mel = mel->getNeighbour(k);
712
713
// 	if (macrosVisited.count(mel->getIndex())) // Nur für periodische RB interessant, muss noch implementiert werden
// 	  return false;
714

715
716
	mel_info->fillMacroInfo(mel);
	continue;
717
718
      } else {
	for (int i = 0; i < dim + 1; ++i) {
719
	  if (i !=  k && mel->getNeighbour(i) && !macrosVisited.count(mel->getNeighbour(i)->getIndex()))
720
721
722
723
	    active.push(mel->getNeighbour(i));    
	}
	if (active.empty())
	  return false;
724
725
	mel = active.top();
	active.pop();
726
727

	mel_info->fillMacroInfo(mel);
728
729
730
731
      }
    }

    /* now, descend in tree to find leaf element at point */
732
    bool inside = findElementAtPointRecursive(mel_info, lambda, k, el_info);
733
734
    for (int i = 0; i <= dim; i++)
      bary[i] = final_lambda[i];   
735
  
Thomas Witkowski's avatar
Thomas Witkowski committed
736
    delete mel_info;
737

738
    return inside;
739
740
  }

741

742
  bool Mesh::findElementAtPoint(const WorldVector<double>&  xy,
743
744
				Element **elp, 
				DimVec<double>& bary,
745
				const MacroElement *start_mel,
746
747
				const WorldVector<double> *xy0,
				double *sp)
748
  {
749
750
    ElInfo *el_info = createNewElInfo();
    int val = findElInfoAtPoint(xy, el_info, bary, start_mel, xy0, sp);
751
752
753

    *elp = el_info->getElement();

Thomas Witkowski's avatar
Thomas Witkowski committed
754
    delete el_info;
755

756
    return val;
757
758
  }

759

760
  bool Mesh::findElementAtPointRecursive(ElInfo *el_info,
761
					 const DimVec<double>& lambda,
762
					 int outside,
763
764
					 ElInfo* final_el_info)
  {
765
    FUNCNAME("Mesh::findElementAtPointRecursive()");
Thomas Witkowski's avatar
Thomas Witkowski committed
766

767
768
    Element *el = el_info->getElement();
    DimVec<double> c_lambda(dim, NO_INIT);
769
770
    int inside;
    int ichild, c_outside;
771
772
773
774

    if (el->isLeaf()) {
      *final_el_info = *el_info;
      if (outside < 0) {
Thomas Witkowski's avatar
Thomas Witkowski committed
775
	for (int i = 0; i <= dim; i++)
776
	  final_lambda[i] = lambda[i];
Thomas Witkowski's avatar
Thomas Witkowski committed
777
	
778
	return true;
779
780
781
782
      }  else {  /* outside */
	if (g_xy0) { /* find boundary point of [xy0, xy] */
	  el_info->worldToCoord(*(g_xy0), &c_lambda);
	  double s = lambda[outside] / (lambda[outside] - c_lambda[outside]);
Thomas Witkowski's avatar
Thomas Witkowski committed
783
784
785
786
	  for (int i = 0; i <= dim; i++) 
	    final_lambda[i] = s * c_lambda[i] + (1.0 - s) * lambda[i];
	  
	  if (g_sp)
787
	    *(g_sp) = s;
Thomas Witkowski's avatar
Thomas Witkowski committed
788
	  
789
	  if (dim == 3) 
790
	    MSG("Outside finest level on el %d: s = %.3e\n", el->getIndex(), s);
791

792
	  return false;  /* ??? */
793
	} else {
794
	  return false;
795
	}
796
      }
797
798
    }

799
    ElInfo *c_el_info = createNewElInfo();
800

801
    if (dim == 1) {
802
803
804
805
      if (lambda[0] >= lambda[1]) {
	c_el_info->fillElInfo(0, el_info);
	if (outside >= 0) {
	  outside = el_info->worldToCoord(*(g_xy), &c_lambda);
Thomas Witkowski's avatar
Thomas Witkowski committed
806
	  TEST_EXIT(outside == 0)("point outside domain\n");
807
808
809
810
811
812
813
814
	} else {
	  c_lambda[0] = lambda[0] - lambda[1];
	  c_lambda[1] = 2.0 * lambda[1];
	}
      } else {
	c_el_info->fillElInfo(1, el_info);
	if (outside >= 0)  {
	  outside = el_info->worldToCoord(*(g_xy), &c_lambda);
Thomas Witkowski's avatar
Thomas Witkowski committed
815
	  TEST_EXIT(outside == 0)("point outside domain\n");
816
817
818
819
820
821
822
	} else {
	  c_lambda[1] = lambda[1] - lambda[0];
	  c_lambda[0] = 2.0 * lambda[0];
	}
      }
    } /* DIM == 1 */

823
    if (dim == 2) {
824
825
826
827
      if (lambda[0] >= lambda[1]) {
	c_el_info->fillElInfo(0, el_info);
	if (el->isNewCoordSet()) {
	  outside = c_el_info->worldToCoord(*(g_xy), &c_lambda);
Thomas Witkowski's avatar
Thomas Witkowski committed
828
	  TEST_EXIT(outside == 0)("outside curved boundary child 0\n");	  
829
830
831
832
833
834
835
836
837
	} else {
	  c_lambda[0] = lambda[2];
	  c_lambda[1] = lambda[0] - lambda[1];
	  c_lambda[2] = 2.0 * lambda[1];
	}
      } else {
	c_el_info->fillElInfo(1, el_info);
	if (el->isNewCoordSet()) {
	  outside = c_el_info->worldToCoord(*(g_xy), &c_lambda);
Thomas Witkowski's avatar
Thomas Witkowski committed
838
	  TEST_EXIT(outside == 0)("outside curved boundary child 1\n");	  
839
840
841
842
843
844
845
846
	} else {
	  c_lambda[0] = lambda[1] - lambda[0];
	  c_lambda[1] = lambda[2];
	  c_lambda[