35 const std::vector<Dune::FieldVector<T,dimworld> >& grid1ElementCorners,
36 std::bitset<(1<<dim1)>& neighborIntersects1,
37 unsigned int grid1Index,
38 const Dune::GeometryType& grid2ElementType,
39 const std::vector<Dune::FieldVector<T,dimworld> >& grid2ElementCorners,
40 std::bitset<(1<<dim2)>& neighborIntersects2,
41 unsigned int grid2Index,
52 const auto& refElement1 = Dune::ReferenceElements<T,dim1>::general(grid1ElementType);
53 const auto& refElement2 = Dune::ReferenceElements<T,dim2>::general(grid2ElementType);
56 assert((
unsigned int)(refElement1.size(dim1)) == grid1ElementCorners.size());
57 assert((
unsigned int)(refElement2.size(dim2)) == grid2ElementCorners.size());
62 typedef MultiLinearGeometry<T,dim1,dimworld> Geometry1;
63 typedef MultiLinearGeometry<T,dim2,dimworld> Geometry2;
65 Geometry1 grid1Geometry(grid1ElementType, grid1ElementCorners);
66 Geometry2 grid2Geometry(grid2ElementType, grid2ElementCorners);
69 std::vector<Dune::FieldVector<T,dimworld> > scaledGrid1ElementCorners(grid1ElementCorners.size());
70 std::vector<Dune::FieldVector<T,dimworld> > scaledGrid2ElementCorners(grid2ElementCorners.size());
74 T scaling = min((grid1ElementCorners[0] - grid1ElementCorners[1]).two_norm(),
75 (grid2ElementCorners[0] - grid2ElementCorners[1]).two_norm());
78 for (
unsigned int i = 0; i < grid1ElementCorners.size(); ++i) {
79 scaledGrid1ElementCorners[i] = grid1ElementCorners[i];
80 scaledGrid1ElementCorners[i] *= (1.0/scaling);
82 for (
unsigned int i = 0; i < grid2ElementCorners.size(); ++i) {
83 scaledGrid2ElementCorners[i] = grid2ElementCorners[i];
84 scaledGrid2ElementCorners[i] *= (1.0/scaling);
88 typedef typename std::vector<Empty>::size_type size_type;
90 const int dimis = dim1 < dim2 ? dim1 : dim2;
91 const size_type n_intersectionnodes = dimis+1;
94 std::vector<FieldVector<T,dimworld> > scaledP(0), P(0);
95 std::vector<std::vector<int> > H,SX(1<<dim1),SY(1<<dim2);
96 FieldVector<T,dimworld> centroid;
98 std::vector<FieldVector<T,dim1> > g1local(n_intersectionnodes);
100 std::vector<FieldVector<T,dim2> > g2local(n_intersectionnodes);
104 scaledGrid2ElementCorners,
108 P.resize(scaledP.size());
109 for (
unsigned int i = 0; i < scaledP.size(); ++i) {
114 for (size_type i = 0; i < neighborIntersects1.size(); ++i) {
116 neighborIntersects1[i] = (SX[i].size() > 0);
118 neighborIntersects1[i] =
false;
120 for (size_type i = 0; i < neighborIntersects2.size(); ++i) {
122 neighborIntersects2[i] = (SY[i].size() > 0);
124 neighborIntersects2[i] =
false;
128 if (P.size() == n_intersectionnodes) {
130 for (i = 0; i < n_intersectionnodes; ++i) {
131 g1local[i] = grid1Geometry.local(P[i]);
132 g2local[i] = grid2Geometry.local(P[i]);
136 for (i = 0; i < n_intersectionnodes; ++i) {
141 }
else if (P.size() > n_intersectionnodes) {
144 std::vector<FieldVector<T,dimworld> > global(n_intersectionnodes);
148 for (size_type i=0; i < P.size(); i++)
150 centroid /=
static_cast<T
>(P.size()) ;
157 for (size_type i=0; i < H.size(); i++) {
158 int hs = H[i].size();
164 for ( size_type j=0 ; j < dimis; ++j) {
165 global[j]= P[H[i][j]];
169 global[dimis]=centroid;
172 for (size_type j = 0; j < n_intersectionnodes; ++j) {
173 g1local[j] = grid1Geometry.local(global[j]);
174 g2local[j] = grid2Geometry.local(global[j]);
178 for (size_type j = 0; j < n_intersectionnodes; ++j) {
void computeIntersections(const Dune::GeometryType &grid1ElementType, const std::vector< Dune::FieldVector< T, dimworld > > &grid1ElementCorners, std::bitset<(1<< dim1)> &neighborIntersects1, unsigned int grid1Index, const Dune::GeometryType &grid2ElementType, const std::vector< Dune::FieldVector< T, dimworld > > &grid2ElementCorners, std::bitset<(1<< dim2)> &neighborIntersects2, unsigned int grid2Index, std::vector< SimplicialIntersection > &intersections)
Compute the intersection between two overlapping elements.
Definition overlappingmerge.cc:34