Hi. Yesterday evening I looked at this site about marching cubes. http://paulbourke.net/geometry/polygonise/

But I decided to implement the tetrahedron version of it instead, since it was a bit simpler.

https://gist.github.com/tnlogy/9073640

Maybe you have some idea on how to optimize it, currently using if-statements. I tried to use a lookup table instead, to implement the switch-case, but it slowed it down rather than sped it up. And I guess I could be a bit smarter in the x-y-z loop calculating the values.

Not showing much interesting graphics for now, but could be used for many fun things