Two methods are available :
- 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
+intersection of a target tetrahedron with an arbitrary (possibly non convex)
+source polyhedron. Using splitting techniques, it is possible to transform
the problem of computing the intersection between two general
polyhedra into several tetrahedron-polyhedron intersection
-calculations. For the moment it is only possible to remap fields on
-meshes having mixed tetrahedral and hexahedral cells. When using a
-mesh with hexahedral cells, several splitting techniques may be
-employed depending mainly on whether the faces are planar or not. The
-following options are available for the splitting:
+calculations. The target polyhedron cell splitting into subtetrahedral cell operation
+is performed upstream. For hexahedral target cells, the splitting can be parametrized
+using SplittingPolicy option. This SplittingPolicy policy allows you to choose among
+different split pattern mainly whether the faces of hexahedral are planar or not.
+The following options are available for the splitting:
- PointLocator : \b non \b conservative intersector based on the same
principle than described in 2D.
