Find the simplices containing the given points.
tri : DelaunayInfo
xi : ndarray of double, shape (..., ndim)
bruteforce : bool, optional
i : ndarray of int, same shape as xi
This uses an algorithm adapted from Qhull’s qh_findbestfacet, which makes use of the connection between a convex hull and a Delaunay triangulation. After finding the simplex closest to the point in N+1 dimensions, the algorithm falls back to directed search in N dimensions.