Computing smooth molecular surfaces
- 1 September 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 14 (5) , 19-25
- https://doi.org/10.1109/38.310720
Abstract
We consider how we set out to formulate a parallel analytical molecular surface algorithm that has expected linear complexity with respect to the total number of atoms in a molecule. To achieve this goal, we avoided computing the complete 3D regular triangulation over the entire set of atoms, a process that takes time O(n log n), where n is the number of atoms in the molecule. We aim to compute and display these surfaces at interactive rates, by taking advantage of advances in computational geometry, making further algorithmic improvements and parallelizing the computations.Keywords
This publication has 11 references indexed in Scilit:
- Three-dimensional alpha shapesACM Transactions on Graphics, 1994
- An efficient approach to removing geometric degeneraciesPublished by Association for Computing Machinery (ACM) ,1992
- MSEED: A program for the rapid analytical determination of accessible surface areas and their derivativesJournal of Computational Chemistry, 1992
- Linear programming and convex hulls made easyPublished by Association for Computing Machinery (ACM) ,1990
- Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memoriesPublished by Association for Computing Machinery (ACM) ,1989
- Power Diagrams: Properties, Algorithms and ApplicationsSIAM Journal on Computing, 1987
- A new force field for molecular mechanical simulation of nucleic acids and proteinsJournal of the American Chemical Society, 1984
- Analytical molecular surface calculationJournal of Applied Crystallography, 1983
- On the shape of a set of points in the planeIEEE Transactions on Information Theory, 1983
- AREAS, VOLUMES, PACKING, AND PROTEIN STRUCTUREAnnual Review of Biophysics and Bioengineering, 1977