Efficient implementation of Marching Cubes' cases with topological guarantees. Thomas Lewiner, Helio Lopes, Antonio Wilson Vieira and Geovan Tavares. Journal of Graphics Tools 8(2): pp. 1-15 (december 2003)
This algorithm has the advantage that it provides topologically correct results, and the algorithms implementation is relatively simple. Most of the magic is in the lookup tables, which are provided as open source.
Originally implemented in C++ by Thomas Lewiner in 2002, ported to Cython by Almar Klein in 2012. Adapted for scikit-image in 2016.
This is an implementation of the marching cubes algorithm proposed in:
This is an implementation of the marching cubes algorithm proposed in:
Efficient implementation of Marching Cubes' cases with topological guarantees. Thomas Lewiner, Helio Lopes, Antonio Wilson Vieira and Geovan Tavares. Journal of Graphics Tools 8(2): pp. 1-15 (december 2003)
This algorithm has the advantage that it provides topologically correct results, and the algorithms implementation is relatively simple. Most of the magic is in the lookup tables, which are provided as open source.
Originally implemented in C++ by Thomas Lewiner in 2002, ported to Cython by Almar Klein in 2012. Adapted for scikit-image in 2016.
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
