Notes

Wu's method draws anti-aliased circle. This implementation doesn't use lookup table optimization.

Parameters

r_o, c_o : int

Centre coordinate of circle.

radius : int

Radius of circle.

shape : tuple

Image shape which is used to determine the maximum extent of output pixel coordinates. This is useful for circles that exceed the image size. If None, the full extent of the circle is used.

Returns

rr, cc, val : (N,) ndarray (int, int, float)

Indices of pixels (:None:None:`rr`, :None:None:`cc`) and intensity values (:None:None:`val`). img[rr, cc] = val .

Generate anti-aliased circle perimeter coordinates.

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: None#None
type: <class 'builtin_function_or_method'>
Commit: