check_in_delaunay_triangle

lstchain.high_level.interpolate.check_in_delaunay_triangle(irfs, data_params, use_nearest_irf_node=False)

From a given list of IRFs as grid points used for interpolation, retrieve the Delaunay triangulation list of IRFs, where the simplex includes the target points in data_params.

If the target point does not exist inside the simplex, the IRF corresponding to the nearest grid point to the target value is used. This is also achieved if use_nearest_irf_node is passed as True.

Fetching the nearest IRF node is also performed by checking the azimuth values, as there might be more than a single node, with the same position in the interpolation parameter space.

If the list of given IRFs are not enough for calculating the Delaunay triangulation, an empty list is returned.

Parameters:

irfs: List of IRFs to check for Delaunay triangulation.

‘List’

data_pars: Dict of arrays of range of parameters of the observed data

in the event list, to check for interpolation. ‘Dict’

use_nearest_irf_node: Boolean if we need only the nearest IRF node.

‘Bool’

Returns:

irf_list: Revised list of IRFs after the checks.

‘List’