forked from ufz/ogs
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTestQuadraticMesh.cpp
215 lines (185 loc) · 7.81 KB
/
TestQuadraticMesh.cpp
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
/**
* \copyright
* Copyright (c) 2012-2020, OpenGeoSys Community (http://www.opengeosys.org)
* Distributed under a Modified BSD License.
* See accompanying file LICENSE.txt or
* http://www.opengeosys.org/project/license
*
*/
#include "gtest/gtest.h"
#include <memory>
#include "GeoLib/Polyline.h"
#include "GeoLib/PolylineVec.h"
#include "MeshLib/Elements/Element.h"
#include "MeshLib/Mesh.h"
#include "MeshLib/MeshGenerators/MeshGenerator.h"
#include "MeshLib/MeshGenerators/QuadraticMeshGenerator.h"
#include "MeshLib/Node.h"
#include "MeshGeoToolsLib/AppendLinesAlongPolyline.h"
TEST(MeshLib, QuadraticOrderMesh_Line)
{
using namespace MeshLib;
std::unique_ptr<Mesh> linear_mesh(MeshGenerator::generateLineMesh(
1, std::size_t(2)));
std::unique_ptr<Mesh> mesh(createQuadraticOrderMesh(*linear_mesh));
ASSERT_EQ(5u, mesh->getNumberOfNodes());
ASSERT_EQ(3u, mesh->getNumberOfBaseNodes());
ASSERT_EQ(2u, mesh->getNumberOfElements());
for (MeshLib::Element const* e : mesh->getElements())
{
ASSERT_EQ(MeshLib::CellType::LINE3, e->getCellType());
ASSERT_EQ(2u, e->getNumberOfBaseNodes());
ASSERT_EQ(3u, e->getNumberOfNodes());
for (unsigned i = 0; i < e->getNumberOfBaseNodes(); i++)
{
ASSERT_TRUE(mesh->isBaseNode(e->getNodeIndex(i)));
}
for (unsigned i = e->getNumberOfBaseNodes(); i < e->getNumberOfNodes();
i++)
{
ASSERT_FALSE(mesh->isBaseNode(e->getNodeIndex(i)));
}
}
for (MeshLib::Node const* node : mesh->getNodes())
{
if (node->getID() == 1)
{
ASSERT_EQ(2u, node->getElements().size());
ASSERT_EQ(5u, node->getConnectedNodes().size());
}
else
{
ASSERT_EQ(1u, node->getElements().size());
ASSERT_EQ(3u, node->getConnectedNodes().size());
}
}
}
TEST(MeshLib, QuadraticOrderMesh_Quad)
{
using namespace MeshLib;
std::unique_ptr<Mesh> linear_mesh(MeshGenerator::generateRegularQuadMesh(
1, 1, std::size_t(2), std::size_t(2)));
std::unique_ptr<Mesh> mesh(createQuadraticOrderMesh(*linear_mesh));
ASSERT_EQ(21u, mesh->getNumberOfNodes());
ASSERT_EQ(9u, mesh->getNumberOfBaseNodes());
ASSERT_EQ(4u, mesh->getNumberOfElements());
for (MeshLib::Element const* e : mesh->getElements())
{
ASSERT_EQ(MeshLib::CellType::QUAD8, e->getCellType());
ASSERT_EQ(4u, e->getNumberOfBaseNodes());
ASSERT_EQ(8u, e->getNumberOfNodes());
for (unsigned i = 0; i < e->getNumberOfBaseNodes(); i++)
{
ASSERT_TRUE(mesh->isBaseNode(e->getNodeIndex(i)));
}
for (unsigned i = e->getNumberOfBaseNodes(); i < e->getNumberOfNodes();
i++)
{
ASSERT_FALSE(mesh->isBaseNode(e->getNodeIndex(i)));
}
}
auto const& mesh_nodes = mesh->getNodes();
// Count nodes shared by four elements and also connected to all 21 other
// nodes.
ASSERT_EQ(1, std::count_if(mesh_nodes.begin(), mesh_nodes.end(),
[](Node* const n) {
return (n->getElements().size() == 4) &&
(n->getConnectedNodes().size() == 21);
}));
// Count nodes belonging to one element and also connected to all 8 other
// nodes of that corner element.
ASSERT_EQ(12, std::count_if(mesh_nodes.begin(), mesh_nodes.end(),
[](Node* const n) {
return (n->getElements().size() == 1) &&
(n->getConnectedNodes().size() == 8);
}));
// Count nodes shared by two elements and also connected to the 13 other
// nodes of the two elements.
ASSERT_EQ(8, std::count_if(mesh_nodes.begin(), mesh_nodes.end(),
[](Node* const n) {
return (n->getElements().size() == 2) &&
(n->getConnectedNodes().size() == 13);
}));
}
TEST(MeshLib, QuadraticOrderMesh_LineQuad)
{
using namespace MeshLib;
std::unique_ptr<Mesh> linear_quad_mesh(MeshGenerator::generateRegularQuadMesh(
1, 1, std::size_t(2), std::size_t(2)));
std::unique_ptr<Mesh> linear_mesh;
{
std::vector<GeoLib::Point*> pnts;
pnts.push_back(new GeoLib::Point(0,0.5,0,0));
pnts.push_back(new GeoLib::Point(1,0.5,0,1));
auto* ply = new GeoLib::Polyline(pnts);
ply->addPoint(0);
ply->addPoint(1);
std::unique_ptr<std::vector<GeoLib::Polyline*>> plys(new std::vector<GeoLib::Polyline*>());
plys->push_back(ply);
GeoLib::PolylineVec ply_vec("", std::move(plys));
linear_mesh = MeshGeoToolsLib::appendLinesAlongPolylines(
*linear_quad_mesh, ply_vec);
for (auto p : pnts)
{
delete p;
}
}
ASSERT_EQ(6u, linear_mesh->getNumberOfElements());
std::unique_ptr<Mesh> mesh(createQuadraticOrderMesh(*linear_mesh));
ASSERT_EQ(21u, mesh->getNumberOfNodes());
ASSERT_EQ(9u, mesh->getNumberOfBaseNodes());
ASSERT_EQ(6u, mesh->getNumberOfElements());
for (MeshLib::Element const* e : mesh->getElements())
{
if (e->getID() < 4)
{
ASSERT_EQ(MeshLib::CellType::QUAD8, e->getCellType());
ASSERT_EQ(4u, e->getNumberOfBaseNodes());
ASSERT_EQ(8u, e->getNumberOfNodes());
}
else
{
ASSERT_EQ(MeshLib::CellType::LINE3, e->getCellType());
ASSERT_EQ(2u, e->getNumberOfBaseNodes());
ASSERT_EQ(3u, e->getNumberOfNodes());
}
for (unsigned i = 0; i < e->getNumberOfBaseNodes(); i++)
{
ASSERT_TRUE(mesh->isBaseNode(e->getNodeIndex(i)));
}
for (unsigned i = e->getNumberOfBaseNodes(); i < e->getNumberOfNodes();
i++)
{
ASSERT_FALSE(mesh->isBaseNode(e->getNodeIndex(i)));
}
}
auto const& mesh_nodes = mesh->getNodes();
// Count nodes shared by six elements and also connected to all 21 other
// nodes.
ASSERT_EQ(1, std::count_if(mesh_nodes.begin(), mesh_nodes.end(),
[](Node* const n) {
return (n->getElements().size() == 6) &&
(n->getConnectedNodes().size() == 21);
}));
// Count nodes belonging to one element and also connected to all 8 other
// nodes of that corner element.
ASSERT_EQ(12, std::count_if(mesh_nodes.begin(), mesh_nodes.end(),
[](Node* const n) {
return (n->getElements().size() == 1) &&
(n->getConnectedNodes().size() == 8);
}));
// Count nodes shared by three elements (quads and the line) and also
// connected to the 13 other nodes of the two elements.
ASSERT_EQ(4, std::count_if(mesh_nodes.begin(), mesh_nodes.end(),
[](Node* const n) {
return (n->getElements().size() == 3) &&
(n->getConnectedNodes().size() == 13);
}));
// Count nodes shared by two elements (quads) and also connected to the 13
// other nodes of the two elements.
ASSERT_EQ(4, std::count_if(mesh_nodes.begin(), mesh_nodes.end(),
[](Node* const n) {
return (n->getElements().size() == 2) &&
(n->getConnectedNodes().size() == 13);
}));
}