Molecular surface generation using marching tetrahedra
โ Scribed by Chan, Shek Ling; Purisima, Enrico O.
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 287 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
โฆ Synopsis
A method is presented to generate and triangulate molecular surfaces rapidly. It is based on the 'marching tetrahedra' approach. The method is fast, simple and easy to implement. Our approach is not analytical in nature. Hence no special treatment is required for complications with singularity, degeneracy, or with self-intersecting re-entrant surfaces. A quick test for determining the solvent accessibility of a point in space forms an important part of the method. This test has potential use outside of the surface generation algorithm such as in molecular field analysis where the solvent accessibility of a point needs to be determined. The triangulated surface generated is suitable for molecular graphics display as well as boundary element continuum dielectric calculations. แฎ 1998, Government of Canada. Exclusive worldwide publication rights in the article have been transferred to John Wiley & Sons, Inc. in perpetuity.
๐ SIMILAR VOLUMES
An improved version of the "marching cubes" algorithm [W. Lorensen and H. Cline, Comp. Graph. 21, (198711 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