Computing smooth molecular surfaces
Amitabh Varshney, Frederick P. Brooks, William V. Wright · IEEE Computer Graphics and Applications · 1994
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.>
Cited by 200 works. doi:10.1109/38.310720
Authors
References
- Computational Geometry
- Computational geometry. an introduction
- A new force field for molecular mechanical simulation of nucleic acids and proteins
- AREAS, VOLUMES, PACKING, AND PROTEIN STRUCTURE
- Analytical molecular surface calculation
- The structure and action of proteins
- Three-dimensional alpha shapes
- Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memories
- On the shape of a set of points in the plane
- Power Diagrams: Properties, Algorithms and Applications