I am looking forward to implement the Marching Cubes Algorithm in an alternative way.
As the known apprach uses 8 cube corners, that are either solid or free, to calculate surfaces, I am looking for a different way to get the lookup table.
I want to give an array of 8 booleans (as a indicator for solid or free corners) and receive an array of triangles. The triangles consist of 3 Vertices, where each Vertice consists of 3 values.
The problem is, that depending on the corner configuration marked as solid, the triangles may vary in arrangement.
Bool [8] => [][][3]
Example:
{f,f,f,f,f,f,t,t} => {{{1,0,-1}}{{1,1,0}}{{1,0,0}}}{{{1,1,1}}{1,0,0}}{{0,0,0}}}
The numbers may not be correct. This is just to show the structure.
I would like to implement it in C#
- Is there a way to convert an existing table to a table like this?
- Is there a way to generate this table with an loop?
