Homec4science
Diffusion akantu (releases/10.1007/s40571-024-00788-x/mode_II) Browse

rAKA/src/geometry/mesh_segment_intersector_tmpl.hh
b35bf118a6e3releases/10.1007/s40571…

Last Change
Raw File

mesh_segment_intersector_tmpl.hh
View Options

/**
* Copyright (©) 2015-2023 EPFL (Ecole Polytechnique Fédérale de Lausanne)
* Laboratory (LSMS - Laboratoire de Simulation en Mécanique des Solides)
*
* This file is part of Akantu
*
* Akantu is free software: you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option) any
* later version.
*
* Akantu is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
* A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
* details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Akantu. If not, see <http://www.gnu.org/licenses/>.
*/
/* -------------------------------------------------------------------------- */
#ifndef AKANTU_MESH_SEGMENT_INTERSECTOR_TMPL_HH_
#define AKANTU_MESH_SEGMENT_INTERSECTOR_TMPL_HH_
#include "aka_common.hh"
#include "mesh_geom_common.hh"
#include "tree_type_helper.hh"
namespace akantu {
template <Int dim, ElementType type>
MeshSegmentIntersector<dim, type>::MeshSegmentIntersector(Mesh & mesh,
Mesh & result_mesh)
: parent_type(mesh), result_mesh(result_mesh) {
this->intersection_points = std::make_unique<Array<Real>>(0, dim);
this->constructData();
}
template <Int dim, ElementType type>
void MeshSegmentIntersector<dim, type>::computeIntersectionQuery(
const K::Segment_3 & query) {
AKANTU_DEBUG_IN();
std::list<result_type> result_list;
std::set<std::pair<K::Segment_3, Int>, segmentPairsLess> segment_set;
this->factory.getTree().all_intersections(query,
std::back_inserter(result_list));
this->computeSegments(result_list, segment_set, query);
// Arrays for storing nodes and connectivity
auto & nodes = result_mesh.getNodes();
auto & connectivity = result_mesh.getConnectivity(_segment_2);
// Arrays for storing associated element and physical name
bool valid_elemental_data = true;
Array<Element> * associated_element = nullptr;
Array<ID> * associated_physical_name = nullptr;
result_mesh.addConnectivityType(_segment_2, _not_ghost);
result_mesh.addConnectivityType(_segment_2, _ghost);
try {
associated_element =
&result_mesh.getData<Element>("associated_element", _segment_2);
associated_physical_name =
&result_mesh.getData<std::string>("physical_names", _segment_2);
} catch (debug::Exception & e) {
valid_elemental_data = false;
}
// Loop over the segment pairs
for (auto && [segment, element] : segment_set) {
if (segment.is_degenerate()) {
continue;
}
Vector<Idx, 2> segment_connectivity{result_mesh.getNbNodes(),
result_mesh.getNbNodes() + 1};
connectivity.push_back(segment_connectivity);
// Copy nodes
Vector<Real, dim> source;
Vector<Real, dim> target;
for (Int j = 0; j < dim; j++) {
source(j) = segment.source()[j];
target(j) = segment.target()[j];
}
nodes.push_back(source);
nodes.push_back(target);
// Copy associated element info
if (valid_elemental_data) {
associated_element->push_back(Element{type, element, _not_ghost});
associated_physical_name->push_back(current_physical_name);
}
}
AKANTU_DEBUG_OUT();
}
template <Int dim, ElementType type>
void MeshSegmentIntersector<dim, type>::computeMeshQueryIntersectionPoint(
const K::Segment_3 & /*query*/, Int /*nb_old_nodes*/) {
AKANTU_ERROR("The method: computeMeshQueryIntersectionPoint has not "
"been implemented in class MeshSegmentIntersector!");
}
template <Int dim, ElementType type>
void MeshSegmentIntersector<dim, type>::buildResultFromQueryList(
const std::list<K::Segment_3> & query_list) {
AKANTU_DEBUG_IN();
this->computeIntersectionQueryList(query_list);
AKANTU_DEBUG_OUT();
}
template <Int dim, ElementType type>
void MeshSegmentIntersector<dim, type>::computeSegments(
const std::list<result_type> & intersections,
std::set<pair_type, segmentPairsLess> & segments,
const K::Segment_3 & query) {
AKANTU_DEBUG_IN();
/*
* Number of intersections = 0 means
*
* - query is completely outside mesh
* - query is completely inside primitive
*
* We try to determine the case and still construct the segment list
*/
if (intersections.empty()) {
// We look at all the primitives intersected by two rays
// If there is one primitive in common, then query is inside
// that primitive
K::Ray_3 ray1(query.source(), query.target());
K::Ray_3 ray2(query.target(), query.source());
std::set<Int> ray1_results;
std::set<Int> ray2_results;
this->factory.getTree().all_intersected_primitives(
ray1, std::inserter(ray1_results, ray1_results.begin()));
this->factory.getTree().all_intersected_primitives(
ray2, std::inserter(ray2_results, ray2_results.begin()));
bool inside_primitive = false;
Int primitive_id = 0;
auto ray2_it = ray2_results.begin();
auto ray2_end = ray2_results.end();
// Test if first list contains an element of second list
for (; ray2_it != ray2_end && !inside_primitive; ++ray2_it) {
if (ray1_results.find(*ray2_it) != ray1_results.end()) {
inside_primitive = true;
primitive_id = *ray2_it;
}
}
if (inside_primitive) {
segments.insert(std::make_pair(query, primitive_id));
}
return;
}
for (auto && intersection : intersections) {
auto && el = intersection->second;
// Result of intersection is a segment
if (const K::Segment_3 * segment =
boost::get<K::Segment_3>(&intersection->first)) {
// Check if the segment was alread created
segments.insert(std::make_pair(*segment, el));
continue;
}
if (const K::Point_3 * point = boost::get<K::Point_3>(
&intersection->first)) { // Result of intersection is a point
// We only want to treat points differently if we're in 3D with Tetra4
// elements This should be optimized by compilator
if constexpr (dim == 3 and type == _tetrahedron_4) {
constexpr auto nb_nodes_per_element = Mesh::getNbNodesPerElement(type);
TreeTypeHelper<Triangle<K>, K>::container_type facets;
const auto nodes = make_view<dim>(this->mesh.getNodes()).begin();
auto connectivity =
make_view<nb_nodes_per_element>(this->mesh.getConnectivity(type))
.begin();
Matrix<Real, dim, nb_nodes_per_element> node_coordinates;
for (auto && [node_coords, node] :
zip(node_coordinates, connectivity[el])) {
node_coords = nodes[node];
}
this->factory.addPrimitive(node_coordinates, el, facets);
// Local tree
auto local_tree =
std::make_unique<TreeTypeHelper<Triangle<K>, K>::tree>(
facets.begin(), facets.end());
// Compute local intersections (with current element)
std::list<result_type> local_intersections;
local_tree->all_intersections(query,
std::back_inserter(local_intersections));
bool out_point_found = false;
for (auto && local_intersection : local_intersections) {
if (const auto * local_point =
boost::get<K::Point_3>(&local_intersection->first)) {
if (!comparePoints(*point, *local_point)) {
K::Segment_3 seg(*point, *local_point);
segments.insert(std::make_pair(seg, el));
out_point_found = true;
}
}
}
if (not out_point_found) {
using Point = TreeTypeHelper<Triangle<K>, K>::point_type;
Point a(node_coordinates(0, 0), node_coordinates(1, 0),
node_coordinates(2, 0));
Point b(node_coordinates(0, 1), node_coordinates(1, 1),
node_coordinates(2, 1));
Point c(node_coordinates(0, 2), node_coordinates(1, 2),
node_coordinates(2, 2));
Point d(node_coordinates(0, 3), node_coordinates(1, 3),
node_coordinates(2, 3));
K::Tetrahedron_3 tetra(a, b, c, d);
const K::Point_3 * inside_point = nullptr;
if (tetra.has_on_bounded_side(query.source()) &&
!tetra.has_on_boundary(query.source())) {
inside_point = &query.source();
} else if (tetra.has_on_bounded_side(query.target()) &&
!tetra.has_on_boundary(query.target())) {
inside_point = &query.target();
}
if (inside_point != nullptr) {
K::Segment_3 seg(*inside_point, *point);
segments.insert(std::make_pair(seg, el));
}
}
}
}
}
AKANTU_DEBUG_OUT();
}
} // namespace akantu
#endif // AKANTU_MESH_SEGMENT_INTERSECTOR_TMPL_HH_
c4science · Help