Term information
The dividing cubes algorithm "is similar to the Marching Cubes algorithm except that when a voxel is determined to be intersected by the isosurface, it is projected to the image plane. If it projects to a single pixel or smaller, than it is just rendered as a point, else it is subdivided into surfaces as with the Marching Cubes algorithm. Basic Idea: * Create "Surface Points" Instead of Triangles * Associate Surface Normal with Each Surface * Point Surface Points, When Rendered, Are Pixel Size * Subdivide Cells as Necessary Subdivide Cells as Necessary * Eliminates Scan Conversion Step * Point Cloud Rendering Randomly Ordered Points * No Topology " source: http://www.siggraph.org/education/materials/HyperVis/vistech/volume/surface5.htm