1 // Copyright (C) 2007-2013 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
19 // Author : Anthony Geay (CEA/DEN)
20 #ifndef __INTERPOLATIONPLANAR_TXX__
21 #define __INTERPOLATIONPLANAR_TXX__
23 #include "InterpolationPlanar.hxx"
24 #include "Interpolation.txx"
25 #include "InterpolationOptions.hxx"
26 #include "PlanarIntersector.hxx"
27 #include "PlanarIntersector.txx"
28 #include "TriangulationIntersector.hxx"
29 #include "TriangulationIntersector.txx"
30 #include "ConvexIntersector.hxx"
31 #include "ConvexIntersector.txx"
32 #include "Geometric2DIntersector.hxx"
33 #include "Geometric2DIntersector.txx"
34 #include "PointLocator2DIntersector.hxx"
35 #include "PointLocator2DIntersector.txx"
36 #include "PlanarIntersectorP0P1PL.hxx"
37 #include "PlanarIntersectorP0P1PL.txx"
38 #include "PlanarIntersectorP1P0PL.hxx"
39 #include "PlanarIntersectorP1P0PL.txx"
40 #include "PlanarIntersectorP1P1PL.hxx"
41 #include "PlanarIntersectorP1P1PL.txx"
42 #include "VectorUtils.hxx"
48 namespace INTERP_KERNEL
51 * \defgroup interpolationPlanar InterpolationPlanar
53 * \class InterpolationPlanar
54 * \brief Class used to compute the coefficients of the interpolation matrix between
55 * two local meshes in two dimensions. Meshes can contain mixed triangular and quadrangular elements.
57 template<class RealPlanar>
58 InterpolationPlanar<RealPlanar>::InterpolationPlanar():_dim_caracteristic(1)
63 template<class RealPlanar>
64 InterpolationPlanar<RealPlanar>::InterpolationPlanar(const InterpolationOptions& io):Interpolation< InterpolationPlanar<RealPlanar> >(io),_dim_caracteristic(1)
70 * \brief Function used to set the options for the intersection calculation
71 * \details The following options can be modified:
72 * -# Intersection_type: the type of algorithm to be used in the computation of the cell-cell intersections.
73 * - Values: Triangle, Convex.
74 * - Default: Triangle.
75 * -# Precision: Level of precision of the computations is precision times the characteristic size of the mesh.
76 * - Values: positive real number.
78 * -# PrintLevel: Level of verboseness during the computations.
79 * - Values: interger between 0 and 3.
82 template<class RealPlanar>
83 void InterpolationPlanar<RealPlanar>::setOptions(double precision, int printLevel, IntersectionType intersectionType, int orientation)
85 InterpolationOptions::setPrecision(precision);
86 InterpolationOptions::setPrintLevel(printLevel);
87 InterpolationOptions::setIntersectionType(intersectionType);
88 InterpolationOptions::setOrientation(orientation);
92 /** \brief Main function to interpolate triangular or quadrangular meshes.
93 \details The algorithm proceeds in two steps: first a filtering process reduces the number of pairs of elements for which the
94 * calculation must be carried out by eliminating pairs that do not intersect based on their bounding boxes. Then, the
95 * volume of intersection is calculated by an object of type IntersectorPlanar for the remaining pairs, and entered into the
96 * intersection matrix.
98 * The matrix is partially sparse : it is a vector of maps of integer - double pairs.
99 * The length of the vector is equal to the number of target elements - for each target element there is a map, regardless
100 * of whether the element intersects any source elements or not. But in the maps there are only entries for those source elements
101 * which have a non-zero intersection volume with the target element. The vector has indices running from
102 * 0 to (#target elements - 1), meaning that the map for target element i is stored at index i - 1. In the maps, however,
103 * the indexing is more natural : the intersection volume of the target element i with source element j is found at matrix[i-1][j].
106 * @param myMeshS Planar source mesh
107 * @Param myMeshT Planar target mesh
108 * @return vector containing for each element i of the source mesh, a map giving for each element j
109 * of the target mesh which i intersects, the area of the intersection
112 template<class RealPlanar>
113 template<class MyMeshType, class MatrixType>
114 int InterpolationPlanar<RealPlanar>::interpolateMeshes(const MyMeshType& myMeshS, const MyMeshType& myMeshT, MatrixType& result, const char *method)
116 static const int SPACEDIM=MyMeshType::MY_SPACEDIM;
117 typedef typename MyMeshType::MyConnType ConnType;
118 static const NumberingPolicy numPol=MyMeshType::My_numPol;
120 long global_start =clock();
122 /***********************************************************/
123 /* Check both meshes are made of triangles and quadrangles */
124 /***********************************************************/
126 long nbMailleS=myMeshS.getNumberOfElements();
127 long nbMailleT=myMeshT.getNumberOfElements();
129 /**************************************************/
130 /* Search the characteristic size of the meshes */
131 /**************************************************/
133 double BoxS[2*SPACEDIM]; myMeshS.getBoundingBox(BoxS);
134 double BoxT[2*SPACEDIM]; myMeshT.getBoundingBox(BoxT);
135 double diagonalS,dimCaracteristicS=std::numeric_limits<double>::max();
138 diagonalS=getDistanceBtw2Pts<SPACEDIM>(BoxS+SPACEDIM,BoxS);
139 dimCaracteristicS=diagonalS/nbMailleS;
141 double diagonalT,dimCaracteristicT=std::numeric_limits<double>::max();
144 diagonalT=getDistanceBtw2Pts<SPACEDIM>(BoxT+SPACEDIM,BoxT);
145 dimCaracteristicT=diagonalT/nbMailleT;
148 _dim_caracteristic=std::min(dimCaracteristicS, dimCaracteristicT);
149 if (InterpolationOptions::getPrintLevel()>=1)
151 std::cout << " - Characteristic size of the source mesh : " << dimCaracteristicS << std::endl;
152 std::cout << " - Characteristic size of the target mesh: " << dimCaracteristicT << std::endl;
153 std::cout << "InterpolationPlanar::computation of the intersections" << std::endl;
156 PlanarIntersector<MyMeshType,MatrixType>* intersector=0;
157 std::string meth = InterpolationOptions::filterInterpolationMethod(method);
160 switch (InterpolationOptions::getIntersectionType())
163 intersector=new TriangulationIntersector<MyMeshType,MatrixType,PlanarIntersectorP0P0>(myMeshT,myMeshS,_dim_caracteristic,
164 InterpolationOptions::getPrecision(),
165 InterpolationOptions::getMaxDistance3DSurfIntersect(),
166 InterpolationOptions::getMedianPlane(),
167 InterpolationOptions::getOrientation(),
168 InterpolationOptions::getPrintLevel());
171 intersector=new ConvexIntersector<MyMeshType,MatrixType,PlanarIntersectorP0P0>(myMeshT,myMeshS,_dim_caracteristic,
172 InterpolationOptions::getPrecision(),
173 InterpolationOptions::getMaxDistance3DSurfIntersect(),
174 InterpolationOptions::getMedianPlane(),
175 InterpolationOptions::getDoRotate(),
176 InterpolationOptions::getOrientation(),
177 InterpolationOptions::getPrintLevel());
180 intersector=new Geometric2DIntersector<MyMeshType,MatrixType,PlanarIntersectorP0P0>(myMeshT, myMeshS, _dim_caracteristic,
181 InterpolationOptions::getMaxDistance3DSurfIntersect(),
182 InterpolationOptions::getMedianPlane(),
183 InterpolationOptions::getPrecision(),
184 InterpolationOptions::getOrientation());
187 intersector=new PointLocator2DIntersector<MyMeshType,MatrixType,PlanarIntersectorP0P0>(myMeshT, myMeshS, _dim_caracteristic,
188 InterpolationOptions::getMaxDistance3DSurfIntersect(),
189 InterpolationOptions::getMedianPlane(),
190 InterpolationOptions::getPrecision(),
191 InterpolationOptions::getOrientation());
195 else if(meth=="P0P1")
197 switch (InterpolationOptions::getIntersectionType())
200 intersector=new TriangulationIntersector<MyMeshType,MatrixType,PlanarIntersectorP0P1>(myMeshT,myMeshS,_dim_caracteristic,
201 InterpolationOptions::getPrecision(),
202 InterpolationOptions::getMaxDistance3DSurfIntersect(),
203 InterpolationOptions::getMedianPlane(),
204 InterpolationOptions::getOrientation(),
205 InterpolationOptions::getPrintLevel());
208 intersector=new ConvexIntersector<MyMeshType,MatrixType,PlanarIntersectorP0P1>(myMeshT,myMeshS,_dim_caracteristic,
209 InterpolationOptions::getPrecision(),
210 InterpolationOptions::getMaxDistance3DSurfIntersect(),
211 InterpolationOptions::getMedianPlane(),
212 InterpolationOptions::getDoRotate(),
213 InterpolationOptions::getOrientation(),
214 InterpolationOptions::getPrintLevel());
217 intersector=new Geometric2DIntersector<MyMeshType,MatrixType,PlanarIntersectorP0P1>(myMeshT, myMeshS, _dim_caracteristic,
218 InterpolationOptions::getMaxDistance3DSurfIntersect(),
219 InterpolationOptions::getMedianPlane(),
220 InterpolationOptions::getPrecision(),
221 InterpolationOptions::getOrientation());
224 intersector=new PlanarIntersectorP0P1PL<MyMeshType,MatrixType>(myMeshT, myMeshS, _dim_caracteristic,
225 InterpolationOptions::getMaxDistance3DSurfIntersect(),
226 InterpolationOptions::getMedianPlane(),
227 InterpolationOptions::getPrecision(),
228 InterpolationOptions::getOrientation());
232 else if(meth=="P1P0")
234 switch (InterpolationOptions::getIntersectionType())
237 intersector=new TriangulationIntersector<MyMeshType,MatrixType,PlanarIntersectorP1P0>(myMeshT,myMeshS,_dim_caracteristic,
238 InterpolationOptions::getPrecision(),
239 InterpolationOptions::getMaxDistance3DSurfIntersect(),
240 InterpolationOptions::getMedianPlane(),
241 InterpolationOptions::getOrientation(),
242 InterpolationOptions::getPrintLevel());
245 intersector=new ConvexIntersector<MyMeshType,MatrixType,PlanarIntersectorP1P0>(myMeshT,myMeshS,_dim_caracteristic,
246 InterpolationOptions::getPrecision(),
247 InterpolationOptions::getMaxDistance3DSurfIntersect(),
248 InterpolationOptions::getMedianPlane(),
249 InterpolationOptions::getDoRotate(),
250 InterpolationOptions::getOrientation(),
251 InterpolationOptions::getPrintLevel());
254 intersector=new Geometric2DIntersector<MyMeshType,MatrixType,PlanarIntersectorP1P0>(myMeshT, myMeshS, _dim_caracteristic,
255 InterpolationOptions::getMaxDistance3DSurfIntersect(),
256 InterpolationOptions::getMedianPlane(),
257 InterpolationOptions::getPrecision(),
258 InterpolationOptions::getOrientation());
261 intersector=new PlanarIntersectorP1P0PL<MyMeshType,MatrixType>(myMeshT, myMeshS, _dim_caracteristic,
262 InterpolationOptions::getMaxDistance3DSurfIntersect(),
263 InterpolationOptions::getMedianPlane(),
264 InterpolationOptions::getPrecision(),
265 InterpolationOptions::getOrientation());
268 intersector=new TriangulationIntersector<MyMeshType,MatrixType,PlanarIntersectorP1P0Bary>(myMeshT,myMeshS,_dim_caracteristic,
269 InterpolationOptions::getPrecision(),
270 InterpolationOptions::getMaxDistance3DSurfIntersect(),
271 InterpolationOptions::getMedianPlane(),
272 InterpolationOptions::getOrientation(),
273 InterpolationOptions::getPrintLevel());
275 case BarycentricGeo2D:
276 intersector=new Geometric2DIntersector<MyMeshType,MatrixType,PlanarIntersectorP1P0Bary>(myMeshT, myMeshS, _dim_caracteristic,
277 InterpolationOptions::getMaxDistance3DSurfIntersect(),
278 InterpolationOptions::getMedianPlane(),
279 InterpolationOptions::getPrecision(),
280 InterpolationOptions::getOrientation());
284 else if(meth=="P1P1")
286 switch (InterpolationOptions::getIntersectionType())
289 intersector=new TriangulationIntersector<MyMeshType,MatrixType,PlanarIntersectorP1P1>(myMeshT,myMeshS,_dim_caracteristic,
290 InterpolationOptions::getPrecision(),
291 InterpolationOptions::getMaxDistance3DSurfIntersect(),
292 InterpolationOptions::getMedianPlane(),
293 InterpolationOptions::getOrientation(),
294 InterpolationOptions::getPrintLevel());
297 intersector=new ConvexIntersector<MyMeshType,MatrixType,PlanarIntersectorP1P1>(myMeshT,myMeshS,_dim_caracteristic,
298 InterpolationOptions::getPrecision(),
299 InterpolationOptions::getMaxDistance3DSurfIntersect(),
300 InterpolationOptions::getMedianPlane(),
301 InterpolationOptions::getDoRotate(),
302 InterpolationOptions::getOrientation(),
303 InterpolationOptions::getPrintLevel());
306 intersector=new Geometric2DIntersector<MyMeshType,MatrixType,PlanarIntersectorP1P1>(myMeshT, myMeshS, _dim_caracteristic,
307 InterpolationOptions::getMaxDistance3DSurfIntersect(),
308 InterpolationOptions::getMedianPlane(),
309 InterpolationOptions::getPrecision(),
310 InterpolationOptions::getOrientation());
313 intersector=new PlanarIntersectorP1P1PL<MyMeshType,MatrixType>(myMeshT, myMeshS, _dim_caracteristic,
314 InterpolationOptions::getMaxDistance3DSurfIntersect(),
315 InterpolationOptions::getMedianPlane(),
316 InterpolationOptions::getPrecision(),
317 InterpolationOptions::getOrientation());
322 throw INTERP_KERNEL::Exception("Invalid method specified or intersection type ! Must be in : \"P0P0\" \"P0P1\" \"P1P0\" or \"P1P1\"");
323 /****************************************************************/
324 /* Create a search tree based on the bounding boxes */
325 /* Instanciate the intersector and initialise the result vector */
326 /****************************************************************/
328 long start_filtering=clock();
330 std::vector<double> bbox;
331 intersector->createBoundingBoxes(myMeshS,bbox); // create the bounding boxes
332 performAdjustmentOfBB(intersector,bbox);
333 const double *bboxPtr=0;
336 BBTree<SPACEDIM,ConnType> my_tree(bboxPtr, 0, 0,nbMailleS);//creating the search structure
338 long end_filtering=clock();
340 result.resize(intersector->getNumberOfRowsOfResMatrix());//on initialise.
342 /****************************************************/
343 /* Loop on the target cells - core of the algorithm */
344 /****************************************************/
345 long start_intersection=clock();
346 long nbelem_type=myMeshT.getNumberOfElements();
347 const ConnType *connIndxT=myMeshT.getConnectivityIndexPtr();
348 for(int iT=0; iT<nbelem_type; iT++)
350 int nb_nodesT=connIndxT[iT+1]-connIndxT[iT];
351 std::vector<int> intersecting_elems;
352 double bb[2*SPACEDIM];
353 intersector->getElemBB(bb,myMeshT,OTT<ConnType,numPol>::indFC(iT),nb_nodesT);
354 my_tree.getIntersectingElems(bb, intersecting_elems);
355 intersector->intersectCells(iT,intersecting_elems,result);
356 counter+=intersecting_elems.size();
357 intersecting_elems.clear();
359 int ret=intersector->getNumberOfColsOfResMatrix();
362 if (InterpolationOptions::getPrintLevel() >=1)
364 long end_intersection=clock();
365 std::cout << "Filtering time= " << end_filtering-start_filtering << std::endl;
366 std::cout << "Intersection time= " << end_intersection-start_intersection << std::endl;
367 long global_end =clock();
368 std::cout << "Number of computed intersections = " << counter << std::endl;
369 std::cout << "Global time= " << global_end - global_start << std::endl;