Revision 32e4bfbf98a60e761b1a1ac679774f6cb4f98b21 authored by Wenqing Wang on 30 June 2021, 13:26:29 UTC, committed by Dmitry Yu. Naumov on 05 July 2021, 10:50:41 UTC
1 parent be8cfd9
TestNodeSearch.cpp
/**
* \file
* \copyright
* Copyright (c) 2012-2021, 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/Raster.h"
#include "MeshLib/Elements/Element.h"
#include "MeshLib/Mesh.h"
#include "MeshLib/MeshEditing/DuplicateMeshComponents.h"
#include "MeshLib/MeshGenerators/MeshGenerator.h"
#include "MeshLib/MeshGenerators/RasterToMesh.h"
#include "MeshLib/MeshSearch/NodeSearch.h"
#include "MeshLib/Node.h"
TEST(NodeSearch, UnusedNodes)
{
std::array<double, 12> pix = {
{0, 0.1, 0.2, 0.1, 0, 0, 0.1, 0, 0, 0, -0.1, 0}};
GeoLib::RasterHeader header = {
4, 3, 1, MathLib::Point3d(std::array<double, 3>{{0, 0, 0}}), 1, -9999};
GeoLib::Raster const raster(std::move(header), pix.begin(), pix.end());
auto mesh =
MeshLib::RasterToMesh::convert(raster, MeshLib::MeshElemType::TRIANGLE,
MeshLib::UseIntensityAs::ELEVATION);
MeshLib::NodeSearch ns(*mesh);
ns.searchUnused();
std::vector<std::size_t> u_nodes = ns.getSearchedNodeIDs();
ASSERT_EQ(0, u_nodes.size());
std::vector<MeshLib::Node*> nodes =
MeshLib::copyNodeVector(mesh->getNodes());
nodes.push_back(new MeshLib::Node(-1, -1, -1));
std::vector<MeshLib::Element*> elems =
MeshLib::copyElementVector(mesh->getElements(), nodes);
MeshLib::Mesh mesh2("mesh2", nodes, elems);
MeshLib::NodeSearch ns2(mesh2);
ns2.searchUnused();
u_nodes = ns2.getSearchedNodeIDs();
ASSERT_EQ(1, u_nodes.size());
ASSERT_EQ(nodes.back()->getID(), u_nodes[0]);
}
TEST(NodeSearch, BoundaryNodes1D)
{
std::unique_ptr<MeshLib::Mesh> mesh(
MeshLib::MeshGenerator::generateLineMesh(5, 1.0));
MeshLib::NodeSearch ns(*mesh);
ns.searchBoundaryNodes();
std::vector<std::size_t> searched_nodes = ns.getSearchedNodeIDs();
ASSERT_EQ(2, searched_nodes.size());
ASSERT_EQ(0u, searched_nodes[0]);
ASSERT_EQ(5u, searched_nodes[1]);
}
TEST(NodeSearch, BoundaryNodes2D)
{
std::unique_ptr<MeshLib::Mesh> mesh(
MeshLib::MeshGenerator::generateRegularQuadMesh(5, 5, 1.0, 1.0));
MeshLib::NodeSearch ns(*mesh);
ns.searchBoundaryNodes();
std::vector<std::size_t> searched_nodes = ns.getSearchedNodeIDs();
ASSERT_EQ(20, searched_nodes.size());
for (auto nodeid : searched_nodes)
{
auto& node = *mesh->getNode(nodeid);
bool isOnBnd = false;
for (unsigned i = 0; i < mesh->getDimension(); i++)
{
if (node[i] == 0.0 || node[i] == 5.0)
{
isOnBnd = true;
break;
}
}
ASSERT_TRUE(isOnBnd);
}
}
TEST(NodeSearch, BoundaryNodes3D)
{
std::unique_ptr<MeshLib::Mesh> mesh(
MeshLib::MeshGenerator::generateRegularHexMesh(5, 5, 5, 1.0, 1.0, 1.0));
MeshLib::NodeSearch ns(*mesh);
ns.searchBoundaryNodes();
std::vector<std::size_t> searched_nodes = ns.getSearchedNodeIDs();
ASSERT_EQ(152u, searched_nodes.size());
for (auto nodeid : searched_nodes)
{
auto& node = *mesh->getNode(nodeid);
bool isOnBnd = false;
for (unsigned i = 0; i < mesh->getDimension(); i++)
{
if (node[i] == 0.0 || node[i] == 5.0)
{
isOnBnd = true;
break;
}
}
ASSERT_TRUE(isOnBnd);
}
}
Computing file changes ...