find_simplex(self, xi, bruteforce=False, tol=None)

Notes

Parameters

tri : DelaunayInfo

xi : ndarray of double, shape (..., ndim)

bruteforce : bool, optional

tol : float, optional

Returns

i : ndarray of int, same shape as `xi`

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.spatial._qhull:tsearch

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : None#None
type: <class 'cython_function_or_method'>
Commit: