Major revisions. Here's the new plan: cubeIndex will be an index to an array that returns the float values for the required triangles in the correct order, similar to Bourke's original algorithm. cubeIndex is an 8 bit number where every 1 represents a point that is under the isosurface. This number looks up an array of float values that represents the correct arangement of triangles for that case. Hopefully this method will be extremely efficient, however it will take a large amount of time to implement, since all 256 cases will have to be handled seperately (or do they? I don't know, must think longer on it)