_find_closest_point_on_path(xys, p)

Parameters

xys : (N, 2) array-like

Coordinates of vertices.

p : (float, float)

Coordinates of point.

Returns

d2min : float

Minimum square distance of p to xys.

proj : (float, float)

Projection of p onto xys.

imin : (int, int)

Consecutive indices of vertices of segment in xys where proj is. Segments are considered as including their end-points; i.e if the closest point on the path is a node in xys with index i, this returns (i-1, i) . For the special case where xys is a single point, this returns (0, 0) .

Examples

See :

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

---

File: /matplotlib/contour.py#623
type: <class 'function'>
Commit: