Mesh.cc 43.1 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/******************************************************************************
 *
 * AMDiS - Adaptive multidimensional simulations
 *
 * Copyright (C) 2013 Dresden University of Technology. All Rights Reserved.
 * Web: https://fusionforge.zih.tu-dresden.de/projects/amdis
 *
 * Authors: 
 * Simon Vey, Thomas Witkowski, Andreas Naumann, Simon Praetorius, et al.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 *
 *
 * This file is part of AMDiS
 *
 * See also license.opensource.txt in the distribution.
 * 
 ******************************************************************************/
20
21


Thomas Witkowski's avatar
Thomas Witkowski committed
22
23
24
25
26
27
#include <algorithm>
#include <set>
#include <map>

#include "time.h"

28
#include "io/Reader.h"
29
30
31
32
#include "io/MacroReader.h"
#include "io/MacroInfo.h"
#include "io/MacroWriter.h"

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

52
using namespace std;
53

54
namespace AMDiS {
55
56
57
58
59

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

60
61
62
63
64
65
66
67
68
69
70
71
72
73
  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);
74
75
76
77
78
79
80
81
82
83
84

  //**************************************************************************
  //  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;
85
86
  const Flag Mesh::CALL_MG_LEVEL           = 0X4000L;  
  const Flag Mesh::CALL_REVERSE_MODE       = 0X8000L;
87
88


89
  vector<DegreeOfFreedom> Mesh::dof_used;
90
  const int Mesh::MAX_DOF = 100;
91
  map<pair<DegreeOfFreedom, int>, DegreeOfFreedom*> Mesh::serializedDOFs;
92

93
  Mesh::Mesh(string aName, int dimension) 
94
95
96
97
98
99
    : name(aName), 
      dim(dimension), 
      nVertices(0),
      nEdges(0),
      nLeaves(0), 
      nElements(0),
100
      parametric(nullptr), 
101
      preserveCoarseDOFs(false),
102
103
      nDofEl(0),
      nDof(dimension, DEFAULT_VALUE, 0),
104
105
      nNodeEl(0),
      node(dimension, DEFAULT_VALUE, 0),
106
107
      elementPrototype(nullptr),
      elementDataPrototype(nullptr),
108
109
      elementIndex(-1),
      initialized(false),
110
      macroFileInfo(nullptr),
111
      changeIndex(0),
112
113
      final_lambda(dimension, DEFAULT_VALUE, 0.0)
  {
114
    FUNCNAME("Mesh::Mesh()");
115

116
117
118
119
#ifdef HAVE_PARALLEL_DOMAIN_AMDIS
    nParallelPreRefinements = 0;
#endif

120
121
122
    // set default element prototype
    switch(dim) {
    case 1:
Thomas Witkowski's avatar
Thomas Witkowski committed
123
      elementPrototype = new Line(this);
124
125
      break;
    case 2:
Thomas Witkowski's avatar
Thomas Witkowski committed
126
      elementPrototype = new Triangle(this);
127
128
      break;
    case 3:
Thomas Witkowski's avatar
Thomas Witkowski committed
129
      elementPrototype = new Tetrahedron(this);
130
131
132
133
134
135
136
      break;
    default:
      ERROR_EXIT("invalid dimension\n");
    }

    elementPrototype->setIndex(-1);

137
138
    elementIndex = 0;
  }
139

140

141
  Mesh::~Mesh()
142
  {
143
    deleteMeshStructure();
144

145
    if (macroFileInfo != nullptr)
146
147
148
149
      delete macroFileInfo;    
    if (elementPrototype)
      delete elementPrototype;    
    if (elementDataPrototype)
150
      delete elementDataPrototype;        
151
  }
152

153

154
  Mesh& Mesh::operator=(const Mesh& m)
155
  {
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
    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;
171
    parametric = nullptr;
172
173

    preserveCoarseDOFs = m.preserveCoarseDOFs;
174
175
    nDofEl = m.nDofEl;
    nDof = m.nDof;
176
177
178
179
180
181
182
183
184
    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
185
      admin[i] = new DOFAdmin(this);
186
      *(admin[i]) = *(m.admin[i]);
187
188
      admin[i]->setMesh(this);
    }
189

190

191
    /* ====================== Copy macro elements =================== */
192
  
193
194
    // mapIndex[i] is the index of the MacroElement element in the vector
    // macroElements, for which holds: element->getIndex() = i    
195
    map<int, int> mapIndex;
196
197
198
199
200
201

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

    int insertCounter = 0;
202

203
204
    macroElements.clear();

205
206
    // Go through all MacroElements of mesh m, and create for every a new
    // MacroElement in this mesh.
207
    for (deque<MacroElement*>::const_iterator it = m.macroElements.begin();
208
	 it != m.macroElements.end(); ++it, insertCounter++) {
209

210
      // Create new MacroElement.
Thomas Witkowski's avatar
Thomas Witkowski committed
211
      MacroElement *el = new MacroElement(dim);
212

213
214
215
216
217
218
219
220
221
222
      // 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.
223
      mapIndex.insert(pair<int, int>(el->getIndex(), insertCounter));
224
225
226
227
228
    }

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

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

    /* ================== Things will be done when required ============ */
      
251
252
    TEST_EXIT(elementDataPrototype == nullptr)("TODO\n");
    TEST_EXIT(m.parametric == nullptr)("TODO\n");
253
254
255
256
257
    TEST_EXIT(periodicAssociations.size() == 0)("TODO\n");

    return *this;
  }

258

259
260
261
262
263
264
265
266
267
268
269
270
  void Mesh::updateNumberOfLeaves()
  {
    nLeaves = 0;

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

271

272
273
274
275
276
277
  void Mesh::addMacroElement(MacroElement* me) 
  {
    macroElements.push_back(me); 
    me->setIndex(macroElements.size());
  }

278
  
279
  void Mesh::removeMacroElements(std::set<MacroElement*>& delMacros,
280
				 vector<const FiniteElemSpace*>& feSpaces) 
281
282
283
  {
    FUNCNAME("Mesh::removeMacroElement()");

284
285
    typedef map<const DegreeOfFreedom*, std::set<MacroElement*> > DofElMap;
    typedef map<const DegreeOfFreedom*, GeoIndex> DofPosMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
286

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

289
290
291
292
    // 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);
293
294

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

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

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

      elInfo = stack.traverseNext(elInfo);
    }		   

Thomas Witkowski's avatar
Thomas Witkowski committed
316

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

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
337

338
339
340
    // === 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.           ===
341
    
342
343
    for (std::set<MacroElement*>::iterator macroIt = delMacros.begin();
	 macroIt != delMacros.end(); ++macroIt) {
Thomas Witkowski's avatar
Thomas Witkowski committed
344

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

353

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

360
361
	mel->child[0] = nullptr;
	mel->child[1] = nullptr;
362

363
	mel->setElementData(elementDataPrototype->clone()); 
364
      }
365

366
      mel->delDofPtr();
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
	 dofsIt != dofsOwner.end(); ++dofsIt) {
      
      bool deleteDof = true;

      for (std::set<MacroElement*>::iterator elIter = dofsIt->second.begin();
	   elIter != dofsIt->second.end(); ++elIter) {
380
381
	std::set<MacroElement*>::iterator mIt = delMacros.find(*elIter);
	if (mIt == delMacros.end()) {
382
383
384
385
386
387
	  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
    nLeaves = 0;
    nElements = 0;
397
    nVertices = 0;
398

399
400
    if (!macroElements.empty()) {
      std::set<const DegreeOfFreedom*> allVertices;
401

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

406
407
	if (elInfo->getElement()->isLeaf()) {
	  nLeaves++;
408

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

	elInfo = stack.traverseNext(elInfo);
414
415
      }

416
417
418
419
420
421
422
423
424
425
426
      nVertices = allVertices.size();
    } else {
      
      for (size_t i = 0; i < admin.size(); i++)
      {
	TEST_EXIT_DBG(admin[i]->getUsedSize() == admin[i]->getHoleCount())
	  ("All macro elements has been removed. But not all dofs are cleaned. (UsedSize = %d, HoleCount = %d)\n", 
	    admin[i]->getUsedSize(), admin[i]->getHoleCount());
	  
	admin[i]->reset();
      }
427
428
429
430
431
    }
    // === 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.                               ===
432
  }
433

434

435
436
437
438
439
440
  void Mesh::addDOFAdmin(DOFAdmin *localAdmin)
  {    
    FUNCNAME("Mesh::addDOFAdmin()");

    localAdmin->setMesh(this);

441
    TEST_EXIT(find(admin.begin(), admin.end(), localAdmin) == admin.end())
Thomas Witkowski's avatar
Thomas Witkowski committed
442
443
      ("admin %s is already associated to mesh %s\n",
       localAdmin->getName().c_str(), this->getName().c_str());
444
445
446

    admin.push_back(localAdmin);

447
    nDofEl = 0;
448

449
    localAdmin->setNumberOfPreDofs(VERTEX, nDof[VERTEX]);
450
451
    nDof[VERTEX] += localAdmin->getNumberOfDofs(VERTEX);
    nDofEl += getGeo(VERTEX) * nDof[VERTEX];
452

453
    if (dim > 1) {
454
      localAdmin->setNumberOfPreDofs(EDGE, nDof[EDGE]);
455
456
      nDof[EDGE] += localAdmin->getNumberOfDofs(EDGE);
      nDofEl += getGeo(EDGE) * nDof[EDGE];
457
458
    }

459
460
    localAdmin->setNumberOfPreDofs(CENTER, nDof[CENTER]);
    nDof[CENTER] += localAdmin->getNumberOfDofs(CENTER);
461
    nDofEl += nDof[CENTER];
462

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

465
466
    node[VERTEX] = 0;
    nNodeEl = getGeo(VERTEX);
467

468
469
    if (dim > 1) {
      node[EDGE] = nNodeEl;
470
      if (nDof[EDGE] > 0) 
471
	nNodeEl += getGeo(EDGE);
472
473
    }

474
    if (dim == 3) {
475
      localAdmin->setNumberOfPreDofs(FACE, nDof[FACE]);
476
477
      nDof[FACE] += localAdmin->getNumberOfDofs(FACE);
      nDofEl += getGeo(FACE) * nDof[FACE];
478
      node[FACE] = nNodeEl;
479
      if (nDof[FACE] > 0) 
480
	nNodeEl += getGeo(FACE);
481
482
    }

483
    node[CENTER] = nNodeEl;
484
    if (nDof[CENTER] > 0)
485
      nNodeEl += 1;
486
487
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
488

489
490
  void Mesh::dofCompress()
  {
491
    FUNCNAME_DBG("Mesh::dofCompress()");
492

Thomas Witkowski's avatar
Thomas Witkowski committed
493
494
    for (unsigned int iadmin = 0; iadmin < admin.size(); iadmin++) {
      DOFAdmin* compressAdmin = admin[iadmin];
495
496

      TEST_EXIT_DBG(compressAdmin)("no admin[%d] in mesh\n", iadmin);
497
      
Thomas Witkowski's avatar
Thomas Witkowski committed
498
      int size = compressAdmin->getSize();
Thomas Witkowski's avatar
Thomas Witkowski committed
499
      if (size < 1 || 
500
	  compressAdmin->getUsedDofs() < 1 || 
Thomas Witkowski's avatar
Thomas Witkowski committed
501
	  compressAdmin->getHoleCount() < 1)    
502
	continue;
Thomas Witkowski's avatar
Thomas Witkowski committed
503

504
      vector<DegreeOfFreedom> newDofIndex(size);     
505
      compressAdmin->compress(newDofIndex);
Thomas Witkowski's avatar
Thomas Witkowski committed
506
507
508
509

      Flag fill_flag = (preserveCoarseDOFs ?  
			Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NOTHING :
			Mesh::CALL_LEAF_EL | Mesh::FILL_NOTHING);          
510
511
512
      TraverseStack stack;
      ElInfo *elInfo = stack.traverseFirst(this, -1, fill_flag);
      while (elInfo) {
513
	elInfo->getElement()->newDofFct1(compressAdmin, newDofIndex);
514
515
516
517
518
	elInfo = stack.traverseNext(elInfo);
      }

      elInfo = stack.traverseFirst(this, -1, fill_flag);
      while (elInfo) {
519
	elInfo->getElement()->newDofFct2(compressAdmin);
520
521
	elInfo = stack.traverseNext(elInfo);
      }
522
    }       
523
524
525
  }


526
  DegreeOfFreedom *Mesh::getDof(GeoIndex position)
527
  {
528
    FUNCNAME_DBG("Mesh::getDof()");
529

530
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
531
      ("unknown position %d\n", position);
532

533
    int ndof = getNumberOfDofs(position);
534
    if (ndof <= 0) 
535
      return nullptr;
536

537
    DegreeOfFreedom *dof = new DegreeOfFreedom[ndof];
538

539
    for (int i = 0; i < getNumberOfDOFAdmin(); i++) {
540
      const DOFAdmin *localAdmin = &getDofAdmin(i);
541
      TEST_EXIT_DBG(localAdmin)("no admin[%d]\n", i);
542
      
543
      int n  = localAdmin->getNumberOfDofs(position);
544
      int n0 = localAdmin->getNumberOfPreDofs(position);
545
      
546
547
      TEST_EXIT_DBG(n + n0 <= ndof)
	("n = %d, n0 = %d too large: ndof = %d\n", n, n0, ndof);
548
      
549
      for (int j = 0; j < n; j++)
550
551
	dof[n0 + j] = const_cast<DOFAdmin*>(localAdmin)->getDOFIndex();
    }
552
    
553
    return dof;
554
555
556
  }


Thomas Witkowski's avatar
Thomas Witkowski committed
557
  DegreeOfFreedom **Mesh::createDofPtrs()
558
559
  {
    if (nNodeEl <= 0)
560
      return nullptr;
561

562
    DegreeOfFreedom **ptrs = new DegreeOfFreedom*[nNodeEl];
563
    for (int i = 0; i < nNodeEl; i++)
564
      ptrs[i] = nullptr;
565

566
    return ptrs;
567
568
  }

569

570
  void Mesh::freeDofPtrs(DegreeOfFreedom **ptrs)
571
  {
572
    FUNCNAME_DBG("Mesh::freeDofPtrs()");
573

574
    TEST_EXIT_DBG(ptrs)("ptrs is nullptr!\n");
575
576
577
578

    if (nNodeEl <= 0)
      return;
  
579
    delete [] ptrs;
580
581
582
  }


583
  const DOFAdmin *Mesh::createDOFAdmin(string lname, DimVec<int> lnDof)
584
  {    
Thomas Witkowski's avatar
Thomas Witkowski committed
585
    DOFAdmin *localAdmin = new DOFAdmin(this, lname);
586

Thomas Witkowski's avatar
Thomas Witkowski committed
587
    for (int i = 0; i < dim + 1; i++)
588
      localAdmin->setNumberOfDofs(i, lnDof[i]);
589
590
591

    addDOFAdmin(localAdmin);

592
    return localAdmin;
593
594
595
596
597
  }


  const DOFAdmin* Mesh::getVertexAdmin() const
  {
598
    const DOFAdmin *localAdmin = nullptr;
599

Thomas Witkowski's avatar
Thomas Witkowski committed
600
    for (unsigned int i = 0; i < admin.size(); i++) {
601
      if (admin[i]->getNumberOfDofs(VERTEX)) {
602
603
604
605
	if (!localAdmin)  
	  localAdmin = admin[i];
	else if (admin[i]->getSize() < localAdmin->getSize())
	  localAdmin = admin[i];
606
      }
607
608
    }

609
    return localAdmin;
610
611
  }

612

613
  void Mesh::freeDof(DegreeOfFreedom* dof, GeoIndex position)
614
  {
615
    FUNCNAME_DBG("Mesh::freeDof()");
616

617
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
618
      ("unknown position %d\n", position);
619

620
    if (nDof[position]) {
621
      TEST_EXIT_DBG(dof != nullptr)("dof = nullptr, but ndof = %d\n", nDof[position]);
622
    } else  {
623
      TEST_EXIT_DBG(dof == nullptr)("dof != nullptr, but ndof = 0\n");
624
    }
625

626
627
    TEST_EXIT_DBG(nDof[position] <= MAX_DOF)
      ("ndof too big: ndof = %d, MAX_DOF = %d\n", nDof[position], MAX_DOF);
628

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


  Element* Mesh::createNewElement(Element *parent)
  {
652
    FUNCNAME_DBG("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(nullptr); // 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
      break;
    default:
682
      ERROR_EXIT("invalid dim [%d]\n",dim);
683
      return nullptr;
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
    static const MacroElement *mel = nullptr;
696
    DimVec<double> lambda(dim, NO_INIT);
Thomas Witkowski's avatar
Thomas Witkowski committed
697
    ElInfo *mel_info = createNewElInfo();
698

699
    if (start_mel != nullptr)
700
701
      mel = start_mel;
    else
702
      if (mel == nullptr || 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
      
725
      if (mel->getNeighbour(k) && !macrosVisited.count(mel->getNeighbour(k)->getIndex())) {
726
	// look for next macro-element in the direction of the coordinates xy
727
	mel = mel->getNeighbour(k);
728
729
	mel_info->fillMacroInfo(mel);
	continue;
730
      } else {
731
	// consider all neighbors of the current macro-element to visit next
732
	for (int i = 0; i < dim + 1; ++i) {
733
	  if (i !=  k && mel->getNeighbour(i) && !macrosVisited.count(mel->getNeighbour(i)->getIndex()))
734
735
	    active.push(mel->getNeighbour(i));    
	}
736
737
738
739
	// if all neighbors are visited already
	if (active.empty()) { 	  
	  if (macrosVisited.size() == static_cast<size_t>(getNumberOfMacros())) {
	    // if all macro-elements are visited -> no element found!
740
741
742
	    delete mel_info;
	    return false;
	  } else {
743
	    // go to an arbitrary macro-element to continue the search
744
745
746
	    deque<MacroElement*>::iterator it;
	    bool found = false;
	    for (it = firstMacroElement(); it != endOfMacroElements(); it++) {
747
	      if (!macrosVisited.count((*it)->getIndex())) {
748
749
750
751
		active.push(*it);
		found = true;
	      }
	    }
752
753
754
755
	    if (!found) {
	      delete mel_info;
	      return false;
	    }
756
	  }
757
	}
758
759
	mel = active.top();
	active.pop();
760
761

	mel_info->fillMacroInfo(mel);
762
763
764
765
      }
    }

    /* now, descend in tree to find leaf element at point */
766
    bool inside = findElementAtPointRecursive(mel_info, lambda, k, el_info);
767
768
    for (int i = 0; i <= dim; i++)
      bary[i] = final_lambda[i];   
769
  
Thomas Witkowski's avatar
Thomas Witkowski committed
770
    delete mel_info;
771

772
    return inside;
773
774
  }

775

776
  bool Mesh::findElementAtPoint(const WorldVector<double>&  xy,
777
778
				Element **elp, 
				DimVec<double>& bary,
779
				const MacroElement *start_mel,
780
781
				const WorldVector<double> *xy0,
				double *sp)
782
  {
783
784
    ElInfo *el_info = createNewElInfo();
    int val = findElInfoAtPoint(xy, el_info, bary, start_mel, xy0, sp);
785
786
787

    *elp = el_info->getElement();

Thomas Witkowski's avatar
Thomas Witkowski committed
788
    delete el_info;
789

790
    return val;
791
792
  }

793

794
  bool Mesh::findElementAtPointRecursive(ElInfo *el_info,
795
					 const DimVec<double>& lambda,
796
					 int outside,
797
798
					 ElInfo* final_el_info)
  {
799
    FUNCNAME("Mesh::findElementAtPointRecursive()");
Thomas Witkowski's avatar
Thomas Witkowski committed
800

801
802
    Element *el = el_info->getElement();
    DimVec<double> c_lambda(dim, NO_INIT);
803
804
    int inside;
    int ichild, c_outside;
805
806
807
808

    if (el->isLeaf()) {
      *final_el_info = *el_info;
      if (outside < 0) {
Thomas Witkowski's avatar
Thomas Witkowski committed
809
	for (int i = 0; i <= dim; i++)
810
	  final_lambda[i] = lambda[i];
Thomas Witkowski's avatar
Thomas Witkowski committed
811
	
812
	return true;
813
814
815
816
      }  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
817
818
819
820
	  for (int i = 0; i <= dim; i++) 
	    final_lambda[i] = s * c_lambda[i] + (1.0 - s) * lambda[i];
	  
	  if (g_sp)
821
	    *(g_sp) = s;
Thomas Witkowski's avatar
Thomas Witkowski committed
822
	  
823
	  if (dim == 3) 
824
	    MSG("Outside finest level on el %d: s = %.3e\n", el->getIndex(), s);
825

826
	  return false;  /* ??? */
827
	} else {
828
	  return false;
829
	}
830
      }
831
832
    }

833
    ElInfo *c_el_info = createNewElInfo();
834

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

857
    if (dim == 2) {
858
859
860
861
      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
862
	  TEST_EXIT(outside == 0)("outside curved boundary child 0\n");	  
863
864
865
866
867
868
869
870
871
	} 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
872
	  TEST_EXIT(outside == 0)("outside curved boundary child 1\n");	  
873
874
875
876
877
878
879
880
	} else {
	  c_lambda[0] = lambda[1] - lambda[0];
	  c_lambda[1] = lambda[2];
	  c_lambda[2] = 2.0 * lambda[0];
	}
      }
    } /* DIM == 2 */

881
    if (dim == 3) {
Peter Gottschling's avatar