This file contains the triangle information for the marching cubes algorithm. Note that the index is given in hex and that only 15 entries are needed to span all 256 entries of the edge table. This listing also contains modifications for one of the ambiguous cases, Index = 05. p7_____e6_____p6 /| /| / | / | e10 | e11 | / e7 / e5 / | / | p3______e2_____p2 | | | | | | | | | | p4____e4_|____p5 | / | / e3 / e1 / | e8 | e9 | / | / |/ |/ p0______e0_____p1 Index Ntriangles TriangleList ------------------------------------- 00 0 01 1 t0 = 0 3 8 03 2 t0 = 1 3 8 t1 = 1 8 9 05 4 t0 = 0 3 8 t1 = 1 2 11 t2 = 0 2 3 t3 = 0 1 2 41 2 t0 = 0 3 8 t1 = 5 6 11 32 3 t0 = 0 1 8 t1 = 1 7 8 t2 = 1 5 7 43 3 t0 = 1 3 8 t1 = 1 8 9 t2 = 5 6 11 4A 3 t0 = 2 3 10 t1 = 0 1 9 t2 = 5 6 11 33 2 t0 = 3 5 7 t1 = 3 5 1 B1 4 t0 = 3 6 10 t1 = 0 3 6 t2 = 0 5 6 t3 = 0 5 9 69 4 t0 = 2 8 10 t1 = 2 8 0 t2 = 4 11 6 t3 = 4 11 9 71 4 t0 = 0 3 7 t1 = 0 7 11 t2 = 6 7 11 t3 = 0 9 11 3A 4 t0 = 2 3 10 t1 = 0 1 8 t2 = 1 7 8 t3 = 1 5 7 A5 4 t0 = 0 3 8 t1 = 4 5 9 t2 = 6 7 10 t3 = 1 2 11 B2 4 t0 = 0 8 10 t1 = 0 5 10 t2 = 5 6 10 t3 = 0 1 5 ------------------------------------