Doc: Triangulation instead of Triangle in interp doc.

Thanks Christophe.

diff --git a/doc/user/doxygen/doxfiles/reference/interpolation/intersec-specifics.dox b/doc/user/doxygen/doxfiles/reference/interpolation/intersec-specifics.dox
index 041d57feb76258e24fed7e0628419bde65d36e9f..8ca4cbce383b76b229e3f35105d01a5d7fcbd7b7 100644 (file)
--- a/doc/user/doxygen/doxfiles/reference/interpolation/intersec-specifics.dox
+++ b/doc/user/doxygen/doxfiles/reference/interpolation/intersec-specifics.dox
@@ -20,7 +20,7 @@ cell in the target mesh.
 \subsection InterpKerPlanarIntFeatureP0P0 P0->P0 intersectors features.
 
 When remapping two dimensional fields, areas of intersection between polygonal cells are to be computed. Three algorithms are available:
-- Triangle: decompose each cells into triangles and computes triangle-triangle intersection by determining segment crossings and node inclusions. This algorithm is the fastest if both meshes are made of triangular cells.
+- Triangulation: decompose each cells into triangles and computes triangle-triangle intersection by determining segment crossings and node inclusions. This algorithm is the fastest if both meshes are made of triangular cells.
 - Convex: presume that both meshes are made of convex cells, and performs a direct computation of the intersection nodes between two cells through a sweep line algorithm (see  F. Preparata and M. Shamos, 1985 in \ref references).
 For the moment, it is only possible to remap two dimensional fields on
 meshes with mixed triangular and quadrangular elements.
@@ -30,7 +30,7 @@ flexibility this algorithm is slower than the other.
 - \anchor pointlocator PointLocator: This is a \b non \b conservative interpolator. For P0P0, it
 locates the barycenter of target cell in the source cells. For P1P0, it
 locates barycenter of target cell and compute \ref barycoords "barycentric coordinates"
-in source cell (Works only with Triangle). For P0P1 locate target nodes
+in source cell (Works only with Triangulation). For P0P1 locate target nodes
 in source cells. For P1P1 compute for each target node its barycentric coordinates in source cell.
 
 The following options are available for the 2D intersection computations:
@@ -38,7 +38,7 @@ The following options are available for the 2D intersection computations:
  * <TR><TD>Option</TD><TD>Description</TD><TD> Admitted values</TD><TD>Default</TD></TR>
  * <TR><TD> Intersection_type</TD><TD>Specifies the algorithm to be
  * used in the computation of the cell-cell intersections</TD><TD>
- * Triangle, Convex, \ref interpkernelGeo2D "Geometric2D", PointLocator</TD><TD> Triangle </TD></TR>
+ * Triangulation, Convex, \ref interpkernelGeo2D "Geometric2D", PointLocator</TD><TD> Triangulation </TD></TR>
  * <TR><TD> Precision </TD><TD>Accuracy of the computations is precision times the characteristic size of the meshes </TD><TD>  positive real numbers</TD><TD> 1.0E-12 </TD></TR>
  * <TR><TD>PrintLevel </TD><TD>Level of verboseness during the computations </TD><TD> 0, 1, 2, 3 </TD><TD>0 </TD></TR>
  *</TABLE>
@@ -65,7 +65,7 @@ Similar options as for the 2D remapping are available, plus some additional opti
  * <TR><TD>MaxDistance3DSurfIntersect</TD><TD>Before attempting an intersection in 3D surf test the distance D between fast barycenter of target cell and medium source plane P. If option < 0. no interpretation of D is done. If option > 0. then if D<option intersection is taken into account and if D>option intersection is equal to 0. . This option exists in order to have an iso behaviour whatever the angle of plane P and OXY OYZ OXZ contrary to BBoxAdjestments options.  </TD><TD> real numbers </TD><TD> -1. </TD></TR>
  *</TABLE>
 
-Note that choosing the Triangle Intersection_type necessarily set the DoRotate option to true.
+Note that choosing the Triangulation Intersection_type necessarily set the DoRotate option to true.
 
 \section interpolation3D Special features of 3D volumes intersectors
 
@@ -80,7 +80,7 @@ there is one instance per pair of meshes \b and target element. See INTERP_KERNE
 When remapping three dimensional fields, volumes of intersection
 between polyhedral cells are to be computed.
 Two methods are available :
-- Triangle : the method of Jeffrey Grandy, 1999 (see \ref references)
+- Triangulation : the method of Jeffrey Grandy, 1999 (see \ref references)
 to intersect arbitrary polyhedra. The basic algorithm computes the
 intersection of a tetrahedron with an arbitrary (possibly non convex)
 polyhedron. Using splitting techniques, it is possible to transform
@@ -98,9 +98,9 @@ principle than described in 2D.
  * <TR><TD>Option</TD><TD>Description</TD><TD> Admitted values</TD><TD>Default</TD></TR>
  * <TR><TD> Intersection_type</TD><TD>Specifies the algorithm to be
  * used in the computation of the cell-cell intersections</TD><TD>
- * Triangle, PointLocator</TD><TD> Triangle </TD></TR>
+ * Triangulation, PointLocator</TD><TD> Triangulation </TD></TR>
  * <TR><TD> SplittingPolicy </TD><TD> Way in which the hexahedra are
- * split into tetrahedra (only if Intersection_type==Triangle) </TD><TD> PLANAR_FACE_5,  PLANAR_FACE_6, GENERAL_24, GENERAL_48</TD><TD> GENERAL_48 </TD></TR>
+ * split into tetrahedra (only if Intersection_type==Triangulation) </TD><TD> PLANAR_FACE_5,  PLANAR_FACE_6, GENERAL_24, GENERAL_48</TD><TD> GENERAL_48 </TD></TR>
  * <TR><TD>PrintLevel </TD><TD>Level of verboseness during the computations </TD><TD> 1, 2, 3, 4, 5 </TD><TD>0 </TD></TR>
  * </TABLE>