Because of the continuity and continguity of slices, we do not need to recompute these intersections for every cube. These edges are highlighted in the diagram with red crosses. Once these new intersections are computed, the existing stored values are updated to contain the new values for the next iteration. New intersection points are computed through linear interpolation of the densities at the cube vertices. Click here to download gzipped data file Data is stored in these files as bytes.
Color coding The table below shows the volume data sets for some Z slices.
The data is visualized using a simple color coding scheme, where the intensity of the pixel color is proportional to the density of the volumetric data at that point. Since the data range from 0 to 256, the densities have been normalized by dividing each value by 256. No thresholding operation was performed. Please click on the images to see them in full size. Rendering with the marching cubes algorithm I tested my implementation of the marching cubes algorithm on the lobster data set.