Mesh.cc 40 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
31
32
33
34
35
36
37
38
#include "MacroElement.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 "PeriodicMap.h"
#include "Projection.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
39
#include "ElInfoStack.h"
40
#include "Serializer.h"
41
#include "Lagrange.h"
42
43
44
45
46
47
48
49
50

namespace AMDiS {

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

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

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


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

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

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


Thomas Witkowski's avatar
Thomas Witkowski committed
80
  std::vector<DegreeOfFreedom> Mesh::dof_used;
81
  const int Mesh::MAX_DOF = 100;
82
  std::map<std::pair<DegreeOfFreedom, int>, DegreeOfFreedom*> Mesh::serializedDOFs;
83

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

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

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

    elementPrototype->setIndex(-1);

128
129
    elementIndex = 0;
  }
130

131

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

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

147

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

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

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

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

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

184

185
    /* ====================== Copy macro elements =================== */
186
  
187
188
189
190
191
192
193
194
195
    // 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;
196

197
198
    macroElements.clear();

199
200
201
    // 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();
202
	 it != m.macroElements.end(); ++it, insertCounter++) {
203

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

207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
      // 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.
233
	if((*it)->getNeighbour(i)!=NULL) {
234
235
236
	macroElements[insertCounter]->
	  setNeighbour(i, macroElements[mapIndex[(*it)->getNeighbour(i)->getIndex()]]);
      }
237
      }
238
239
240
241
242
243
244
245
246
247
248
249
250
251
    }

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

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

    return *this;
  }

252

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

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

265

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

272

273
  void Mesh::removeMacroElements(std::set<MacroElement*>& macros,
Thomas Witkowski's avatar
Thomas Witkowski committed
274
				 const FiniteElemSpace *feSpace) 
275
276
277
  {
    FUNCNAME("Mesh::removeMacroElement()");

Thomas Witkowski's avatar
Thomas Witkowski committed
278
279
280
281
282
283
    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");

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

287
    // Map that stores for each dof pointer (which may have a list of dofs)
288
    // all macro element indices that own this dof.
Thomas Witkowski's avatar
Thomas Witkowski committed
289
290
    DofElMap dofsOwner;
    DofPosMap dofsPosIndex;
291

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

      elInfo = stack.traverseNext(elInfo);
    }		   

Thomas Witkowski's avatar
Thomas Witkowski committed
305

306
307
308
309
310
311
312
313
314
315
316
317
318
    // === Remove macro elements from mesh macro element list. ===

    // Removing arbitrary elements from an std::deque is very slow. Therefore, we
    // 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.

    std::deque<MacroElement*> newMacroElements;
    for (std::deque<MacroElement*>::iterator elIter = macroElements.begin();
	 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())
319
	newMacroElements.push_back(*elIter);     
320
    }
321

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

Thomas Witkowski's avatar
Thomas Witkowski committed
326

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

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

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

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

	(*macroIt)->getElement()->setElementData(elementDataPrototype->clone()); 
351
      }
352
353
354

      // 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
355
      // invalid.
356
      (*macroIt)->getElement()->setDofValid(false);
357
    }     
358
359


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

Thomas Witkowski's avatar
Thomas Witkowski committed
363
    for (DofElMap::iterator dofsIt = dofsOwner.begin(); 
364
365
366
367
368
369
370
371
372
373
374
375
376
377
	 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)
378
	freeDof(const_cast<DegreeOfFreedom*>(dofsIt->first), 
379
		dofsPosIndex[dofsIt->first]);      
380
381
    }

382

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

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

    std::set<const DegreeOfFreedom*> allVertices;

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

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

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

      elInfo = stack.traverseNext(elInfo);
    }

    nVertices = allVertices.size();

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

412

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

    localAdmin->setMesh(this);

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

    admin.push_back(localAdmin);

425
    nDofEl = 0;
426

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

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

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

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

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

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
466

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

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

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

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

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

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


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

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

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

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

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


Thomas Witkowski's avatar
Thomas Witkowski committed
534
  DegreeOfFreedom **Mesh::createDofPtrs()
535
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
536
    FUNCNAME("Mesh::createDofPtrs()");
537
538

    if (nNodeEl <= 0)
539
      return NULL;
540

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

545
    return ptrs;
546
547
  }

548

549
  void Mesh::freeDofPtrs(DegreeOfFreedom **ptrs)
550
  {
551
    FUNCNAME("Mesh::freeDofPtrs()");
552

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

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


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

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

    addDOFAdmin(localAdmin);

573
    return localAdmin;
574
575
576
577
578
579
580
  }


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

581
    for (int i = 0; i < static_cast<int>(admin.size()); i++) {
582
      if (admin[i]->getNumberOfDofs(VERTEX)) {
583
584
585
586
	if (!localAdmin)  
	  localAdmin = admin[i];
	else if (admin[i]->getSize() < localAdmin->getSize())
	  localAdmin = admin[i];
587
      }
588
589
    }

590
    return localAdmin;
591
592
  }

593

594
  void Mesh::freeDof(DegreeOfFreedom* dof, GeoIndex position)
595
  {
596
    FUNCNAME("Mesh::freeDof()");
597

598
    TEST_EXIT_DBG(position >= CENTER && position <= FACE)
599
      ("unknown position %d\n", position);
600

601
    int ndof = nDof[position];
602
603
    if (ndof) {
      if (!dof) {
604
	MSG("dof = NULL, but ndof = %d\n", ndof);
605
606
	return;
      }
607
    } else  {
608
609
610
      if (dof)
	MSG("dof != NULL, but ndof = 0\n");

611
612
      return;
    }
613

614
    TEST_EXIT_DBG(ndof <= MAX_DOF)
615
      ("ndof too big: ndof = %d, MAX_DOF = %d\n", ndof, MAX_DOF);
616

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

629
    delete [] dof;
630
    dof = NULL;
631
632
  }

633

634
635
  void Mesh::freeElement(Element* el)
  {
636
    freeDofPtrs(const_cast<DegreeOfFreedom**>(el->getDof()));
Thomas Witkowski's avatar
Thomas Witkowski committed
637
    delete el;
638
639
640
641
642
643
  }


  Element* Mesh::createNewElement(Element *parent)
  {
    FUNCNAME("Mesh::createNewElement()");
644
645

    TEST_EXIT_DBG(elementPrototype)("no element prototype\n");
646
647

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

Thomas Witkowski's avatar
Thomas Witkowski committed
649
    if (!parent && elementDataPrototype)
650
      el->setElementData(elementDataPrototype->clone()); 
Thomas Witkowski's avatar
Thomas Witkowski committed
651
    else
652
      el->setElementData(NULL); // must be done in ElementData::refineElementData()
653

654
655
656
    return el;
  }

657

658
659
  ElInfo* Mesh::createNewElInfo()
  {
660
661
    FUNCNAME("Mesh::createNewElInfo()");

662
    switch (dim) {
663
    case 1:
Thomas Witkowski's avatar
Thomas Witkowski committed
664
      return new ElInfo1d(this);
665
666
      break;
    case 2:
Thomas Witkowski's avatar
Thomas Witkowski committed
667
      return new ElInfo2d(this);
668
669
      break;
    case 3:
Thomas Witkowski's avatar
Thomas Witkowski committed
670
      return new ElInfo3d(this);
671
672
673
674
      break;
    default:
      ERROR_EXIT("invalid dim\n");
      return NULL;
675
    }
676
677
  }

678

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

    if (start_mel != NULL)
      mel = start_mel;
    else
Thomas Witkowski's avatar
Thomas Witkowski committed
693
      if (mel == NULL || mel->getElement()->getMesh() != this)
694
695
696
	mel = *(macroElements.begin());

    mel_info->setFillFlag(Mesh::FILL_COORDS);
697
    g_xy = &xy;
698
    g_xy0 = xy0;
699
    g_sp = sp;
700
701
702

    mel_info->fillMacroInfo(mel);

703
704
705
706
707
708
709
    // 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;
    macrosVisited.insert(mel->getIndex());

710
    int k;
711
712
    while ((k = mel_info->worldToCoord(xy, &lambda)) >= 0) {
      if (mel->getNeighbour(k)) {
713
714
715
716
717
	mel = mel->getNeighbour(k);
	if (macrosVisited.count(mel->getIndex()))
	  return false;

	macrosVisited.insert(mel->getIndex());
718
719
720
721
722
723
724
	mel_info->fillMacroInfo(mel);
	continue;
      }
      break;
    }

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

731
    return inside;
732
733
  }

734

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

    *elp = el_info->getElement();

Thomas Witkowski's avatar
Thomas Witkowski committed
747
    delete el_info;
748

749
    return val;
750
751
  }

752

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

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

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

785
	  return false;  /* ??? */
786
	} else {
787
	  return false;
788
	}
789
      }
790
791
    }

792
    ElInfo *c_el_info = createNewElInfo();
793

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

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

840
    if (dim == 3) {
841
842
843
844
845
846
847
848
849
850
851
852
853
      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);
	  ElInfo *c_el_info2 = createNewElInfo();

	  c_el_info2->fillElInfo(1-ichild, el_info);
Thomas Witkowski's avatar
Thomas Witkowski committed
854
	  int c_outside2 = c_el_info2->worldToCoord(*(g_xy), &c_lambda2);
855
856

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

	  if ((c_outside2 < 0) || (c_lambda2[c_outside2] > c_lambda[c_outside])) {
863
864
	    for (int i = 0; i <= dim; i++) 
	      c_lambda[i] = c_lambda2[i];	    
865
866
867
868
	    c_outside = c_outside2;
	    *c_el_info = *c_el_info2;
	    ichild = 1 - ichild;
	  }
Thomas Witkowski's avatar
Thomas Witkowski committed
869
	  delete c_el_info2;
870
871
872
873
874
875
	}
	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];
876
877
878
879
880
881
	  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]];
882
883
884
885
	  c_lambda[3] = 2.0 * lambda[1];
	} else {
	  c_el_info->fillElInfo(1, el_info);
	  c_lambda[0] = lambda[1] - lambda[0];
886
887
888
889
890
891
	  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]];
892
893
894
895
896
	  c_lambda[3] = 2.0 * lambda[0];
	}
      }
    }  /* DIM == 3 */

Thomas Witkowski's avatar
Thomas Witkowski committed
897
    inside = findElementAtPointRecursive(c_el_info, c_lambda, outside, final_el_info);
Thomas Witkowski's avatar
Thomas Witkowski committed
898
    delete c_el_info;
899

900
    return inside; 
901
902
  }