Intersectors and point locators

The various interpolation methods often require the computation of the intersection between a cell of the source mesh and a cell of the target mesh, or the localization of a point inside another mesh. The intersectors implemented in the library take care of this job.

Before reading on, remember the definition of a P0 and P1 field.

• Specificities of 2D and 3D intersectors
• Geometric2D Intersector
• Barycentric coordinates algorithm (used in some P1 intersectors/locators)
• Mapped barycentric coordinates algorithm (used in some P1P1 intersectors)

Some implementation details of the C++ code can also be found here: Interpolation kernel - Implementation notes