Mesh.cc 33.2 KB
Newer Older
Thomas Witkowski's avatar
Thomas Witkowski committed
1
2
3
4
5
6
#include <algorithm>
#include <set>
#include <map>

#include "time.h"

7
8
9
10
#include "AdaptStationary.h"
#include "AdaptInstationary.h"
#include "FiniteElemSpace.h"
#include "ElementData.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
11
#include "ElementDofIterator.h"
12
13
14
15
16
17
18
19
20
21
22
23
24
#include "MacroElement.h"
#include "MacroReader.h"
#include "Mesh.h"
#include "Traverse.h"
#include "Parameters.h"
#include "FixVec.h"
#include "DOFVector.h"
#include "CoarseningManager.h"
#include "DOFIterator.h"
#include "VertexVector.h"
#include "MacroWriter.h"
#include "PeriodicMap.h"
#include "Projection.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
25
#include "ElInfoStack.h"
26
#include "Serializer.h"
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

namespace AMDiS {

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

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

  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;


47
48
49
  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);
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66

  //**************************************************************************
  //  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;
  const Flag Mesh::CALL_MG_LEVEL           = 0X4000L ; // used in mg methods 


  // const Flag Mesh::USE_PARAMETRIC          = 0X8000L ; // used in mg methods 

  DOFAdmin* Mesh::compressAdmin = NULL;
Thomas Witkowski's avatar
Thomas Witkowski committed
67
  std::vector<DegreeOfFreedom> Mesh::dof_used;
68
  const int Mesh::MAX_DOF = 100;
69
  std::map<std::pair<DegreeOfFreedom, int>, DegreeOfFreedom*> Mesh::serializedDOFs;
70
71
72

  struct delmem { 
    DegreeOfFreedom* ptr;
73
    int len;
74
75
76
  };


Thomas Witkowski's avatar
Thomas Witkowski committed
77
  Mesh::Mesh(std::string aName, int dimension) 
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
    : name(aName), 
      dim(dimension), 
      nVertices(0),
      nEdges(0),
      nLeaves(0), 
      nElements(0),
      parametric(NULL), 
      preserveCoarseDOFs(false),
      nDOFEl(0),
      nDOF(dimension, DEFAULT_VALUE, 0),
      nNodeEl(0),
      node(dimension, DEFAULT_VALUE, 0),
      elementPrototype(NULL),
      elementDataPrototype(NULL),
      elementIndex(-1),
      initialized(false),
94
      macroFileInfo(NULL),
95
96
97
      final_lambda(dimension, DEFAULT_VALUE, 0.0)
  {

98
    FUNCNAME("Mesh::Mesh()");
99
100
101
102

    // set default element prototype
    switch(dim) {
    case 1:
Thomas Witkowski's avatar
Thomas Witkowski committed
103
      elementPrototype = new Line(this);
104
105
      break;
    case 2:
Thomas Witkowski's avatar
Thomas Witkowski committed
106
      elementPrototype = new Triangle(this);
107
108
      break;
    case 3:
Thomas Witkowski's avatar
Thomas Witkowski committed
109
      elementPrototype = new Tetrahedron(this);
110
111
112
113
114
115
116
      break;
    default:
      ERROR_EXIT("invalid dimension\n");
    }

    elementPrototype->setIndex(-1);

117
118
    elementIndex = 0;
  }
119
120

  Mesh::~Mesh()
121
  {
122
    Element::deletedDOFs.clear();
123
124
125
126
127

    for (std::deque<MacroElement*>::const_iterator it = macroElements.begin();
	 it != macroElements.end();
	 ++it) {
      (*it)->getElement()->deleteElementDOFs();
Thomas Witkowski's avatar
Thomas Witkowski committed
128
      delete *it;
129
130
    }    

131
    Element::deletedDOFs.clear();
132

133
    if (macroFileInfo != NULL) {
Thomas Witkowski's avatar
Thomas Witkowski committed
134
      delete macroFileInfo;
135
    }
136
    if (elementPrototype) {
Thomas Witkowski's avatar
Thomas Witkowski committed
137
      delete elementPrototype;
138
139
    }
    if (elementDataPrototype) {
Thomas Witkowski's avatar
Thomas Witkowski committed
140
      delete elementDataPrototype;
141
142
143
    }
    
    for (int i = 0; i < static_cast<int>(admin.size()); i++) {
Thomas Witkowski's avatar
Thomas Witkowski committed
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
168
169
170
171
172
173
174
175
176
177
178
179
    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;
    nDOFEl = m.nDOFEl;
    nDOF = m.nDOF;
    nNodeEl = m.nNodeEl;
    node = m.node;
    newDOF = m.newDOF;
    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
180
      admin[i] = new DOFAdmin(this);
181
      *(admin[i]) = *(m.admin[i]);
182
183
      admin[i]->setMesh(this);
    }
184

185

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

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

    int insertCounter = 0;
197

198
199
    macroElements.clear();

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

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

209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
      // 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.
      mapIndex.insert(std::pair<int, int>(el->getIndex(), insertCounter));
    }

    // Now we have to go through all the new MacroElements, and update the neighbour
    // connections.
    insertCounter = 0;
    for (std::deque<MacroElement*>::const_iterator it = m.macroElements.begin();
	 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.
	macroElements[insertCounter]->
	  setNeighbour(i, macroElements[mapIndex[(*it)->getNeighbour(i)->getIndex()]]);
      }
    }

    // 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
  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
  void Mesh::addMacroElement(MacroElement* me) 
  {
    macroElements.push_back(me); 
    me->setIndex(macroElements.size());
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
270
271
  void Mesh::removeMacroElements(std::vector<MacroElement*>& macros,
				 const FiniteElemSpace *feSpace) 
272
273
274
  {
    FUNCNAME("Mesh::removeMacroElement()");

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

    TEST_EXIT(admin.size() == 1)("Not yet implemented for multiple admins!\n");
    TEST_EXIT(admin[0])("There is something wrong!\n");

    ElementDofIterator elDofIter(feSpace);
282

283
284
    // Map that stores for each dof pointer (which may have a list of dofs)
    // all macro element indices that own the dof.
Thomas Witkowski's avatar
Thomas Witkowski committed
285
286
    DofElMap dofsOwner;
    DofPosMap dofsPosIndex;
287
288
289
290
291
    
    // Determine all dof owner macro elements.
    for (std::deque<MacroElement*>::iterator macroIt = macroElements.begin();
	 macroIt != macroElements.end();
	 ++macroIt) {
Thomas Witkowski's avatar
Thomas Witkowski committed
292
293
294
295
296
      elDofIter.reset((*macroIt)->getElement());
      do {
	dofsOwner[elDofIter.getDofPtr()].insert(*macroIt);
	dofsPosIndex[elDofIter.getDofPtr()] = elDofIter.getPosIndex();
      } while (elDofIter.nextStrict());
297
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
298

299
300
301
302
    // Remove all the given macro elements.
    for (std::vector<MacroElement*>::iterator macroIt = macros.begin();
	 macroIt != macros.end();
	 ++macroIt) {
Thomas Witkowski's avatar
Thomas Witkowski committed
303
304
305
306
307
308
309

      std::deque<MacroElement*>::iterator mEl = 
	find(macroElements.begin(), macroElements.end(), *macroIt);
      TEST_EXIT(mEl != macroElements.end())
	("Cannot find MacroElement that should be removed!\n");
      macroElements.erase(mEl);

310
311
312
313
      // Go through all neighbours of the macro element and remove this macro element
      // to be neighbour of some other macro element.
      for (int i = 0; i <= dim; i++) {
	if ((*macroIt)->getNeighbour(i)) {
Thomas Witkowski's avatar
Thomas Witkowski committed
314
315
	  for (int j = 0; j <= dim; j++)
	    if ((*macroIt)->getNeighbour(i)->getNeighbour(j) == *macroIt)
316
317
318
319
320
	      (*macroIt)->getNeighbour(i)->setNeighbour(j, NULL);
	} else {
	  // There is no neighbour at this edge, so we have to decrease the number
	  // of edges in the mesh.
	  nEdges--;
321
	}
322
323
324
325
326
327
      }

      nLeaves--;
      nElements--;

      // Remove this macro element from the dof owner list.
Thomas Witkowski's avatar
Thomas Witkowski committed
328
329
      for (DofElMap::iterator dofsIt = dofsOwner.begin();
	   dofsIt != dofsOwner.end(); ++dofsIt) {
330
	std::set<MacroElement*>::iterator mIt = dofsIt->second.find(*macroIt);
Thomas Witkowski's avatar
Thomas Witkowski committed
331
	if (mIt != dofsIt->second.end())
332
333
334
335
336
337
338
339
340
341
	  dofsIt->second.erase(mIt);
      }

      // And remove the macro element from memory
      delete *macroIt;
    }

    int nRemainDofs = 0;
    // Check now all the dofs, that have no owner anymore and therefore have to
    // be removed.
Thomas Witkowski's avatar
Thomas Witkowski committed
342
343
344
    for (DofElMap::iterator dofsIt = dofsOwner.begin(); 
	 dofsIt != dofsOwner.end(); ++dofsIt) {    
      if (dofsIt->second.size() == 0)
345
	freeDOF(const_cast<DegreeOfFreedom*>(dofsIt->first), 
Thomas Witkowski's avatar
Thomas Witkowski committed
346
347
		dofsPosIndex[dofsIt->first]);
      else
348
	nRemainDofs++;
349
350
    }

351
    nVertices = nRemainDofs;
352
  }
353
354
355
356
357
358
359

  void Mesh::addDOFAdmin(DOFAdmin *localAdmin)
  {    
    FUNCNAME("Mesh::addDOFAdmin()");

    localAdmin->setMesh(this);

360
    std::vector<DOFAdmin*>::iterator dai = 
361
      std::find(admin.begin(), admin.end(), localAdmin);
362

Thomas Witkowski's avatar
Thomas Witkowski committed
363
364
365
    TEST_EXIT(dai == admin.end())
      ("admin %s is already associated to mesh %s\n",
       localAdmin->getName().c_str(), this->getName().c_str());
366

367
    // if this will be required, see the untested code in revision < 224
368
    //    TEST_EXIT(!initialized)("Adding DOFAdmins to initilized meshes does not work yet!\n");
Thomas Witkowski's avatar
Thomas Witkowski committed
369

370
371
372
373
374
    admin.push_back(localAdmin);

    nDOFEl = 0;

    localAdmin->setNumberOfPreDOFs(VERTEX,nDOF[VERTEX]);
375
    nDOF[VERTEX] += localAdmin->getNumberOfDOFs(VERTEX);
376
377
    nDOFEl += getGeo(VERTEX) * nDOF[VERTEX];

378
    if (dim > 1) {
379
      localAdmin->setNumberOfPreDOFs(EDGE,nDOF[EDGE]);
380
      nDOF[EDGE] += localAdmin->getNumberOfDOFs(EDGE);
381
382
383
384
385
386
387
      nDOFEl += getGeo(EDGE) * nDOF[EDGE];
    }

    localAdmin->setNumberOfPreDOFs(CENTER,nDOF[CENTER]);
    nDOF[CENTER]  += localAdmin->getNumberOfDOFs(CENTER);
    nDOFEl += nDOF[CENTER];

388
    TEST_EXIT_DBG(nDOF[VERTEX] > 0)("no vertex dofs\n");
389

390
391
    node[VERTEX] = 0;
    nNodeEl = getGeo(VERTEX);
392

393
394
    if (dim > 1) {
      node[EDGE] = nNodeEl;
395
396
      if (nDOF[EDGE] > 0) 
	nNodeEl += getGeo(EDGE);
397
398
    }

399
    if (dim == 3) {
400
      localAdmin->setNumberOfPreDOFs(FACE,nDOF[FACE]);
401
402
403
404
405
      nDOF[FACE] += localAdmin->getNumberOfDOFs(FACE);
      nDOFEl += getGeo(FACE) * nDOF[FACE];
      node[FACE] = nNodeEl;
      if (nDOF[FACE] > 0) 
	nNodeEl += getGeo(FACE);
406
407
    }

408
    node[CENTER] = nNodeEl;
409
    if (nDOF[CENTER] > 0)
410
      nNodeEl += 1;
411
412
413
414
  }

  void Mesh::dofCompress()
  {
415
416
    FUNCNAME("Mesh::dofCompress()");
    Flag fill_flag;
417

Thomas Witkowski's avatar
Thomas Witkowski committed
418
    for (int iadmin = 0; iadmin < static_cast<int>(admin.size()); iadmin++) {
419
420
421
      compressAdmin = admin[iadmin];

      TEST_EXIT_DBG(compressAdmin)("no admin[%d] in mesh\n", iadmin);
422
      
Thomas Witkowski's avatar
Thomas Witkowski committed
423
424
      int size = compressAdmin->getSize();
      if (size < 1) 
425
	continue;
Thomas Witkowski's avatar
Thomas Witkowski committed
426

427
428
      if (compressAdmin->getUsedDOFs() < 1)    
	continue;
Thomas Witkowski's avatar
Thomas Witkowski committed
429

430
431
      if (compressAdmin->getHoleCount() < 1)    
	continue;
Thomas Witkowski's avatar
Thomas Witkowski committed
432
  
433
434
435
436
      newDOF.resize(size);
      
      compressAdmin->compress(newDOF);
      
437
      if (preserveCoarseDOFs)
438
	fill_flag = Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NOTHING;
439
      else
440
441
442
	fill_flag = Mesh::CALL_LEAF_EL | Mesh::FILL_NOTHING;
      
      
443
444
445
446
447
448
449
450
451
452
453
454
455
      TraverseStack stack;
      ElInfo *elInfo = stack.traverseFirst(this, -1, fill_flag);
      while (elInfo) {
	newDOFFct1(elInfo);
	elInfo = stack.traverseNext(elInfo);
      }

      elInfo = stack.traverseFirst(this, -1, fill_flag);
      while (elInfo) {
	newDOFFct2(elInfo);
	elInfo = stack.traverseNext(elInfo);
      }

456
      newDOF.resize(0);
457
    }       
458
459
460
461
462
  }


  DegreeOfFreedom *Mesh::getDOF(GeoIndex position)
  {
463
    FUNCNAME("Mesh::getDOF()");
464

465
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
466
      ("unknown position %d\n", position);
467

468
469
    int ndof = getNumberOfDOFs(position);
    if (ndof <= 0) 
470
      return NULL;
471

472
    DegreeOfFreedom *dof = new DegreeOfFreedom[ndof];
473

474
475
    for (int i = 0; i < getNumberOfDOFAdmin(); i++) {
      const DOFAdmin *localAdmin = &getDOFAdmin(i);
476
      TEST_EXIT_DBG(localAdmin)("no admin[%d]\n", i);
477
478
479
480
      
      int n  = localAdmin->getNumberOfDOFs(position);
      int n0 = localAdmin->getNumberOfPreDOFs(position);
      
481
      TEST_EXIT_DBG(n + n0 <= ndof)("n=%d, n0=%d too large: ndof=%d\n", n, n0, ndof);
482
      
483
      for (int j = 0; j < n; j++)
484
485
	dof[n0 + j] = const_cast<DOFAdmin*>(localAdmin)->getDOFIndex();
    }
486
 
487
    return dof;
488
489
490
491
492
  }


  DegreeOfFreedom **Mesh::createDOFPtrs()
  {
493
    FUNCNAME("Mesh::createDOFPtrs()");
494
495

    if (nNodeEl <= 0)
496
      return NULL;
497

498
    DegreeOfFreedom **ptrs = new DegreeOfFreedom*[nNodeEl];
499
    for (int i = 0; i < nNodeEl; i++)
500
501
      ptrs[i] = NULL;

502
    return ptrs;
503
504
505
506
  }

  void Mesh::freeDOFPtrs(DegreeOfFreedom **ptrs)
  {
507
    FUNCNAME("Mesh::freeDOFPtrs()");
508

509
    TEST_EXIT_DBG(ptrs)("ptrs=NULL\n");
510
511
512
513

    if (nNodeEl <= 0)
      return;
  
514
    delete [] ptrs;
515
516
517
  }


Thomas Witkowski's avatar
Thomas Witkowski committed
518
  const DOFAdmin *Mesh::createDOFAdmin(std::string lname, DimVec<int> lnDOF)
519
  {
520
    FUNCNAME("Mesh::createDOFAdmin()");
521

Thomas Witkowski's avatar
Thomas Witkowski committed
522
    DOFAdmin *localAdmin = new DOFAdmin(this, lname);
523

Thomas Witkowski's avatar
Thomas Witkowski committed
524
525
    for (int i = 0; i < dim + 1; i++)
      localAdmin->setNumberOfDOFs(i, lnDOF[i]);
526
527
528

    addDOFAdmin(localAdmin);

529
    return localAdmin;
530
531
532
533
534
535
536
  }


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

537
538
539
540
541
542
    for (int i = 0; i < static_cast<int>(admin.size()); i++) {
      if (admin[i]->getNumberOfDOFs(VERTEX)) {
	if (!localAdmin)  
	  localAdmin = admin[i];
	else if (admin[i]->getSize() < localAdmin->getSize())
	  localAdmin = admin[i];
543
      }
544
545
    }

546
    return localAdmin;
547
548
549
550
  }

  void Mesh::freeDOF(DegreeOfFreedom* dof, GeoIndex position)
  {
551
    FUNCNAME("Mesh::freeDOF()");
552

553
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
554
      ("unknown position %d\n", position);
555

556
557
558
    int ndof = nDOF[position];
    if (ndof) {
      if (!dof) {
559
	MSG("dof = NULL, but ndof = %d\n", ndof);
560
561
	return;
      }
562
    } else  {
563
564
565
      if (dof)
	MSG("dof != NULL, but ndof = 0\n");

566
567
      return;
    }
568

569
    TEST_EXIT_DBG(ndof <= MAX_DOF)
570
      ("ndof too big: ndof = %d, MAX_DOF = %d\n", ndof, MAX_DOF);
571

572
573
574
575
576
577
578
579
580
581
    for (int i = 0; i < static_cast<int>(admin.size()); i++) {
      DOFAdmin *localAdmin = admin[i];
      int n = localAdmin->getNumberOfDOFs(position);
      int n0 = localAdmin->getNumberOfPreDOFs(position);
      
      TEST_EXIT_DBG(n + n0 <= ndof)("n=%d, n0=%d too large: ndof=%d\n", n, n0, ndof);
      
      for (int j = 0; j < n; j++)
	localAdmin->freeDOFIndex(dof[n0 + j]);
    }
582

583
    delete [] dof;
584
585
586
587
588
  }

  void Mesh::freeElement(Element* el)
  {
    freeDOFPtrs(const_cast<DegreeOfFreedom**>(el->getDOF()));
Thomas Witkowski's avatar
Thomas Witkowski committed
589
    delete el;
590
591
592
593
594
595
  }


  Element* Mesh::createNewElement(Element *parent)
  {
    FUNCNAME("Mesh::createNewElement()");
596
597

    TEST_EXIT_DBG(elementPrototype)("no element prototype\n");
598
599
600

    Element *el = parent ? parent->clone() : elementPrototype->clone();
  
601
    if (!parent && elementDataPrototype) {
602
603
604
605
606
607
608
609
      el->setElementData(elementDataPrototype->clone()); 
    } else {
      el->setElementData(NULL); // must be done in ElementData::refineElementData()
    }

    return el;
  }

610

611
612
613
614
  ElInfo* Mesh::createNewElInfo()
  {
    switch(dim) {
    case 1:
Thomas Witkowski's avatar
Thomas Witkowski committed
615
      return new ElInfo1d(this);
616
617
      break;
    case 2:
Thomas Witkowski's avatar
Thomas Witkowski committed
618
      return new ElInfo2d(this);
619
620
      break;
    case 3:
Thomas Witkowski's avatar
Thomas Witkowski committed
621
      return new ElInfo3d(this);
622
623
624
625
      break;
    default:
      ERROR_EXIT("invalid dim\n");
      return NULL;
626
    }
627
628
629
630
  }

  bool Mesh::findElInfoAtPoint(const WorldVector<double>& xy,
			       ElInfo *el_info,
631
632
			       DimVec<double>& bary,
			       const MacroElement *start_mel,
633
			       const WorldVector<double> *xy0,
634
			       double *sp)
635
636
637
638
639
640
641
642
643
644
  {
    static const MacroElement *mel = NULL;
    DimVec<double> lambda(dim, NO_INIT);
    ElInfo *mel_info = NULL;

    mel_info = createNewElInfo();

    if (start_mel != NULL)
      mel = start_mel;
    else
645
      if ((mel == NULL) || (mel->getElement()->getMesh() != this))
646
647
648
	mel = *(macroElements.begin());

    mel_info->setFillFlag(Mesh::FILL_COORDS);
649
    g_xy = &xy;
650
    g_xy0 = xy0;
651
    g_sp = sp;
652
653
654

    mel_info->fillMacroInfo(mel);

655
    int k;
656
657
658
659
660
661
662
663
664
665
    while ((k = mel_info->worldToCoord(xy, &lambda)) >= 0) {
      if (mel->getNeighbour(k)) {
	mel = mel->getNeighbour(k);
	mel_info->fillMacroInfo(mel);
	continue;
      }
      break;
    }

    /* now, descend in tree to find leaf element at point */
666
    bool inside = findElementAtPointRecursive(mel_info, lambda, k, el_info);
667
668
    for (int i = 0; i <= dim; i++)
      bary[i] = final_lambda[i];   
669
  
Thomas Witkowski's avatar
Thomas Witkowski committed
670
    delete mel_info;
671

672
    return inside;
673
674
675
  }

  bool Mesh::findElementAtPoint(const WorldVector<double>&  xy,
676
677
				Element **elp, 
				DimVec<double>& bary,
678
				const MacroElement *start_mel,
679
680
				const WorldVector<double> *xy0,
				double *sp)
681
  {
682
683
    ElInfo *el_info = createNewElInfo();
    int val = findElInfoAtPoint(xy, el_info, bary, start_mel, xy0, sp);
684
685
686

    *elp = el_info->getElement();

Thomas Witkowski's avatar
Thomas Witkowski committed
687
    delete el_info;
688

689
    return val;
690
691
  }

692
  bool Mesh::findElementAtPointRecursive(ElInfo *el_info,
693
					 const DimVec<double>& lambda,
694
					 int outside,
695
696
					 ElInfo* final_el_info)
  {
697
    FUNCNAME("Mesh::findElementAtPointRecursive()");
698
699
    Element *el = el_info->getElement();
    DimVec<double> c_lambda(dim, NO_INIT);
700
701
    int inside;
    int ichild, c_outside;
702
703
704
705

    if (el->isLeaf()) {
      *final_el_info = *el_info;
      if (outside < 0) {
706
707
708
709
	for (int i = 0; i <= dim; i++) {
	  final_lambda[i] = lambda[i];
	}

710
	return true;
711
712
713
714
715
716
717
718
719
720
721
722
      }  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]);
	  for (int i = 0; i <= dim; i++) {
	    final_lambda[i] = s * c_lambda[i] + (1.0-s) * lambda[i];
	  }
	  if (g_sp) {
	    *(g_sp) = s;
	  }
	  if (dim == 3) 
	    MSG("outside finest level on el %d: s=%.3e\n", el->getIndex(), s);
723

724
	  return false;  /* ??? */
725
	} else {
726
	  return false;
727
	}
728
      }
729
730
    }

731
    ElInfo *c_el_info = createNewElInfo();
732

733
    if (dim == 1) {
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
      if (lambda[0] >= lambda[1]) {
	c_el_info->fillElInfo(0, el_info);
	if (outside >= 0) {
	  outside = el_info->worldToCoord(*(g_xy), &c_lambda);
	  if (outside >= 0) ERROR("point outside domain\n");
	} 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);
	  if (outside >= 0) ERROR("point outside domain\n");
	} else {
	  c_lambda[1] = lambda[1] - lambda[0];
	  c_lambda[0] = 2.0 * lambda[0];
	}
      }
    } /* DIM == 1 */

755
    if (dim == 2) {
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
      if (lambda[0] >= lambda[1]) {
	c_el_info->fillElInfo(0, el_info);
	if (el->isNewCoordSet()) {
	  outside = c_el_info->worldToCoord(*(g_xy), &c_lambda);
	  if (outside >= 0) {
	    ERROR("outside curved boundary child 0\n");
	  }
	} 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);
	  if (outside >= 0) {
	    ERROR("outside curved boundary child 1\n");
	  }
	} else {
	  c_lambda[0] = lambda[1] - lambda[0];
	  c_lambda[1] = lambda[2];
	  c_lambda[2] = 2.0 * lambda[0];
	}
      }
    } /* DIM == 2 */

783
    if (dim == 3) {
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
      if (el->isNewCoordSet()) {
	if (lambda[0] >= lambda[1])
	  ichild = 0;
	else
	  ichild = 1;
	c_el_info->fillElInfo(ichild, el_info);
	c_outside = c_el_info->worldToCoord(*(g_xy), &c_lambda);

	if (c_outside>=0) {  /* test is other child is better... */
	  DimVec<double> c_lambda2(dim, NO_INIT);
	  int c_outside2;
	  ElInfo *c_el_info2 = createNewElInfo();

	  c_el_info2->fillElInfo(1-ichild, el_info);
	  c_outside2 = c_el_info2->worldToCoord(*(g_xy), &c_lambda2);

	  MSG("new_coord CHILD %d: outside=%d, lambda=(%.2f %.2f %.2f %.2f)\n",
	      ichild, c_outside, c_lambda[0],c_lambda[1],c_lambda[2],c_lambda[3]);
	  MSG("new_coord CHILD %d: outside=%d, lambda=(%.2f %.2f %.2f %.2f)\n",
	      1-ichild, c_outside2, c_lambda2[0],c_lambda2[1],c_lambda2[2],
	      c_lambda2[3]);

	  if ((c_outside2 < 0) || (c_lambda2[c_outside2] > c_lambda[c_outside])) {
807
808
	    for (int i = 0; i <= dim; i++) 
	      c_lambda[i] = c_lambda2[i];	    
809
810
811
812
	    c_outside = c_outside2;
	    *c_el_info = *c_el_info2;
	    ichild = 1 - ichild;
	  }
Thomas Witkowski's avatar
Thomas Witkowski committed
813
	  delete c_el_info2;
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
	}
	outside = c_outside;
      } else {  /* no new_coord */
	if (lambda[0] >= lambda[1]) {
	  c_el_info->fillElInfo(0, el_info);
	  c_lambda[0] = lambda[0] - lambda[1];
	  c_lambda[1] = lambda[Tetrahedron::childVertex[(dynamic_cast<ElInfo3d*>(el_info))->
							getType()][0][1]];
	  c_lambda[2] = lambda[Tetrahedron::childVertex[(dynamic_cast<ElInfo3d*>(el_info))->
							getType()][0][2]];
	  c_lambda[3] = 2.0 * lambda[1];
	} else {
	  c_el_info->fillElInfo(1, el_info);
	  c_lambda[0] = lambda[1] - lambda[0];
	  c_lambda[1] = lambda[Tetrahedron::childVertex[(dynamic_cast<ElInfo3d*>(el_info))->
							getType()][1][1]];
	  c_lambda[2] = lambda[Tetrahedron::childVertex[(dynamic_cast<ElInfo3d*>(el_info))->
							getType()][1][2]];
	  c_lambda[3] = 2.0 * lambda[0];
	}
      }
    }  /* DIM == 3 */

    inside = findElementAtPointRecursive(c_el_info, c_lambda, outside, 
					 final_el_info);
Thomas Witkowski's avatar
Thomas Witkowski committed
839
    delete c_el_info;
840

841
    return inside; 
842
843
  }

844
845
846
847
848
849
850
  bool Mesh::getDofIndexCoords(const DegreeOfFreedom* dof, 
			       const FiniteElemSpace* feSpace,
			       WorldVector<double>& coords)
  {
    DimVec<double>* baryCoords;
    bool found = false;
    TraverseStack stack;
Thomas Witkowski's avatar
Thomas Witkowski committed
851
852
    Vector<DegreeOfFreedom> dofVec(feSpace->getBasisFcts()->getNumber());

853
    ElInfo *elInfo = stack.traverseFirst(this, -1, 
Thomas Witkowski's avatar
Thomas Witkowski committed
854
					 Mesh::CALL_LEAF_EL | Mesh::FILL_COORDS);    
855
    while (elInfo) {
Thomas Witkowski's avatar
Thomas Witkowski committed
856
857
858
859
860
      feSpace->getBasisFcts()->getLocalIndicesVec(elInfo->getElement(),
						  feSpace->getAdmin(),
						  &dofVec);
      for (int i = 0; i < feSpace->getBasisFcts()->getNumber(); i++) {
	if (dofVec[i] == *dof) {
861
862
863
	  baryCoords = feSpace->getBasisFcts()->getCoords(i);
	  elInfo->coordToWorld(*baryCoords, coords);
	  found = true;
Thomas Witkowski's avatar
Thomas Witkowski committed
864
	  break;	  
865
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
866
867
      }
      
868
869
      if (found)
	break;
Thomas Witkowski's avatar
Thomas Witkowski committed
870
      
871
872
873
874
875
      elInfo = stack.traverseNext(elInfo);
    }

    return found;
  }
876

877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
  bool Mesh::getDofIndexCoords(DegreeOfFreedom dof, 
			       const FiniteElemSpace* feSpace,
			       WorldVector<double>& coords)
  {
    DimVec<double>* baryCoords;
    bool found = false;
    TraverseStack stack;
    Vector<DegreeOfFreedom> dofVec(feSpace->getBasisFcts()->getNumber());

    ElInfo *elInfo = stack.traverseFirst(this, -1, 
					 Mesh::CALL_LEAF_EL | Mesh::FILL_COORDS);    
    while (elInfo) {
      feSpace->getBasisFcts()->getLocalIndicesVec(elInfo->getElement(),
						  feSpace->getAdmin(),
						  &dofVec);
      for (int i = 0; i < feSpace->getBasisFcts()->getNumber(); i++) {
	if (dofVec[i] == dof) {
	  baryCoords = feSpace->getBasisFcts()->getCoords(i);
	  elInfo->coordToWorld(*baryCoords, coords);
	  found = true;
	  break;	  
	}
      }
      
      if (found)
	break;
      
      elInfo = stack.traverseNext(elInfo);
    }

    return found;
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
910
911
912
913
  void Mesh::setDiameter(const WorldVector<double>& w) 
  { 
    diam = w; 
  }
914

Thomas Witkowski's avatar
Thomas Witkowski committed
915
916
917
918
  void Mesh::setDiameter(int i, double w) 
  { 
    diam[i] = w; 
  }
919
920
921
922
923
924
925
926
927
928
929
930


  int Mesh::newDOFFct1(ElInfo* ei) {
    ei->getElement()->newDOFFct1(compressAdmin);
    return 0;
  }

  int Mesh::newDOFFct2(ElInfo* ei) {
    ei->getElement()->newDOFFct2(compressAdmin);
    return 0;
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
931
  void Mesh::serialize(std::ostream &out)
932
933
934
  {
    serializedDOFs.clear();

Thomas Witkowski's avatar
Thomas Witkowski committed
935
    out << name << "\n";
936

937
938
939
940
941
942
943
    SerUtil::serialize(out, dim);
    SerUtil::serialize(out, nVertices);
    SerUtil::serialize(out, nEdges);
    SerUtil::serialize(out, nLeaves);
    SerUtil::serialize(out, nElements);
    SerUtil::serialize(out, nFaces);
    SerUtil::serialize(out, maxEdgeNeigh);
944
945
946

    diam.serialize(out);

947
948
    SerUtil::serialize(out, preserveCoarseDOFs);
    SerUtil::serialize(out, nDOFEl);
949
950
951

    nDOF.serialize(out);

952
    SerUtil::serialize(out, nNodeEl);
953
954
955

    node.serialize(out);

956
957
958

    // === Write admins. ===

959
    int size = static_cast<int>(admin.size());
960
    SerUtil::serialize(out, size);
961
    for (int i = 0; i < size; i++)
962
963
      admin[i]->serialize(out);

964
965
966

    // === Write macroElements. ===

967
    size = static_cast<int>(macroElements.size());
968
    SerUtil::serialize(out, size);
969
    for (int i = 0; i < size; i++)
970
971
      macroElements[i]->serialize(out);

972
973
    SerUtil::serialize(out, elementIndex);
    SerUtil::serialize(out, initialized);
974

975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998

    // === Write periodic associations. ===
    int mapSize = periodicAssociations.size();
    SerUtil::serialize(out, mapSize);
    for (std::map<BoundaryType, VertexVector*>::iterator it = periodicAssociations.begin();
	 it != periodicAssociations.end(); ++it) {
      BoundaryType b = it->first;

      // Check which DOFAdmin is used for the current VertexVector we want to serialize.
      int ithAdmin = -1;
      for (int i = 0; i < static_cast<int>(admin.size()); i++) {
	if (admin[i] == it->second->getAdmin()) {
	  ithAdmin = i;
	  break;
	}
      }
      TEST_EXIT(ithAdmin >= 0)
	("No DOFAdmin found for serialization of periodic associations!\n");

      SerUtil::serialize(out, b);
      SerUtil::serialize(out, ithAdmin);
      it->second->serialize(out);
    }

999
1000
1001
    serializedDOFs.clear();
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
1002
  void Mesh::deserialize(std::istream &in)
1003
  {
1004
1005
    FUNCNAME("Mesh::deserialize()");

1006
1007
1008
1009
1010
1011
    serializedDOFs.clear();

    in >> name;
    in.get();

    int oldVal = dim;
1012
1013
    SerUtil::deserialize(in, dim);
    TEST_EXIT_DBG(oldVal == 0 || dim == oldVal)("Invalid dimension!\n");
1014

1015
1016
1017
1018
1019
1020
    SerUtil::deserialize(in, nVertices);
    SerUtil::deserialize(in, nEdges);
    SerUtil::deserialize(in, nLeaves);
    SerUtil::deserialize(in, nElements);
    SerUtil::deserialize(in, nFaces);
    SerUtil::deserialize(in, maxEdgeNeigh);
1021
1022
1023

    diam.deserialize(in);

1024
    SerUtil::deserialize(in, preserveCoarseDOFs);
1025
1026

    oldVal = nDOFEl;
1027
1028
    SerUtil::deserialize(in, nDOFEl);
    TEST_EXIT_DBG(oldVal == 0 || nDOFEl == oldVal)("Invalid nDOFEl!\n");
1029
1030
1031
1032

    nDOF.deserialize(in);

    oldVal = nNodeEl;
1033
1034
    SerUtil::deserialize(in, nNodeEl);
    TEST_EXIT_DBG(oldVal == 0 || nNodeEl == oldVal)("Invalid nNodeEl!\n");
1035
1036
1037

    node.deserialize(in);

1038
1039
1040

    // === Read admins. ===

1041
    int size;
1042
    SerUtil::deserialize(in, size);
1043
    admin.resize(size, NULL);
1044
    for (int i = 0; i < size; i++) {
1045
      if (!admin[i])
Thomas Witkowski's avatar
Thomas Witkowski committed
1046
	admin[i] = new DOFAdmin(this);
1047

1048
1049
1050
      admin[i]->deserialize(in);
    }

1051
    SerUtil::deserialize(in, size);
Thomas Witkowski's avatar
Thomas Witkowski committed
1052
    std::vector< std::vector<int> > neighbourIndices(size);
1053

1054
    for (int i = 0; i < static_cast<int>(macroElements.size()); i++)
1055
      if (macroElements[i])
Thomas Witkowski's avatar
Thomas Witkowski committed
1056
	delete macroElements[i];
1057
1058
1059
1060
1061
1062
1063
1064

    // All macro elements are stored in the list \ref macroElements with continous 
    // index from 0 to n - 1. But the macro element index may be different and may
    // contain holes (for example when macro elements were removed because of domain
    // decomposition based parallelization. Therefore we create a temporary map
    // from macro element indices to the continous index of \ref macroElements. This
    // will be used later to find the correct neighbours of the macro elements.
    std::map<int, int> elIndexVecIndex;
1065

1066
    macroElements.resize(size);
1067
    for (int i = 0; i < size; i++) {
Thomas Witkowski's avatar
Thomas Witkowski committed
1068
      macroElements[i] = new MacroElement(dim);
1069
1070
      macroElements[i]->writeNeighboursTo(&(neighbourIndices[i]));
      macroElements[i]->deserialize(in);
1071
      elIndexVecIndex[macroElements[i]->getIndex()] = i;
1072
1073
    }

1074
1075
    SerUtil::deserialize(in, elementIndex);
    SerUtil::deserialize(in, initialized);