Masked version of marching cubes. This function will check a masking array (same size as im) to decide if the algorithm must be computed for a given voxel. This adds a small overhead that rapidly gets compensated by the fewer computed cubes Returns (vertices, faces, normals, values)
marching_cubes(im, double isovalue, LutProvider luts, int st=1, int classic=0) Main entry to apply marching cubes.
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
