RefinementManager3d.cc 24.5 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.


13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include "RefinementManager.h"
#include "Mesh.h"
#include "Traverse.h"
#include "ElInfo.h"
#include "DOFAdmin.h"
#include "AdaptStationary.h"
#include "AdaptInstationary.h"
#include "FixVec.h"
#include "RCNeighbourList.h"
#include "ProblemStatBase.h"
#include "DOFIndexed.h"
#include "Projection.h"
#include "DOFVector.h"
#include "PeriodicBC.h"
#include "VertexVector.h"
28
#include "Debug.h"
29
30
31

namespace AMDiS {

32
  void RefinementManager3d::bisectTetrahedron(RCNeighbourList& refineList, 
33
34
35
36
					      int index,
					      DegreeOfFreedom* dof[3],
					      DegreeOfFreedom *edge[2])
  {
37
    Tetrahedron *el = 
38
      dynamic_cast<Tetrahedron*>(const_cast<Element*>(refineList.getElement(index)));
39
    Tetrahedron *child[2];
40
    int el_type = refineList.getType(index);
41
42
43
44

    child[0] = dynamic_cast<Tetrahedron*>(mesh->createNewElement(el));
    child[1] = dynamic_cast<Tetrahedron*>(mesh->createNewElement(el));
  
45
    int mark = std::max(0, el->getMark() - 1);
46
47
48
49
50
51
52
53
54
55
56
57
58
    child[0]->setMark(mark);
    child[1]->setMark(mark);
    el->setMark(0);

    /****************************************************************************/
    /*  transfer hidden data from parent to children                            */
    /****************************************************************************/

    el->refineElementData(child[0], child[1], el_type);

    el->setFirstChild(child[0]);
    el->setSecondChild(child[1]);

59
60
    if (child[0]->getMark() > 0)
      doMoreRecursiveRefine = true;
61
62

    int n_vertices = mesh->getGeo(VERTEX);
63
64
    child[0]->setDof(n_vertices - 1, dof[0]);
    child[1]->setDof(n_vertices - 1, dof[0]);
65

66
    for (int i = 0; i < n_vertices - 1; i++) {
67
      child[0]->
68
	setDof(i, const_cast<int*>(el->getDof(Tetrahedron::childVertex[el_type][0][i])));
69
      child[1]->
70
	setDof(i, const_cast<int*>(el->getDof(Tetrahedron::childVertex[el_type][1][i])));
71
    }
72
73
74
75
76
77
78
79
80
81
82
83
    /****************************************************************************/
    /*  there is one more leaf element and two more hierachical elements        */
    /****************************************************************************/

    mesh->incrementNumberOfLeaves(1);
    mesh->incrementNumberOfElements(2);

    /****************************************************************************/
    /* first set those dof pointers for higher order without neighbour          */
    /* information                                                              */
    /****************************************************************************/

84
    if (mesh->getNumberOfDofs(EDGE)) {
85
      int node = mesh->getNode(EDGE);
86

87
88
89
90
91
      /****************************************************************************/
      /*  set pointers to those dof's that are handed on from the parant          */
      /****************************************************************************/
      
      child[0]->
92
93
	setDof(node, 
	       const_cast<int*>(el->getDof(node + Tetrahedron::childEdge[el_type][0][0])));
94
      child[1]->
95
96
	setDof(node, 
	       const_cast<int*>(el->getDof(node + Tetrahedron::childEdge[el_type][1][0])));
97
      child[0]->
98
99
	setDof(node + 1, 
	       const_cast<int*>(el->getDof(node + Tetrahedron::childEdge[el_type][0][1])));
100
      child[1]->
101
102
	setDof(node + 1, 
	       const_cast<int*>(el->getDof(node + Tetrahedron::childEdge[el_type][1][1])));
103
      child[0]->
104
105
	setDof(node + 3, 
	       const_cast<int*>(el->getDof(node + Tetrahedron::childEdge[el_type][0][3])));
106
      child[1]->
107
108
	setDof(node + 3, 
	       const_cast<int*>(el->getDof(node + Tetrahedron::childEdge[el_type][1][3])));
109
110
111
112
113
      
      /****************************************************************************/
      /*  adjust pointers to the dof's in the refinement edge                     */
      /****************************************************************************/
      
114
115
116
      if (el->getDof(0) == edge[0]) {
	child[0]->setDof(node + 2, dof[1]);
	child[1]->setDof(node + 2, dof[2]);
117
      } else {
118
119
	child[0]->setDof(node + 2, dof[2]);
	child[1]->setDof(node + 2, dof[1]);
120
121
122
      }
    }
    
123
    if (mesh->getNumberOfDofs(FACE)) {
124
      int node = mesh->getNode(FACE);    
125
126
127
128
129
      
      /****************************************************************************/
      /*  set pointers to those dof's that are handed on from the parant          */
      /****************************************************************************/
      
130
131
      child[0]->setDof(node + 3, const_cast<int*>(el->getDof(node + 1)));
      child[1]->setDof(node + 3, const_cast<int*>(el->getDof(node + 0)));
132
133
134
135
136
      
      /****************************************************************************/
      /*  get new dof for the common face of child0 and child1                    */
      /****************************************************************************/
      
137
      DegreeOfFreedom *newDOF = mesh->getDof(FACE);
138
139
      child[0]->setDof(node, static_cast<int*>(newDOF));
      child[1]->setDof(node, static_cast<int*>(newDOF));
140
141
    }
    
142
    if (mesh->getNumberOfDofs(CENTER)) {
143
      int node = mesh->getNode(CENTER);
144
145
      child[0]->setDof(node, const_cast<int*>(mesh->getDof(CENTER)));
      child[1]->setDof(node, const_cast<int*>(mesh->getDof(CENTER)));
146
    }
147

148
    if (mesh->getNumberOfDofs(EDGE) || mesh->getNumberOfDofs(FACE))
149
      fillPatchConnectivity(refineList, index);
150
  }
151

152

153
  void RefinementManager3d::fillPatchConnectivity(RCNeighbourList &refineList,
154
155
156
						  int index)
  {
    FUNCNAME("RefinementManager3d::fillPatchConnectivity");
Thomas Witkowski's avatar
Thomas Witkowski committed
157

158
159
    Element *el = refineList.getElement(index);
    int el_type = refineList.getType(index);
160
    int n_type = 0;
161
    int dir, adjc, i_neigh, j_neigh;
162
    int node0, node1, oppVertex = 0;
163

164
    for (dir = 0; dir < 2; dir++) {
165
      Element *neigh = refineList.getNeighbourElement(index, dir);
166
      if (neigh) {
167
168
	n_type = refineList.getType(refineList.getNeighbourNr(index, dir));
	oppVertex = refineList.getOppVertex(index, dir);
169
170
      }

171
      if (!neigh || neigh->isLeaf()) {
172
173

	/****************************************************************************/
174
175
176
	/*  get new dof's in the midedge of the face of el and for the two midpoints*/
	/*  of the sub-faces. If face is an interior face those pointers have to be */
	/*  adjusted by the neighbour element also (see below)                      */
177
178
	/****************************************************************************/

179
	if (mesh->getNumberOfDofs(EDGE)) {
180
181
182
	  node0 = node1 = mesh->getNode(EDGE);
	  node0 += Tetrahedron::nChildEdge[el_type][0][dir];
	  node1 += Tetrahedron::nChildEdge[el_type][1][dir];
183
	  DegreeOfFreedom *newDOF = mesh->getDof(EDGE);
184
185
	  (const_cast<Element*>(el->getFirstChild()))->setDof(node0, newDOF);
	  (const_cast<Element*>(el->getSecondChild()))->setDof(node1, newDOF);
186
	}
187
	if (mesh->getNumberOfDofs(FACE)) {
188
	  node0 = mesh->getNode(FACE) + Tetrahedron::nChildFace[el_type][0][dir];
189
	  (const_cast<Element*>(el->getFirstChild()))->setDof(node0, mesh->getDof(FACE));
190
	  node1 = mesh->getNode(FACE) + Tetrahedron::nChildFace[el_type][1][dir];
191
	  (const_cast<Element*>(el->getSecondChild()))->setDof(node1, mesh->getDof(FACE));
192
193
	}
      } else {     /*   if (!neigh  ||  !neigh->child[0])                         */
194
	/****************************************************************************/
195
196
	/*  interior face and neighbour has been refined, look for position at the  */
	/*  refinement edge                                                         */
197
	/****************************************************************************/
198
      
199
	if (el->getDof(0) == neigh->getDof(0)) {
200
	  // Same position at refinement edge.
201
202
	  adjc = 0;
	} else {
203
	  // Different position at refinement edge.
204
205
	  adjc = 1;
	}
206

207
208
	for (int i = 0; i < 2; i++) {
	  int j = Tetrahedron::adjacentChild[adjc][i];
209

210
	  i_neigh = Tetrahedron::nChildFace[el_type][i][dir];
211
	  j_neigh = Tetrahedron::nChildFace[n_type][j][oppVertex - 2];
212

213
214
215
216
	  /****************************************************************************/
	  /*  adjust dof pointer in the edge in the common face of el and neigh and   */
	  /*  the dof pointer in the sub-face child_i-child_j (allocated by neigh!)   */
	  /****************************************************************************/
217

218
	  if (mesh->getNumberOfDofs(EDGE)) {
219
	    node0 = mesh->getNode(EDGE) + Tetrahedron::nChildEdge[el_type][i][dir];
220
	    node1 = mesh->getNode(EDGE) + Tetrahedron::nChildEdge[n_type][j][oppVertex - 2];
221

222
	    TEST_EXIT_DBG(neigh->getChild(j)->getDof(node1))
223
224
	      ("no dof on neighbour %d at node %d\n", 
	       neigh->getChild(j)->getIndex(), node1);
225

226
	    (const_cast<Element*>(el->getChild(i)))->
227
	      setDof(node0, const_cast<int*>(neigh->getChild(j)->getDof(node1)));
228
	  }
229
	  if (mesh->getNumberOfDofs(FACE)) {
230
231
	    node0 = mesh->getNode(FACE) + i_neigh;
	    node1 = mesh->getNode(FACE) + j_neigh;
232

233
	    TEST_EXIT_DBG(neigh->getChild(j)->getDof(node1))
Thomas Witkowski's avatar
Thomas Witkowski committed
234
	      ("No DOF on neighbour %d at node %d!\n",
235
	       neigh->getChild(j)->getIndex(), node1);
236

237
	    (const_cast<Element*>(el->getChild(i)))->
238
	      setDof(node0, const_cast<int*>(neigh->getChild(j)->getDof(node1)));
239
240
	  }

241
242
243
	}  /*   for (i = 0; i < 2; i++)                                       */
      }    /*   else of   if (!neigh  ||  !neigh->child[0])                   */
    }      /*   for (dir = 0; dir < 2; dir++)                                 */
244
245
246
  }


247
  void RefinementManager3d::newCoordsFct(ElInfo *el_info, RCNeighbourList &refineList)
248
  {
249
250
    FUNCNAME("RefinementManager3d::newCoordsFct()");

251
252
    Element *el = el_info->getElement();
    DegreeOfFreedom *edge[2];
253
    ElInfo *elinfo = el_info;
254
255
256
    int dow = Global::getGeo(WORLD);
    Projection *projector = el_info->getProjection(0);

257
258
    if (!projector || projector->getType() != VOLUME_PROJECTION)
      projector = el_info->getProjection(4);    
259
260

    if (el->getFirstChild() && projector && (!el->isNewCoordSet())) {
Thomas Witkowski's avatar
Thomas Witkowski committed
261
      WorldVector<double> *new_coord = new WorldVector<double>;
262

263
264
      for (int j = 0; j < dow; j++)
	(*new_coord)[j] = (el_info->getCoord(0)[j] + el_info->getCoord(1)[j]) * 0.5;
265
266
267
268
269
270
271
272

      projector->project(*new_coord);

      el->setNewCoord(new_coord);
      /****************************************************************************/
      /*  now, information should be passed on to patch neighbours...             */
      /*  get the refinement patch                                                */
      /****************************************************************************/
273
274
      refineList.setElement(0, el);
      refineList.setElType(0, el_info->getType());
275
      int n_neigh = 1;
276

277
      for (int i = 0; i < 2; i++)
278
	edge[i] = const_cast<int*>(el_info->getElement()->getDof(i));
279

280
      if (getRefinePatch(&elinfo, edge, 0, refineList, &n_neigh)) {
281
282
	// Domain's boundary was reached while looping around the refinement edge.

283
	getRefinePatch(&elinfo, edge, 1, refineList, &n_neigh);
284
285
      }

286
      for (int i = 1; i < n_neigh; i++) {            /* start with 1, as list[0]=el */
287
288
289
	TEST(!refineList.getElement(i)->isNewCoordSet())
	  ("non-nil new_coord in el %d refineList[%d] el %d (n_neigh=%d)\n",
	   el->getIndex(), i, refineList.getElement(i)->getIndex(), n_neigh);
290
	
291
	refineList.getElement(i)->setNewCoord(el->getNewCoord());
292
      }
293
294
295
    }
  }

296

297
  void RefinementManager3d::setNewCoords(int macroEl)
298
  {
299
    RCNeighbourList refineList(mesh->getMaxEdgeNeigh());
300
301
302
303
304
305
306
307
308
309
310
311
312
    ElInfo *elInfo;

    if (macroEl == -1)
      elInfo = stack->traverseFirst(mesh, -1, 
				    Mesh::CALL_EVERY_EL_PREORDER | 
				    Mesh::FILL_BOUND | Mesh::FILL_COORDS | 
				    Mesh::FILL_NEIGH);
    else
      elInfo = stack->traverseFirstOneMacro(mesh, macroEl, -1,
					    Mesh::CALL_EVERY_EL_PREORDER | 
					    Mesh::FILL_BOUND | Mesh::FILL_COORDS | 
					    Mesh::FILL_NEIGH);
    
313

314
    while (elInfo) {
315
      newCoordsFct(elInfo, refineList);
316
      elInfo = stack->traverseNext(elInfo);
317
318
319
320
321
    }
  }


  DegreeOfFreedom RefinementManager3d::refinePatch(DegreeOfFreedom *edge[2], 
322
						   RCNeighbourList &refineList,
323
324
						   int n_neigh, bool bound)
  {
325
    Tetrahedron *el = 
326
      dynamic_cast<Tetrahedron*>(const_cast<Element*>(refineList.getElement(0)));
327
328
329
330
331
332
333
    /* first element in the list */
    DegreeOfFreedom *dof[3] = {NULL, NULL, NULL};

    /****************************************************************************/
    /*  get new dof's in the refinement edge                                    */
    /****************************************************************************/

334
    dof[0] = mesh->getDof(VERTEX);
335
336
    mesh->incrementNumberOfVertices(1);
  
337
    if (mesh->getNumberOfDofs(EDGE)) {
338
339
      dof[1] = mesh->getDof(EDGE);
      dof[2] = mesh->getDof(EDGE);
340
    }
341

342
    for (int i = 0; i < n_neigh; i++)
343
344
345
346
347
      bisectTetrahedron(refineList, i, dof, edge);

    /****************************************************************************/
    /*  if there are functions to interpolate data to the finer grid, do so     */
    /****************************************************************************/
348
    for (int iadmin = 0; iadmin < mesh->getNumberOfDOFAdmin(); iadmin++) {
349
      std::list<DOFIndexedBase*>::iterator it;
350
      DOFAdmin* admin = const_cast<DOFAdmin*>(&mesh->getDofAdmin(iadmin));
351
      std::list<DOFIndexedBase*>::iterator end = admin->endDOFIndexed();
352
      for (it = admin->beginDOFIndexed(); it != end; it++)
353
	(*it)->refineInterpol(refineList, n_neigh);
354
355
    }

356
357
358
359
360
    if (!mesh->queryCoarseDOFs()) {
      /****************************************************************************/
      /*  if there should be no dof information on interior leaf elements remove  */
      /*  dofs from edges, faces and the centers of parents                       */
      /****************************************************************************/
361
      if (mesh->getNumberOfDofs(EDGE)) {
362
	/****************************************************************************/
363
	/*  remove dof of the midpoint of the common refinement edge                */
364
365
	/****************************************************************************/

366
	el = dynamic_cast<Tetrahedron*>(const_cast<Element*>(refineList.getElement(0)));
367
	mesh->freeDof(const_cast<int*>(el->getDof(mesh->getNode(EDGE))), EDGE);
368
      }
369
      
370
371
372
      if (mesh->getNumberOfDofs(EDGE) || 
	  mesh->getNumberOfDofs(FACE) ||
	  mesh->getNumberOfDofs(CENTER)) {
373
	for (int i = 0; i < n_neigh; i++)
374
	  refineList.removeDOFParent(i);
375
376
      }
    }
377
378
379
380
381
382
383


    /****************************************************************************/
    /*  update the number of edges and faces; depends whether refinement edge   */
    /*  is a boundary edge or not                                               */
    /****************************************************************************/

384
385
    if (bound) {
      mesh->incrementNumberOfEdges(n_neigh + 2);
386
      mesh->incrementNumberOfFaces(2 * n_neigh + 1);
387
388
    } else {
      mesh->incrementNumberOfEdges(n_neigh + 1);
389
      mesh->incrementNumberOfFaces(2 * n_neigh);
390
391
    }
    
392
393
394
395
396
397
    return dof[0][0];
  }


  int RefinementManager3d::getRefinePatch(ElInfo **el_info, 
					  DegreeOfFreedom *edge[2], 
398
					  int direction,
399
					  RCNeighbourList &refineList, 
400
401
					  int *n_neigh)
  {
402
    FUNCNAME("RefinementManager3d::getRefinePatch()");
403

404
    int localNeighbour = 3 - direction;
405
406
407
    Tetrahedron *el = 
      dynamic_cast<Tetrahedron*>(const_cast<Element*>((*el_info)->getElement()));
    
408
    if ((*el_info)->getNeighbour(localNeighbour) == NULL)
Thomas Witkowski's avatar
Thomas Witkowski committed
409
      return 1;    
410
  
411
412
413
414
415
416
417
    int oppVertex = (*el_info)->getOppVertex(localNeighbour);
    int testIndex = (*el_info)->getNeighbour(localNeighbour)->getIndex();
    ElInfo *neighInfo = stack->traverseNeighbour3d((*el_info), localNeighbour);
    int neighElType = neighInfo->getType();

    TEST_EXIT_DBG(neighInfo->getElement()->getIndex() == testIndex)
      ("Should not happen!\n");
418

419
    Tetrahedron *neigh = 
420
      dynamic_cast<Tetrahedron*>(const_cast<Element*>(neighInfo->getElement())); 
421
422
423
    int vertices = mesh->getGeo(VERTEX);

    while (neigh != el) {
424
425
426
427
      // === Determine the common edge of the element and its neighbour. ===

      int edgeDof0, edgeDof1;
      for (edgeDof0 = 0; edgeDof0 < vertices; edgeDof0++)
428
	if (neigh->getDof(edgeDof0) == edge[0])
429
	  break;
430
      for (edgeDof1 = 0; edgeDof1 < vertices; edgeDof1++)
431
	if (neigh->getDof(edgeDof1) == edge[1])
432
	  break;
433

434
435
      if (edgeDof0 > 3 || edgeDof1 > 3) {
	for (edgeDof0 = 0; edgeDof0 < vertices; edgeDof0++)
436
	  if (mesh->associated(neigh->getDof(edgeDof0, 0), edge[0][0]))  
437
	    break;
438
	for (edgeDof1 = 0; edgeDof1 < vertices; edgeDof1++)
439
	  if (mesh->associated(neigh->getDof(edgeDof1, 0), edge[1][0]))  
440
	    break;
441
	    
442
443
	if (edgeDof0 > 3 || edgeDof1 > 3) {
	  for (edgeDof0 = 0; edgeDof0 < vertices; edgeDof0++)
444
	    if (mesh->indirectlyAssociated(neigh->getDof(edgeDof0, 0), edge[0][0]))  
445
	      break;
446
	  for (edgeDof1 = 0; edgeDof1 < vertices; edgeDof1++)
447
	    if (mesh->indirectlyAssociated(neigh->getDof(edgeDof1, 0), edge[1][0]))  
448
	      break;
449
	    
450
451
	  TEST_EXIT_DBG(edgeDof0 < vertices && edgeDof1 < vertices)
 	    ("dof %d or dof %d not found on element %d with nodes (%d %d %d %d)\n", 
452
453
 	     edge[0][0], edge[1][0], neigh->getIndex(), neigh->getDof(0,0),
 	     neigh->getDof(1, 0), neigh->getDof(2, 0), neigh->getDof(3, 0));
454
455
456
457

	}
      }

458
      TEST_EXIT_DBG(edgeDof0 < vertices && edgeDof1 < vertices)
459
	("dof %d or dof %d not found on element %d with nodes (%d %d %d %d)\n", 
460
461
	 edge[0][0], edge[1][0], neigh->getIndex(), neigh->getDof(0, 0),
	 neigh->getDof(1, 0), neigh->getDof(2, 0), neigh->getDof(3, 0));
462
463
464
465
466
467

      int edgeNo = Tetrahedron::edgeOfDofs[edgeDof0][edgeDof1];

      if (edgeNo) {
	// Only 0 can be a compatible commen refinement edge. Thus, neigh has not 
	// a compatible refinement edge. Refine it first.
468

469
	neigh->setMark(std::max(neigh->getMark(), 1));
470
471
472
473
474
475

	neighInfo = refineFunction(neighInfo);

	// === Now, go to a child at the edge and determine the opposite vertex ===
	// === for  this child; continue the looping around the edge with this  ===
	// === element.                                                         ===
476
	
477
478
479
	neighInfo = stack->traverseNext(neighInfo);
	neighElType = neighInfo->getType();
	bool reverseMode = stack->getTraverseFlag().isSet(Mesh::CALL_REVERSE_MODE);
480
	
481
	switch (edgeNo) {
482
	case 1: 
483
484
485
486
487
488
	  if (reverseMode) {
	    neighInfo = stack->traverseNext(neighInfo);
	    neighElType = neighInfo->getType();
	  }
	    
	  oppVertex = (oppVertex == 1 ? 3 : 2);
489
490
	  break;
	case 2: 
491
492
493
494
495
496
	  if (reverseMode) {
	    neighInfo = stack->traverseNext(neighInfo);
	    neighElType = neighInfo->getType();
	  }

	  oppVertex = (oppVertex == 2 ? 1 : 3);
497
498
	  break;
	case 3: 
499
500
501
502
503
504
505
	  if (!reverseMode) {
	    neighInfo = stack->traverseNext(neighInfo);
	    neighElType = neighInfo->getType();
	  }

	  if (neighElType != 1)
	    oppVertex = (oppVertex == 0 ? 3 : 2);
506
	  else
507
	    oppVertex = (oppVertex == 0 ? 3 : 1);
508
509
	  break;
	case 4:
510
511
512
513
514
515
516
	  if (!reverseMode) {
	    neighInfo = stack->traverseNext(neighInfo);
	    neighElType = neighInfo->getType();
	  }

	  if (neighElType != 1)
	    oppVertex = (oppVertex == 0 ? 3 : 1);
517
	  else
518
	    oppVertex = (oppVertex == 0 ? 3 : 2);
519
520
	  break;
	case 5:
521
522
523
524
525
	  if (neighElType != 1) {
	    if (!reverseMode) {
	      neighInfo = stack->traverseNext(neighInfo);
	      neighElType = neighInfo->getType();
	    }
526
	  }
527
	  oppVertex = 3;
528
	  break;
529
	}
530

531
	neigh = 
532
	  dynamic_cast<Tetrahedron*>(const_cast<Element*>(neighInfo->getElement()));
533
      } else {
534
535
536
	// Neigh is compatible devisible. Put neigh to the list of patch elements 
	// and go to next neighbour.

537
538
	TEST_EXIT_DBG(*n_neigh < mesh->getMaxEdgeNeigh())
	  ("too many neighbours %d in refine patch\n", *n_neigh);
539
		
540
541
	refineList.setElement(*n_neigh, neigh);
	refineList.setElType(*n_neigh, neighElType);
542
	
543
	// We have to go back to the starting element via oppVertex values.
544

545
	refineList.setOppVertex(*n_neigh, 0, oppVertex); 
546
	
547
548
549
550
551
552
553
554
555
556
557
558
559
560
	(*n_neigh)++;

	int i = (oppVertex != 3 ? 3 : 2);

	if (neighInfo->getNeighbour(i)) {
	  oppVertex = neighInfo->getOppVertex(i);
	  int testIndex = neighInfo->getNeighbour(i)->getIndex();

	  neighInfo = stack->traverseNeighbour3d(neighInfo, i);

	  TEST_EXIT_DBG(neighInfo->getElement()->getIndex() == testIndex)
	    ("Should not happen!\n");

	  neighElType = neighInfo->getType();
561
	  neigh = 
562
563
	    dynamic_cast<Tetrahedron*>(const_cast<Element*>(neighInfo->getElement()));
	} else {
564
	  break;
565
	}
566
      }
567
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
568
   
569
    if (neigh == el) {
570
571
      (*el_info) = neighInfo;

572
      return 0;
573
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
574
575

   
576
    // The domain's boundary is reached. Loop back to the starting el.
577
    
578
    int i = *n_neigh - 1;
579
    oppVertex = refineList.getOppVertex(i, 0);
580
    do {
581
      TEST_EXIT_DBG(neighInfo->getNeighbour(oppVertex) && i > 0)
Thomas Witkowski's avatar
Thomas Witkowski committed
582
	("While looping back domains boundary was reached or i == 0\n");
583
      oppVertex = refineList.getOppVertex(i--, 0);
584
585
586
587
588
589

      int testIndex = neighInfo->getNeighbour(oppVertex)->getIndex();
      neighInfo = stack->traverseNeighbour3d(neighInfo, oppVertex);

      int edgeDof0, edgeDof1;
      for (edgeDof0 = 0; edgeDof0 < vertices; edgeDof0++)
590
	if (neigh->getDof(edgeDof0) == edge[0])
591
592
	  break;
      for (edgeDof1 = 0; edgeDof1 < vertices; edgeDof1++)
593
	if (neigh->getDof(edgeDof1) == edge[1])
594
595
596
597
598
	  break;

      TEST_EXIT_DBG(neighInfo->getElement()->getIndex() == testIndex)
	("Should not happen!\n");
    } while (neighInfo->getElement() != el);
Thomas Witkowski's avatar
Thomas Witkowski committed
599

600
    (*el_info) = neighInfo;
601
602
    
    return 1;
603
604
605
606
607
608
  }


  ElInfo* RefinementManager3d::refineFunction(ElInfo* el_info)
  {
    FUNCNAME("RefinementManager3d::refineFunction()");
Thomas Witkowski's avatar
Thomas Witkowski committed
609

610
611
612
    Element *el = el_info->getElement();

    if (el->getMark() <= 0)  
613
614
      return el_info;

615
    int bound = false;
616
    DegreeOfFreedom *edge[2];
617

618
619
    // === Get memory for a list of all elements at the refinement edge. ===

620
621
622
    RCNeighbourList refineList(mesh->getMaxEdgeNeigh());
    refineList.setElType(0, el_info->getType());
    refineList.setElement(0, el);
623
624
625
626
627
    int n_neigh = 1;

    if (el_info->getProjection(0) && 
	el_info->getProjection(0)->getType() == VOLUME_PROJECTION)
      newCoords = true;
628
629


630
631
    // === Give the refinement edge the right orientation. ===

632
633
634
    if (el->getDof(0, 0) < el->getDof(1, 0)) {
      edge[0] = const_cast<DegreeOfFreedom*>(el->getDof(0));
      edge[1] = const_cast<DegreeOfFreedom*>(el->getDof(1));
635
    } else {
636
637
      edge[1] = const_cast<DegreeOfFreedom*>(el->getDof(0));
      edge[0] = const_cast<DegreeOfFreedom*>(el->getDof(1));
638
    }
639

640
641
642

    // === Traverse and refine the refinement patch. ====

643
    if (getRefinePatch(&el_info, edge, 0, refineList, &n_neigh)) {      
644
      // Domain's boundary was reached while looping around the refinement edge
645
      getRefinePatch(&el_info, edge, 1, refineList, &n_neigh);
646
647
      bound = true;
    }
648

649
    // fill neighbour information inside the patch in the refinement list
650
    refineList.fillNeighbourRelations(n_neigh, bound);
651

652
653

    // ============ Check for periodic boundary ============
654
655
656
657
658
659

    DegreeOfFreedom *next_edge[2];
    DegreeOfFreedom *first_edge[2] = {edge[0], edge[1]};
    DegreeOfFreedom *last_edge[2] = {NULL, NULL};
    int n_neigh_periodic;

660
661
    DegreeOfFreedom lastNewDof = -1;
    DegreeOfFreedom firstNewDof = -1;
662

663
    RCNeighbourList periodicList;
664

Thomas Witkowski's avatar
Thomas Witkowski committed
665
    while (edge[0] != NULL) {
666
667
668
      refineList.periodicSplit(edge, next_edge, 
			       &n_neigh, &n_neigh_periodic, 
			       periodicList);
669

670
      DegreeOfFreedom newDof = refinePatch(edge, periodicList, n_neigh_periodic, bound);
671

672
673
      if (firstNewDof == -1)
	firstNewDof = newDof;
674

675
676
677
      if (lastNewDof != -1) {
	for (std::map<int, VertexVector*>::iterator it = mesh->getPeriodicAssociations().begin();
	     it != mesh->getPeriodicAssociations().end(); ++it) {
678
679
	  if (it->second) {
	    if (((*(it->second))[edge[0][0]] == last_edge[0][0] &&
Thomas Witkowski's avatar
Thomas Witkowski committed
680
681
682
		 (*(it->second))[edge[1][0]] == last_edge[1][0]) || 
		((*(it->second))[edge[0][0]] == last_edge[1][0] &&
		 (*(it->second))[edge[1][0]] == last_edge[0][0])) {
683
684
	      (*(it->second))[lastNewDof] = newDof;
	      (*(it->second))[newDof] = lastNewDof;
Thomas Witkowski's avatar
Thomas Witkowski committed
685
	    } 
686
687
688
	  }
	}
      }
689
      lastNewDof = newDof;
690
691
692
693
694
695
696
697

      last_edge[0] = edge[0];
      last_edge[1] = edge[1];

      edge[0] = next_edge[0];
      edge[1] = next_edge[1];
    }

698
699
700
    if (lastNewDof != firstNewDof) {
      for (std::map<int, VertexVector*>::iterator it = mesh->getPeriodicAssociations().begin();
	   it != mesh->getPeriodicAssociations().end(); ++it) {
701
702
	if (it->second) {
	  if (((*(it->second))[first_edge[0][0]] == last_edge[0][0] &&
Thomas Witkowski's avatar
Thomas Witkowski committed
703
704
705
	       (*(it->second))[first_edge[1][0]] == last_edge[1][0]) || 
	      ((*(it->second))[first_edge[0][0]] == last_edge[1][0] &&
	       (*(it->second))[first_edge[1][0]] == last_edge[0][0])) {	    
706
707
	    (*(it->second))[lastNewDof] = firstNewDof;
	    (*(it->second))[firstNewDof] = lastNewDof;
Thomas Witkowski's avatar
Thomas Witkowski committed
708
	  }
709
710
711
712
713
714
	}
      }
    }
  
    stack->update();

Thomas Witkowski's avatar
Thomas Witkowski committed
715
    return el_info;
716
717
  }
}