DualTraverse.h 4.4 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
// ============================================================================
// ==                                                                        ==
// == AMDiS - Adaptive multidimensional simulations                          ==
// ==                                                                        ==
// ============================================================================
// ==                                                                        ==
// ==  crystal growth group                                                  ==
// ==                                                                        ==
// ==  Stiftung caesar                                                       ==
// ==  Ludwig-Erhard-Allee 2                                                 ==
// ==  53175 Bonn                                                            ==
// ==  germany                                                               ==
// ==                                                                        ==
// ============================================================================
// ==                                                                        ==
// ==  http://www.caesar.de/cg/AMDiS                                         ==
// ==                                                                        ==
// ============================================================================

/** \file DualTraverse.h */

#ifndef AMDIS_DUALTRAVERSE_H
#define AMDIS_DUALTRAVERSE_H

#include "Traverse.h"
#include "Flag.h"
#include "MemoryManager.h"

namespace AMDiS {

  class Mesh;
  class ElInfo;

34
  /// Parallel traversal of two meshes. 
35
36
37
38
39
  class DualTraverse
  {
  public:
    MEMORY_MANAGED(DualTraverse);

40
    DualTraverse() 
41
42
      : fillSubElemMat(false),
	basisFcts(NULL)
43
    {}
44

45
    ~DualTraverse() {}
46

47
    /// Start dual traversal
48
49
50
51
52
53
    bool traverseFirst(Mesh *mesh1, 
		       Mesh *mesh2, 
		       int level1, 
		       int level2, 
		       Flag flag1,
		       Flag flag2,
54
55
56
57
58
59
60
61
62
63
64
65
66
		       ElInfo **elInfo1,
		       ElInfo **elInfo2,
		       ElInfo **elInfoSmall,
		       ElInfo **elInfoLarge);

    /** \brief
     * Get next ElInfo combination
     */
    bool traverseNext(ElInfo **elInfoNext1,
		      ElInfo **elInfoNext2,
		      ElInfo **elInfoSmall,
		      ElInfo **elInfoLarge);

67
68
69
70
    bool check(ElInfo **elInfo1,
	       ElInfo **elInfo2,
	       ElInfo **elInfoSmall,
	       ElInfo **elInfoLarge) 
71
72
73
    {
      prepareNextStep(elInfo1, elInfo2, elInfoSmall, elInfoLarge);
      return true;
74
    }
Naumann, Andreas's avatar
Naumann, Andreas committed
75
76
    
    virtual bool skipEl1(ElInfo *elInfo) {
77
78
      return false;
    }
Naumann, Andreas's avatar
Naumann, Andreas committed
79
80

    virtual bool skipEl2(ElInfo *elInfo) {
81
82
      return false;
    }
Naumann, Andreas's avatar
Naumann, Andreas committed
83
    
84
    inline void setFillSubElemMat(bool b, const BasisFunction *fcts) {
85
      fillSubElemMat = b;
86
      basisFcts = fcts;
87
88
    }
      
89
90
91
92
93
94
95
96
97
98
  protected:
    /** \brief
     * Determines smaller and larger element, determines which element(s) has to 
     * be incremented in the next step 
     */
    void prepareNextStep(ElInfo **elInfo1,
			 ElInfo **elInfo2,
			 ElInfo **elInfoSmall,
			 ElInfo **elInfoLarge);

99
100
101
102
103
    void fillSubElInfo(ElInfo *elInfo1, 
		       ElInfo *elInfo2,
		       ElInfo *elInfoSmall,
		       ElInfo *elInfoLarge);

104
  protected:
105
    /// Stack for mesh 1
106
107
    TraverseStack stack1;

108
    /// Stack for mesh 2
109
110
111
112
113
114
    TraverseStack stack2;

    /** \brief
     * used to determine whether all small elements belonging to the large
     * element are traversed.
     */
115
    double rest;
116

117
    /// true if element 1 should be incremented (set in prepareNextStep())
118
    bool inc1;
119

120
    /// true if element 2 should be incremented (set in prepareNextStep())
121
    bool inc2;
122

123
    /// for level traverse of mesh 1
124
125
    int level1_;

126
    /// for level traverse of mesh 2
127
128
    int level2_;

129
    /// for leaf element level traverse of mesh 1
130
131
    bool callLeafElLevel1_;

132
    /// for leaf element level traverse of mesh 2
133
    bool callLeafElLevel2_;
134

135
136
137
138
139
140
    /** \brief
     * If true, during dual mesh traverse for the smaller element the transformation
     * matrix will be computed. This matrix defines the transformation mapping for 
     * points defined on the larger element to the coordinates of the smaller element.
     */
    bool fillSubElemMat;
141
142
143
144
145
146

    /** \brief
     * If \ref fillSubElemMat is set to true, the corresponding transformation
     * matrices are computed. These depend on the basis functions that are used.
     */
    const BasisFunction *basisFcts;
147
148
149
150
151
152
  };

}

#endif