The loop determines whether each pixel in the image can be removed without changing the Euler number of the image. The pixels are ordered by increasing distance from the background which means a point nearer to the quench-line of the brushfire will be evaluated later than a point closer to the edge.
Note that the neighbourhood of a pixel may evolve before the loop arrives at this pixel. This is why it is possible to compute the skeleton in only one pass, thanks to an adapted ordering of the pixels.
On input, the image to be skeletonized, on output the skeletonized image.
The coordinates of each foreground pixel in the image
The index of each pixel, in the order of processing (order[0] is the first pixel to process, etc.)
The 512-element lookup table of values after transformation (whether to keep or not each configuration in a binary 3x3 array)
Inner loop of skeletonize function
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
