Fast generation of molecular surfaces from 3D data fields with an enhanced “marching cube” algorithm

An improved version of the “marching cubes” algorithm [W. Lorensen and H. Cline, Comp. Graph. 21, (1987)] for the generation of isosurfaces from 3D data fields is presented and applied to molecular surfaces. The new algorithm avoids inconsistent pattern definitions of the original one, which lead to artificial gaps. The advantage of a logarithmic interpolation procedure, in particular for data fields typically occurring in molecular science, is demonstrated. An example is the generation of molecular surfaces based upon electron density data.