are you familiar with on marching cubes by greg nielson in csharp

main.cs
//define cube vertices and edge table
Vector3[] vertices = new Vector3[8];
int[,] edgeTable = new int[256, 16];

//initialize edge table
// ...

//march through each cube in the grid
for(int i=0; i<N-1; i++){
  for(int j=0; j<N-1; j++){
    for(int k=0; k<N-1; k++){
      //calculate the scalar values at each corner of the cube
      float[] cube = new float[8];
      // ...

      //determine the index into the edge table based on the scalar values of the cube vertices
      int cubeIndex = 0;
      if (cube[0] < isoValue) cubeIndex |= 1;
      if (cube[1] < isoValue) cubeIndex |= 2;
      // ...

      //calculate intersection points and construct triangles
      int[] edgeIndices = edgeTable[cubeIndex];
      for(int l=0; l<16; l++){
        if(edgeIndices[l] == -1) break;
        // ...
      }
    }
  }
}
822 chars
31 lines