Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F61494438
test_segment_intersection_triangle_3.cc
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Tue, May 7, 00:55
Size
4 KB
Mime Type
text/x-c
Expires
Thu, May 9, 00:55 (1 d, 23 h)
Engine
blob
Format
Raw Data
Handle
17519589
Attached To
rAKA akantu
test_segment_intersection_triangle_3.cc
View Options
/**
* @file test_segment_intersection_triangle_3.cc
*
* @author Lucas Frerot <lucas.frerot@epfl.ch>
* @author Clement Roux <clement.roux@epfl.ch>
*
* @date creation: Fri Feb 27 2015
* @date last modification: Tue Mar 13 2018
*
* @brief Tests the interface mesh generation
*
*
* @section LICENSE
*
* Copyright (©) 2015-2021 EPFL (Ecole Polytechnique Fédérale de Lausanne)
* Laboratory (LSMS - Laboratoire de Simulation en Mécanique des Solides)
*
* 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/>.
*
*/
/* -------------------------------------------------------------------------- */
#include "aka_common.hh"
#include "geom_helper_functions.hh"
#include "mesh_geom_common.hh"
#include "mesh_segment_intersector.hh"
#include "mesh_sphere_intersector.hh"
#include <iostream>
/* -------------------------------------------------------------------------- */
using
namespace
akantu
;
typedef
cgal
::
Cartesian
K
;
typedef
cgal
::
Spherical
SK
;
/* -------------------------------------------------------------------------- */
int
main
(
int
argc
,
char
*
argv
[])
{
initialize
(
""
,
argc
,
argv
);
debug
::
setDebugLevel
(
dblError
);
Math
::
setTolerance
(
1e-10
);
Mesh
mesh
(
2
),
interface_mesh
(
2
,
"interface_mesh"
);
mesh
.
read
(
"test_geometry_triangle.msh"
);
MeshSegmentIntersector
<
2
,
_triangle_3
>
intersector
(
mesh
,
interface_mesh
);
intersector
.
constructData
();
// Testing a segment going out of the mesh
K
::
Point_3
a
(
0
,
0.25
,
0
),
b
(
1
,
0.25
,
0
),
c
(
0.25
,
0
,
0
),
d
(
0.25
,
1
,
0
);
K
::
Segment_3
h_interface
(
a
,
b
),
v_interface
(
c
,
d
);
std
::
list
<
K
::
Segment_3
>
interface_list
;
interface_list
.
push_back
(
h_interface
);
interface_list
.
push_back
(
v_interface
);
intersector
.
computeIntersectionQueryList
(
interface_list
);
if
(
interface_mesh
.
getNbElement
(
_segment_2
)
!=
4
)
return
EXIT_FAILURE
;
Vector
<
Real
>
bary
(
2
);
Element
test
{
_segment_2
,
0
,
_not_ghost
};
interface_mesh
.
getBarycenter
(
test
,
bary
);
Real
first_bary
[]
=
{
0.125
,
0.25
};
if
(
!
Math
::
are_vector_equal
(
2
,
bary
.
data
(),
first_bary
))
return
EXIT_FAILURE
;
// Testing a segment completely inside an element
K
::
Point_3
e
(
0.1
,
0.33
,
0
),
f
(
0.1
,
0.67
,
0
);
K
::
Segment_3
inside_segment
(
e
,
f
);
intersector
.
computeIntersectionQuery
(
inside_segment
);
test
.
element
=
interface_mesh
.
getNbElement
(
_segment_2
)
-
1
;
interface_mesh
.
getBarycenter
(
test
,
bary
);
Real
second_bary
[]
=
{
0.1
,
0.5
};
if
(
!
Math
::
are_vector_equal
(
2
,
bary
.
data
(),
second_bary
))
return
EXIT_FAILURE
;
#if 0
// cgal::Spherical kernel testing the addition of nodes
std::cout << "initial mesh size = " << mesh.getNodes().size() << " nodes" << std::endl;
SK::Sphere_3 sphere(SK::Point_3(0, 1, 0), 0.2*0.2);
SK::Sphere_3 sphere2(SK::Point_3(1, 0, 0), 0.4999999999);
MeshSphereIntersector<2, _triangle_3> intersector_sphere(mesh);
intersector_sphere.constructData();
std::list<SK::Sphere_3> sphere_list;
sphere_list.push_back(sphere);
sphere_list.push_back(sphere2);
intersector_sphere.computeIntersectionQueryList(sphere_list);
std::cout << "final mesh size = " << mesh.getNodes().size() << std::endl;
const Array<Idx> new_node_triangle_3 = intersector_sphere.getNewNodePerElem();
const Array<Real> & nodes = mesh.getNodes();
std::cout << "New nodes :" << std::endl;
std::cout << "node 5, x=" << nodes(4,0) << ", y=" << nodes(4,1) << std::endl;
std::cout << "node 6, x=" << nodes(5,0) << ", y=" << nodes(5,1) << std::endl;
std::cout << "node 7, x=" << nodes(6,0) << ", y=" << nodes(6,1) << std::endl;
if ( (new_node_triangle_3(0,0) != 1) || (new_node_triangle_3(1,0) != 2)){
for(Int k=0; k != new_node_triangle_3.size(); ++k){
std::cout << new_node_triangle_3(k,0) << " new nodes in element " << k << ", node(s): "
<< new_node_triangle_3(k,1) << ", " << new_node_triangle_3(k,3)
<< ", on segment(s):" << new_node_triangle_3(k,2) << ", "
<< new_node_triangle_3(k,4) << std::endl;
}
return EXIT_FAILURE;
}
#endif
finalize
();
return
EXIT_SUCCESS
;
}
Event Timeline
Log In to Comment