Indices of simplices containing each point.
Points outside the triangulation get the value -1.

Notes

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.