Mesh.cc 41.2 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
    if (macroFileInfo != NULL)
      delete macroFileInfo;    
    if (elementPrototype)
      delete elementPrototype;    
    if (elementDataPrototype)
141
      delete elementDataPrototype;        
142
  }
143

144

145
  Mesh& Mesh::operator=(const Mesh& m)
146
  {
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
    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;
165
166
    nDofEl = m.nDofEl;
    nDof = m.nDof;
167
168
169
170
171
172
173
174
175
    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
176
      admin[i] = new DOFAdmin(this);
177
      *(admin[i]) = *(m.admin[i]);
178
179
      admin[i]->setMesh(this);
    }
180

181

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

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

    int insertCounter = 0;
193

194
195
    macroElements.clear();

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

201
      // Create new MacroElement.
Thomas Witkowski's avatar
Thomas Witkowski committed
202
      MacroElement *el = new MacroElement(dim);
203

204
205
206
207
208
209
210
211
212
213
      // 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.
214
      mapIndex.insert(pair<int, int>(el->getIndex(), insertCounter));
215
216
217
218
219
    }

    // Now we have to go through all the new MacroElements, and update the neighbour
    // connections.
    insertCounter = 0;
220
    for (deque<MacroElement*>::const_iterator it = m.macroElements.begin();
221
222
223
224
225
226
227
228
229
	 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.
230
	if((*it)->getNeighbour(i)!=NULL) {
231
232
233
	macroElements[insertCounter]->
	  setNeighbour(i, macroElements[mapIndex[(*it)->getNeighbour(i)->getIndex()]]);
      }
234
      }
235
236
237
238
239
240
241
242
243
244
245
246
247
248
    }

    // 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;
  }

249

250
251
252
253
254
255
256
257
258
259
260
261
  void Mesh::updateNumberOfLeaves()
  {
    nLeaves = 0;

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

262

263
264
265
266
267
268
  void Mesh::addMacroElement(MacroElement* me) 
  {
    macroElements.push_back(me); 
    me->setIndex(macroElements.size());
  }

269

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

275
276
    typedef map<const DegreeOfFreedom*, std::set<MacroElement*> > DofElMap;
    typedef map<const DegreeOfFreedom*, GeoIndex> DofPosMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
277

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

280
281
282
283
    // 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);
284
285

    
286
287
    // === Determine to all DOFs in mesh the macro elements where the DOF  ===
    // === is part of.                                                     ===
288

289
290
    // 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
291
292
    DofElMap dofsOwner;
    DofPosMap dofsPosIndex;
293

294
295
296
297
298
    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
299
      do {
300
301
	dofsOwner[elDofIter.getBaseDof()].insert(elInfo->getMacroElement());
	dofsPosIndex[elDofIter.getBaseDof()] = elDofIter.getPosIndex();
Thomas Witkowski's avatar
Thomas Witkowski committed
302
      } while (elDofIter.nextStrict());
303
304
305
306

      elInfo = stack.traverseNext(elInfo);
    }		   

Thomas Witkowski's avatar
Thomas Witkowski committed
307

308
309
    // === Remove macro elements from mesh macro element list. ===

310
    // Removing arbitrary elements from an deque is very slow. Therefore, we
311
312
313
    // 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.

314
315
    deque<MacroElement*> newMacroElements;
    for (deque<MacroElement*>::iterator elIter = macroElements.begin();
316
	 elIter != macroElements.end(); ++elIter) {
317
318
319
      // 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.
320
      if (delMacros.find(*elIter) == delMacros.end())
321
	newMacroElements.push_back(*elIter);     
322
    }
323

324
325
326
327
    // And replace the macro element list with the new one.
    macroElements.clear();
    macroElements = newMacroElements;

Thomas Witkowski's avatar
Thomas Witkowski committed
328

329
330
331
    // === 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.           ===
332
    
333
334
    for (std::set<MacroElement*>::iterator macroIt = delMacros.begin();
	 macroIt != delMacros.end(); ++macroIt) {
Thomas Witkowski's avatar
Thomas Witkowski committed
335

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

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

350
351
	mel->child[0] = NULL;
	mel->child[1] = NULL;
352

353
	mel->setElementData(elementDataPrototype->clone()); 
354
      }
355

356
      mel->delDofPtr();
357
    }     
358
359


360
361
    // === Check now all the DOFs that have no owner anymore and therefore  ===
    // === have to be removed.                                              ===
362

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

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

      if (deleteDof)
378
	freeDof(const_cast<DegreeOfFreedom*>(dofsIt->first), 
379
		dofsPosIndex[dofsIt->first]);      
380
381
    }

382

383
    // === Update number of elements, vertices, etc. ===
384

385
386
387
388
389
390
391
392
    nLeaves = 0;
    nElements = 0;

    std::set<const DegreeOfFreedom*> allVertices;

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

394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
      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.                               ===
410
  }
411

412

413
414
415
416
417
418
  void Mesh::addDOFAdmin(DOFAdmin *localAdmin)
  {    
    FUNCNAME("Mesh::addDOFAdmin()");

    localAdmin->setMesh(this);

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

    admin.push_back(localAdmin);

425
    nDofEl = 0;
426

427
    localAdmin->setNumberOfPreDofs(VERTEX, nDof[VERTEX]);
428
429
    nDof[VERTEX] += localAdmin->getNumberOfDofs(VERTEX);
    nDofEl += getGeo(VERTEX) * nDof[VERTEX];
430

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

437
438
    localAdmin->setNumberOfPreDofs(CENTER, nDof[CENTER]);
    nDof[CENTER] += localAdmin->getNumberOfDofs(CENTER);
439
    nDofEl += nDof[CENTER];
440

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

443
444
    node[VERTEX] = 0;
    nNodeEl = getGeo(VERTEX);
445

446
447
    if (dim > 1) {
      node[EDGE] = nNodeEl;
448
      if (nDof[EDGE] > 0) 
449
	nNodeEl += getGeo(EDGE);
450
451
    }

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

461
    node[CENTER] = nNodeEl;
462
    if (nDof[CENTER] > 0)
463
      nNodeEl += 1;
464
465
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
466

467
468
  void Mesh::dofCompress()
  {
469
    FUNCNAME_DBG("Mesh::dofCompress()");
470

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

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

482
      vector<int> newDofIndex(size);     
483
      compressAdmin->compress(newDofIndex);
Thomas Witkowski's avatar
Thomas Witkowski committed
484
485
486
487

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

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


504
  DegreeOfFreedom *Mesh::getDof(GeoIndex position)
505
  {
506
    FUNCNAME_DBG("Mesh::getDof()");
507

508
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
509
      ("unknown position %d\n", position);
510

511
    int ndof = getNumberOfDofs(position);
512
    if (ndof <= 0) 
513
      return NULL;
514

515
    DegreeOfFreedom *dof = new DegreeOfFreedom[ndof];
516

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


Thomas Witkowski's avatar
Thomas Witkowski committed
535
  DegreeOfFreedom **Mesh::createDofPtrs()
536
537
  {
    if (nNodeEl <= 0)
538
      return NULL;
539

540
    DegreeOfFreedom **ptrs = new DegreeOfFreedom*[nNodeEl];
541
    for (int i = 0; i < nNodeEl; i++)
542
543
      ptrs[i] = NULL;

544
    return ptrs;
545
546
  }

547

548
  void Mesh::freeDofPtrs(DegreeOfFreedom **ptrs)
549
  {
550
    FUNCNAME_DBG("Mesh::freeDofPtrs()");
551

552
    TEST_EXIT_DBG(ptrs)("ptrs is NULL!\n");
553
554
555
556

    if (nNodeEl <= 0)
      return;
  
557
    delete [] ptrs;
558
559
560
  }


561
  const DOFAdmin *Mesh::createDOFAdmin(string lname, DimVec<int> lnDof)
562
  {    
Thomas Witkowski's avatar
Thomas Witkowski committed
563
    DOFAdmin *localAdmin = new DOFAdmin(this, lname);
564

Thomas Witkowski's avatar
Thomas Witkowski committed
565
    for (int i = 0; i < dim + 1; i++)
566
      localAdmin->setNumberOfDofs(i, lnDof[i]);
567
568
569

    addDOFAdmin(localAdmin);

570
    return localAdmin;
571
572
573
574
575
576
577
  }


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

Thomas Witkowski's avatar
Thomas Witkowski committed
578
    for (unsigned int i = 0; i < admin.size(); i++) {
579
      if (admin[i]->getNumberOfDofs(VERTEX)) {
580
581
582
583
	if (!localAdmin)  
	  localAdmin = admin[i];
	else if (admin[i]->getSize() < localAdmin->getSize())
	  localAdmin = admin[i];
584
      }
585
586
    }

587
    return localAdmin;
588
589
  }

590

591
  void Mesh::freeDof(DegreeOfFreedom* dof, GeoIndex position)
592
  {
593
    FUNCNAME_DBG("Mesh::freeDof()");
594

595
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
596
      ("unknown position %d\n", position);
597

598
599
    if (nDof[position]) {
      TEST_EXIT_DBG(dof != NULL)("dof = NULL, but ndof = %d\n", nDof[position]);
600
    } else  {
601
      TEST_EXIT_DBG(dof == NULL)("dof != NULL, but ndof = 0\n");
602
    }
603

604
605
    TEST_EXIT_DBG(nDof[position] <= MAX_DOF)
      ("ndof too big: ndof = %d, MAX_DOF = %d\n", nDof[position], MAX_DOF);
606

607
    for (unsigned int i = 0; i < admin.size(); i++) {
608
609
      int n = admin[i]->getNumberOfDofs(position);
      int n0 = admin[i]->getNumberOfPreDofs(position);
610
      
611
612
      TEST_EXIT_DBG(n + n0 <= nDof[position])
	("n = %d, n0 = %d too large: ndof = %d\n", n, n0, nDof[position]);
613
614
      
      for (int j = 0; j < n; j++)
615
	admin[i]->freeDofIndex(dof[n0 + j]);      
616
    }
617

618
    delete [] dof;
619
620
  }

621

622
623
  void Mesh::freeElement(Element* el)
  {
624
    freeDofPtrs(const_cast<DegreeOfFreedom**>(el->getDof()));
Thomas Witkowski's avatar
Thomas Witkowski committed
625
    delete el;
626
627
628
629
630
  }


  Element* Mesh::createNewElement(Element *parent)
  {
631
    FUNCNAME_DBG("Mesh::createNewElement()");
632
633

    TEST_EXIT_DBG(elementPrototype)("no element prototype\n");
634
635

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

Thomas Witkowski's avatar
Thomas Witkowski committed
637
    if (!parent && elementDataPrototype)
638
      el->setElementData(elementDataPrototype->clone()); 
Thomas Witkowski's avatar
Thomas Witkowski committed
639
    else
640
      el->setElementData(NULL); // must be done in ElementData::refineElementData()
641

642
643
644
    return el;
  }

645

646
647
  ElInfo* Mesh::createNewElInfo()
  {
648
649
    FUNCNAME("Mesh::createNewElInfo()");

650
    switch (dim) {
651
    case 1:
Thomas Witkowski's avatar
Thomas Witkowski committed
652
      return new ElInfo1d(this);
653
654
      break;
    case 2:
Thomas Witkowski's avatar
Thomas Witkowski committed
655
      return new ElInfo2d(this);
656
657
      break;
    case 3:
Thomas Witkowski's avatar
Thomas Witkowski committed
658
      return new ElInfo3d(this);
659
660
      break;
    default:
661
      ERROR_EXIT("invalid dim [%d]\n",dim);
662
      return NULL;
663
    }
664
665
  }

666

667
668
  bool Mesh::findElInfoAtPoint(const WorldVector<double>& xy,
			       ElInfo *el_info,
669
670
			       DimVec<double>& bary,
			       const MacroElement *start_mel,
671
			       const WorldVector<double> *xy0,
672
			       double *sp)
673
674
675
  {
    static const MacroElement *mel = NULL;
    DimVec<double> lambda(dim, NO_INIT);
Thomas Witkowski's avatar
Thomas Witkowski committed
676
    ElInfo *mel_info = createNewElInfo();
677
678
679
680

    if (start_mel != NULL)
      mel = start_mel;
    else
Thomas Witkowski's avatar
Thomas Witkowski committed
681
      if (mel == NULL || mel->getElement()->getMesh() != this)
682
683
684
	mel = *(macroElements.begin());

    mel_info->setFillFlag(Mesh::FILL_COORDS);
685
    g_xy = &xy;
686
    g_xy0 = xy0;
687
    g_sp = sp;
688
689
690

    mel_info->fillMacroInfo(mel);

691
692
693
694
695
    // 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;
696
697
698
    std::stack<MacroElement*> active;
    
//     macrosVisited.insert(mel->getIndex());
699

700
    int k;
701
    while ((k = mel_info->worldToCoord(xy, &lambda)) >= 0) {
702
      macrosVisited.insert(mel->getIndex());
703
      if (mel->getNeighbour(k) && !macrosVisited.count(mel->getNeighbour(k)->getIndex())) {
704
	mel = mel->getNeighbour(k);
705
706
// 	if (macrosVisited.count(mel->getIndex())) // Nur für periodische RB interessant, muss noch implementiert werden
// 	  return false;
707

708
709
	mel_info->fillMacroInfo(mel);
	continue;
710
711
      } else {
	for (int i = 0; i < dim + 1; ++i) {
712
	  if (i !=  k && mel->getNeighbour(i) && !macrosVisited.count(mel->getNeighbour(i)->getIndex()))
713
714
	    active.push(mel->getNeighbour(i));    
	}
715
716
	if (active.empty()) {
	  delete mel_info;
717
	  return false;
718
	}
719
720
	mel = active.top();
	active.pop();
721
722

	mel_info->fillMacroInfo(mel);
723
724
725
726
      }
    }

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

733
    return inside;
734
735
  }

736

737
  bool Mesh::findElementAtPoint(const WorldVector<double>&  xy,
738
739
				Element **elp, 
				DimVec<double>& bary,
740
				const MacroElement *start_mel,
741
742
				const WorldVector<double> *xy0,
				double *sp)
743
  {
744
745
    ElInfo *el_info = createNewElInfo();
    int val = findElInfoAtPoint(xy, el_info, bary, start_mel, xy0, sp);
746
747
748

    *elp = el_info->getElement();

Thomas Witkowski's avatar
Thomas Witkowski committed
749
    delete el_info;
750

751
    return val;
752
753
  }

754

755
  bool Mesh::findElementAtPointRecursive(ElInfo *el_info,
756
					 const DimVec<double>& lambda,
757
					 int outside,
758
759
					 ElInfo* final_el_info)
  {
760
    FUNCNAME("Mesh::findElementAtPointRecursive()");
Thomas Witkowski's avatar
Thomas Witkowski committed
761

762
763
    Element *el = el_info->getElement();
    DimVec<double> c_lambda(dim, NO_INIT);
764
765
    int inside;
    int ichild, c_outside;
766
767
768
769

    if (el->isLeaf()) {
      *final_el_info = *el_info;
      if (outside < 0) {
Thomas Witkowski's avatar
Thomas Witkowski committed
770
	for (int i = 0; i <= dim; i++)
771
	  final_lambda[i] = lambda[i];
Thomas Witkowski's avatar
Thomas Witkowski committed
772
	
773
	return true;
774
775
776
777
      }  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
778
779
780
781
	  for (int i = 0; i <= dim; i++) 
	    final_lambda[i] = s * c_lambda[i] + (1.0 - s) * lambda[i];
	  
	  if (g_sp)
782
	    *(g_sp) = s;
Thomas Witkowski's avatar
Thomas Witkowski committed
783
	  
784
	  if (dim == 3) 
785
	    MSG("Outside finest level on el %d: s = %.3e\n", el->getIndex(), s);
786

787
	  return false;  /* ??? */
788
	} else {
789
	  return false;
790
	}
791
      }
792
793
    }

794
    ElInfo *c_el_info = createNewElInfo();
795

796
    if (dim == 1) {
797
798
799
800
      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
801
	  TEST_EXIT(outside == 0)("point outside domain\n");
802
803
804
805
806
807
808
809
	} 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
810
	  TEST_EXIT(outside == 0)("point outside domain\n");
811
812
813
814
815
816
817
	} else {
	  c_lambda[1] = lambda[1] - lambda[0];
	  c_lambda[0] = 2.0 * lambda[0];
	}
      }
    } /* DIM == 1 */

818
    if (dim == 2) {
819
820
821
822
      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
823
	  TEST_EXIT(outside == 0)("outside curved boundary child 0\n");	  
824
825
826
827
828
829
830
831
832
	} 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
833
	  TEST_EXIT(outside == 0)("outside curved boundary child 1\n");	  
834
835
836
837
838
839
840
841
	} else {
	  c_lambda[0] = lambda[1] - lambda[0];
	  c_lambda[1] = lambda[2];
	  c_lambda[2] = 2.0 * lambda[0];
	}
      }
    } /* DIM == 2 */

842
    if (dim == 3) {
843
844
845
846
847
848
849
850