Real-time triangulation of molecular surfaces

Abstract

Protein consists of a set of atoms. Given a protein, the molecular surface of the protein is defined with respect to a probe approximating a solvent molecule. This paper presents an efficient, as efficient as the realtime, algorithm to triangulate the blending surfaces which is the most critical subset of a molecular surface. For the quick evaluation of points on the surface, the proposed algorithm uses masks which are similar in their concepts to those in subdivision surfaces. More fundamentally, the proposed algorithm takes advantage of the concise representation of topology among atoms stored in the,beta-shape which is indeed used in the computation of the blending surface itself. Given blending surfaces and the corresponding beta-shape, the proposed algorithm triangulates the blending surfaces in O(c . m) time in the worst case, where m is the number of boundary atoms in the protein and c is the number of point evaluations on a patch in the blending surface.