Mesh.cc 41.1 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
20
21
22
#include "io/MacroReader.h"
#include "io/MacroInfo.h"
#include "io/MacroWriter.h"

23
24
25
26
#include "AdaptStationary.h"
#include "AdaptInstationary.h"
#include "FiniteElemSpace.h"
#include "ElementData.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
27
#include "ElementDofIterator.h"
28
29
30
#include "MacroElement.h"
#include "Mesh.h"
#include "Traverse.h"
31
#include "Initfile.h"
32
33
34
35
36
37
#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
38
#include "ElInfoStack.h"
39
#include "Serializer.h"
40
#include "Lagrange.h"
41
42
43
44
45
46
47
48
49

namespace AMDiS {

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

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

50
51
52
53
54
55
56
57
58
59
60
61
62
63
  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);
64
65
66
67
68
69
70
71
72
73
74

  //**************************************************************************
  //  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;
75
76
  const Flag Mesh::CALL_MG_LEVEL           = 0X4000L;  
  const Flag Mesh::CALL_REVERSE_MODE       = 0X8000L;
77
78


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

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

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

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

    elementPrototype->setIndex(-1);

127
128
    elementIndex = 0;
  }
129

130

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

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

146

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

183

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

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

    int insertCounter = 0;
195

196
197
    macroElements.clear();

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

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

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

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

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

251

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

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

264

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

271

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

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

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

282
283
284
285
286
287
288
289
290
291
292
293

    // === 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 = feSpaces[0];
    for (unsigned int i = 1; i < feSpaces.size(); i++)
      if (feSpaces[i]->getBasisFcts()->getDegree() >
	  feSpace->getBasisFcts()->getDegree())
	feSpace = feSpaces[i];

    
294
295
    // === Determine to all DOFs in mesh the macro elements where the DOF  ===
    // === is part of.                                                     ===
296

297
298
    // 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
299
300
    DofElMap dofsOwner;
    DofPosMap dofsPosIndex;
301

302
303
304
305
306
    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
307
      do {
308
309
	dofsOwner[elDofIter.getStartDof()].insert(elInfo->getMacroElement());
	dofsPosIndex[elDofIter.getStartDof()] = elDofIter.getPosIndex();
Thomas Witkowski's avatar
Thomas Witkowski committed
310
      } while (elDofIter.nextStrict());
311
312
313
314

      elInfo = stack.traverseNext(elInfo);
    }		   

Thomas Witkowski's avatar
Thomas Witkowski committed
315

316
317
    // === Remove macro elements from mesh macro element list. ===

318
    // Removing arbitrary elements from an deque is very slow. Therefore, we
319
320
321
    // 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.

322
323
    deque<MacroElement*> newMacroElements;
    for (deque<MacroElement*>::iterator elIter = macroElements.begin();
324
325
326
327
328
	 elIter != macroElements.end(); ++elIter) {
      // 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.
      if (macros.find(*elIter) == macros.end())
329
	newMacroElements.push_back(*elIter);     
330
    }
331

332
333
334
335
    // And replace the macro element list with the new one.
    macroElements.clear();
    macroElements = newMacroElements;

Thomas Witkowski's avatar
Thomas Witkowski committed
336

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

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

352
353
354
355
      // Delete element hierarchie
      if (!(*macroIt)->getElement()->isLeaf()) {
	delete (*macroIt)->getElement()->getChild(0);
	delete (*macroIt)->getElement()->getChild(1);
356
357
358
359
360

	(*macroIt)->getElement()->child[0] = NULL;
	(*macroIt)->getElement()->child[1] = NULL;

	(*macroIt)->getElement()->setElementData(elementDataPrototype->clone()); 
361
      }
362
363
364

      // We will delete at least some element DOFs in the next but will keep the
      // element object still in memory. Therefore the DOF pointer must be set to be
365
      // invalid.
366
      (*macroIt)->getElement()->setDofValid(false);
367
    }     
368
369


370
371
    // === Check now all the DOFs that have no owner anymore and therefore have ===
    // === to be removed.                                                       ===
372

Thomas Witkowski's avatar
Thomas Witkowski committed
373
    for (DofElMap::iterator dofsIt = dofsOwner.begin(); 
374
375
376
377
378
379
380
381
382
383
384
385
386
387
	 dofsIt != dofsOwner.end(); ++dofsIt) {
      
      bool deleteDof = true;

      for (std::set<MacroElement*>::iterator elIter = dofsIt->second.begin();
	   elIter != dofsIt->second.end(); ++elIter) {
	std::set<MacroElement*>::iterator mIt = macros.find(*elIter);
	if (mIt == macros.end()) {
	  deleteDof = false;
	  break;
	}
      }

      if (deleteDof)
388
	freeDof(const_cast<DegreeOfFreedom*>(dofsIt->first), 
389
		dofsPosIndex[dofsIt->first]);      
390
391
    }

392

393
    // === Update number of elements, vertices, etc. ===
394

395
396
397
398
399
400
401
402
    nLeaves = 0;
    nElements = 0;

    std::set<const DegreeOfFreedom*> allVertices;

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

404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
      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.                               ===
420
  }
421

422

423
424
425
426
427
428
  void Mesh::addDOFAdmin(DOFAdmin *localAdmin)
  {    
    FUNCNAME("Mesh::addDOFAdmin()");

    localAdmin->setMesh(this);

429
    TEST_EXIT(find(admin.begin(), admin.end(), localAdmin) == admin.end())
Thomas Witkowski's avatar
Thomas Witkowski committed
430
431
      ("admin %s is already associated to mesh %s\n",
       localAdmin->getName().c_str(), this->getName().c_str());
432
433
434

    admin.push_back(localAdmin);

435
    nDofEl = 0;
436

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

441
    if (dim > 1) {
442
      localAdmin->setNumberOfPreDofs(EDGE, nDof[EDGE]);
443
444
      nDof[EDGE] += localAdmin->getNumberOfDofs(EDGE);
      nDofEl += getGeo(EDGE) * nDof[EDGE];
445
446
    }

447
448
    localAdmin->setNumberOfPreDofs(CENTER, nDof[CENTER]);
    nDof[CENTER] += localAdmin->getNumberOfDofs(CENTER);
449
    nDofEl += nDof[CENTER];
450

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

453
454
    node[VERTEX] = 0;
    nNodeEl = getGeo(VERTEX);
455

456
457
    if (dim > 1) {
      node[EDGE] = nNodeEl;
458
      if (nDof[EDGE] > 0) 
459
	nNodeEl += getGeo(EDGE);
460
461
    }

462
    if (dim == 3) {
463
      localAdmin->setNumberOfPreDofs(FACE, nDof[FACE]);
464
465
      nDof[FACE] += localAdmin->getNumberOfDofs(FACE);
      nDofEl += getGeo(FACE) * nDof[FACE];
466
      node[FACE] = nNodeEl;
467
      if (nDof[FACE] > 0) 
468
	nNodeEl += getGeo(FACE);
469
470
    }

471
    node[CENTER] = nNodeEl;
472
    if (nDof[CENTER] > 0)
473
      nNodeEl += 1;
474
475
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
476

477
478
  void Mesh::dofCompress()
  {
479
    FUNCNAME("Mesh::dofCompress()");
480

Thomas Witkowski's avatar
Thomas Witkowski committed
481
482
    for (unsigned int iadmin = 0; iadmin < admin.size(); iadmin++) {
      DOFAdmin* compressAdmin = admin[iadmin];
483
484

      TEST_EXIT_DBG(compressAdmin)("no admin[%d] in mesh\n", iadmin);
485
      
Thomas Witkowski's avatar
Thomas Witkowski committed
486
      int size = compressAdmin->getSize();
Thomas Witkowski's avatar
Thomas Witkowski committed
487
      if (size < 1 || 
488
	  compressAdmin->getUsedDofs() < 1 || 
Thomas Witkowski's avatar
Thomas Witkowski committed
489
	  compressAdmin->getHoleCount() < 1)    
490
	continue;
Thomas Witkowski's avatar
Thomas Witkowski committed
491

492
      vector<int> newDofIndex(size);     
493
      compressAdmin->compress(newDofIndex);
Thomas Witkowski's avatar
Thomas Witkowski committed
494
495
496
497

      Flag fill_flag = (preserveCoarseDOFs ?  
			Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NOTHING :
			Mesh::CALL_LEAF_EL | Mesh::FILL_NOTHING);          
498
499
500
      TraverseStack stack;
      ElInfo *elInfo = stack.traverseFirst(this, -1, fill_flag);
      while (elInfo) {
501
	elInfo->getElement()->newDofFct1(compressAdmin, newDofIndex);
502
503
504
505
506
	elInfo = stack.traverseNext(elInfo);
      }

      elInfo = stack.traverseFirst(this, -1, fill_flag);
      while (elInfo) {
507
	elInfo->getElement()->newDofFct2(compressAdmin);
508
509
	elInfo = stack.traverseNext(elInfo);
      }
510
    }       
511
512
513
  }


514
  DegreeOfFreedom *Mesh::getDof(GeoIndex position)
515
  {
516
    FUNCNAME("Mesh::getDof()");
517

518
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
519
      ("unknown position %d\n", position);
520

521
    int ndof = getNumberOfDofs(position);
522
    if (ndof <= 0) 
523
      return NULL;
524

525
    DegreeOfFreedom *dof = new DegreeOfFreedom[ndof];
526

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


Thomas Witkowski's avatar
Thomas Witkowski committed
544
  DegreeOfFreedom **Mesh::createDofPtrs()
545
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
546
    FUNCNAME("Mesh::createDofPtrs()");
547
548

    if (nNodeEl <= 0)
549
      return NULL;
550

551
    DegreeOfFreedom **ptrs = new DegreeOfFreedom*[nNodeEl];
552
    for (int i = 0; i < nNodeEl; i++)
553
554
      ptrs[i] = NULL;

555
    return ptrs;
556
557
  }

558

559
  void Mesh::freeDofPtrs(DegreeOfFreedom **ptrs)
560
  {
561
    FUNCNAME("Mesh::freeDofPtrs()");
562

563
    TEST_EXIT_DBG(ptrs)("ptrs is NULL!\n");
564
565
566
567

    if (nNodeEl <= 0)
      return;
  
568
    delete [] ptrs;
569
570
571
  }


572
  const DOFAdmin *Mesh::createDOFAdmin(string lname, DimVec<int> lnDof)
573
  {
574
    FUNCNAME("Mesh::createDOFAdmin()");
575
    
Thomas Witkowski's avatar
Thomas Witkowski committed
576
    DOFAdmin *localAdmin = new DOFAdmin(this, lname);
577

Thomas Witkowski's avatar
Thomas Witkowski committed
578
    for (int i = 0; i < dim + 1; i++)
579
      localAdmin->setNumberOfDofs(i, lnDof[i]);
580
581
582

    addDOFAdmin(localAdmin);

583
    return localAdmin;
584
585
586
587
588
589
590
  }


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

Thomas Witkowski's avatar
Thomas Witkowski committed
591
    for (unsigned int i = 0; i < admin.size(); i++) {
592
      if (admin[i]->getNumberOfDofs(VERTEX)) {
593
594
595
596
	if (!localAdmin)  
	  localAdmin = admin[i];
	else if (admin[i]->getSize() < localAdmin->getSize())
	  localAdmin = admin[i];
597
      }
598
599
    }

600
    return localAdmin;
601
602
  }

603

604
  void Mesh::freeDof(DegreeOfFreedom* dof, GeoIndex position)
605
  {
606
    FUNCNAME("Mesh::freeDof()");
607

608
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
609
      ("unknown position %d\n", position);
610

611
    int ndof = nDof[position];
612
613
    if (ndof) {
      if (!dof) {
614
	MSG("dof = NULL, but ndof = %d\n", ndof);
615
616
	return;
      }
617
    } else  {
618
619
620
      if (dof)
	MSG("dof != NULL, but ndof = 0\n");

621
622
      return;
    }
623

624
    TEST_EXIT_DBG(ndof <= MAX_DOF)
625
      ("ndof too big: ndof = %d, MAX_DOF = %d\n", ndof, MAX_DOF);
626

627
    for (unsigned int i = 0; i < admin.size(); i++) {
628
629
      int n = admin[i]->getNumberOfDofs(position);
      int n0 = admin[i]->getNumberOfPreDofs(position);
630
      
631
632
      TEST_EXIT_DBG(n + n0 <= ndof)
	("n = %d, n0 = %d too large: ndof = %d\n", n, n0, ndof);
633
634
      
      for (int j = 0; j < n; j++)
635
	admin[i]->freeDofIndex(dof[n0 + j]);      
636
    }
637

638
    delete [] dof;
639
    dof = NULL;
640
641
  }

642

643
644
  void Mesh::freeElement(Element* el)
  {
645
    freeDofPtrs(const_cast<DegreeOfFreedom**>(el->getDof()));
Thomas Witkowski's avatar
Thomas Witkowski committed
646
    delete el;
647
648
649
650
651
652
  }


  Element* Mesh::createNewElement(Element *parent)
  {
    FUNCNAME("Mesh::createNewElement()");
653
654

    TEST_EXIT_DBG(elementPrototype)("no element prototype\n");
655
656

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

Thomas Witkowski's avatar
Thomas Witkowski committed
658
    if (!parent && elementDataPrototype)
659
      el->setElementData(elementDataPrototype->clone()); 
Thomas Witkowski's avatar
Thomas Witkowski committed
660
    else
661
      el->setElementData(NULL); // must be done in ElementData::refineElementData()
662

663
664
665
    return el;
  }

666

667
668
  ElInfo* Mesh::createNewElInfo()
  {
669
670
    FUNCNAME("Mesh::createNewElInfo()");

671
    switch (dim) {
672
    case 1:
Thomas Witkowski's avatar
Thomas Witkowski committed
673
      return new ElInfo1d(this);
674
675
      break;
    case 2:
Thomas Witkowski's avatar
Thomas Witkowski committed
676
      return new ElInfo2d(this);
677
678
      break;
    case 3:
Thomas Witkowski's avatar
Thomas Witkowski committed
679
      return new ElInfo3d(this);
680
681
682
683
      break;
    default:
      ERROR_EXIT("invalid dim\n");
      return NULL;
684
    }
685
686
  }

687

688
689
  bool Mesh::findElInfoAtPoint(const WorldVector<double>& xy,
			       ElInfo *el_info,
690
691
			       DimVec<double>& bary,
			       const MacroElement *start_mel,
692
			       const WorldVector<double> *xy0,
693
			       double *sp)
694
695
696
  {
    static const MacroElement *mel = NULL;
    DimVec<double> lambda(dim, NO_INIT);
Thomas Witkowski's avatar
Thomas Witkowski committed
697
    ElInfo *mel_info = createNewElInfo();
698
699
700
701

    if (start_mel != NULL)
      mel = start_mel;
    else
Thomas Witkowski's avatar
Thomas Witkowski committed
702
      if (mel == NULL || mel->getElement()->getMesh() != this)
703
704
705
	mel = *(macroElements.begin());

    mel_info->setFillFlag(Mesh::FILL_COORDS);
706
    g_xy = &xy;
707
    g_xy0 = xy0;
708
    g_sp = sp;
709
710
711

    mel_info->fillMacroInfo(mel);

712
713
714
715
716
    // 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;
717
718
719
    std::stack<MacroElement*> active;
    
//     macrosVisited.insert(mel->getIndex());
720

721
    int k;
722
    while ((k = mel_info->worldToCoord(xy, &lambda)) >= 0) {
723
      macrosVisited.insert(mel->getIndex());
724
      if (mel->getNeighbour(k) && !macrosVisited.count(mel->getNeighbour(k)->getIndex())) {
725
	mel = mel->getNeighbour(k);
726
727
// 	if (macrosVisited.count(mel->getIndex())) // Nur für periodische RB interessant, muss noch implementiert werden
// 	  return false;
728

729
730
	mel_info->fillMacroInfo(mel);
	continue;
731
732
      } else {
	for (int i = 0; i < dim + 1; ++i) {
733
	  if (i !=  k && mel->getNeighbour(i) && !macrosVisited.count(mel->getNeighbour(i)->getIndex()))
734
735
736
737
	    active.push(mel->getNeighbour(i));    
	}
	if (active.empty())
	  return false;
738
739
	mel = active.top();
	active.pop();
740
741

	mel_info->fillMacroInfo(mel);
742
743
744
745
      }
    }

    /* now, descend in tree to find leaf element at point */
746
    bool inside = findElementAtPointRecursive(mel_info, lambda, k, el_info);
747
748
    for (int i = 0; i <= dim; i++)
      bary[i] = final_lambda[i];   
749
  
Thomas Witkowski's avatar
Thomas Witkowski committed
750
    delete mel_info;
751

752
    return inside;
753
754
  }

755

756
  bool Mesh::findElementAtPoint(const WorldVector<double>&  xy,
757
758
				Element **elp, 
				DimVec<double>& bary,
759
				const MacroElement *start_mel,
760
761
				const WorldVector<double> *xy0,
				double *sp)
762
  {
763
764
    ElInfo *el_info = createNewElInfo();
    int val = findElInfoAtPoint(xy, el_info, bary, start_mel, xy0, sp);
765
766
767

    *elp = el_info->getElement();

Thomas Witkowski's avatar
Thomas Witkowski committed
768
    delete el_info;
769

770
    return val;
771
772
  }

773

774
  bool Mesh::findElementAtPointRecursive(ElInfo *el_info,
775
					 const DimVec<double>& lambda,
776
					 int outside,
777
778
					 ElInfo* final_el_info)
  {
779
    FUNCNAME("Mesh::findElementAtPointRecursive()");
Thomas Witkowski's avatar
Thomas Witkowski committed
780

781
782
    Element *el = el_info->getElement();
    DimVec<double> c_lambda(dim, NO_INIT);
783
784
    int inside;
    int ichild, c_outside;
785
786
787
788

    if (el->isLeaf()) {
      *final_el_info = *el_info;
      if (outside < 0) {
Thomas Witkowski's avatar
Thomas Witkowski committed
789
	for (int i = 0; i <= dim; i++)
790
	  final_lambda[i] = lambda[i];
Thomas Witkowski's avatar
Thomas Witkowski committed
791
	
792
	return true;
793
794
795
796
      }  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
797
798
799
800
	  for (int i = 0; i <= dim; i++) 
	    final_lambda[i] = s * c_lambda[i] + (1.0 - s) * lambda[i];
	  
	  if (g_sp)
801
	    *(g_sp) = s;
Thomas Witkowski's avatar
Thomas Witkowski committed
802
	  
803
	  if (dim == 3) 
804
	    MSG("Outside finest level on el %d: s = %.3e\n", el->getIndex(), s);
805

806
	  return false;  /* ??? */
807
	} else {
808
	  return false;
809
	}
810
      }
811
812
    }

813
    ElInfo *c_el_info = createNewElInfo();
814

815
    if (dim == 1) {
816
817
818
819
      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
820
	  TEST_EXIT(outside == 0)("point outside domain\n");
821
822
823
824
825
826
827
828
	} 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
829
	  TEST_EXIT(outside == 0)("point outside domain\n");
830
831
832
833
834
835
836
	} else {
	  c_lambda[1] = lambda[1] - lambda[0];
	  c_lambda[0] = 2.0 * lambda[0];
	}
      }
    } /* DIM == 1 */

837
    if (dim == 2) {
838
839
840
841
      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
842
	  TEST_EXIT(outside == 0)("outside curved boundary child 0\n");	  
843
844
845
846
847
848
849
850
851
	} 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
852
	  TEST_EXIT(outside == 0)("outside curved boundary child 1\n");	  
853
854
855
856
857
858
859
860
	} else {
	  c_lambda[0] = lambda[1] - lambda[0];
	  c_lambda[1] = lambda[2];
	  c_lambda[2] = 2.0 * lambda[0];
	}
      }
    } /* DIM == 2 */

861
    if (dim == 3) {
862
863
864
865
866
867
868
869
870
871
872
873
874