Results(1) MC ASC,N=8
Results(1) MC ASC, N = 8
Marching Cubes Algorithm Proposed by Lorensen Cline,in SIGGRAPH87 Algorithm Summary ■Create a cube ■Classify each vertex ■Build an index ■Get edge list Interpolate triangle vertices Calculate and interpolate normals
Marching Cubes Algorithm Proposed by Lorensen & Cline, in SIGGRAPH ‘87 Algorithm Summary n Create a cube n Classify each vertex n Build an index n Get edge list n Interpolate triangle vertices n Calculate and interpolate normals
Marching Cubes Step 1-Create a cube Consider a cube defined by eight data values, four from slice k, and four from slice k+1 (j+1,k+1) ☑41，j+1,k+1) Slice k+1 0,j.k+1) 0+1j,1) 1,k) 件1j+1,k) Slice k (i+1.j.K) k,Z j.y X pixel
Marching Cubes
Marching Cubes Step 2-Classify each vertex Classify each vertex of the cube as to whether it lies outside surface or inside the surface Outside if vertex value surface value Inside if vertex value >=surface INSIDE INSIQE INSIDE OUTSIDE INSIDE INSIDE INSIDE INSIDE
Marching Cubes