Graphics processing unit-based triangulations of Blinn molecular surfaces

15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Computing the surface of a molecule (e.g., a protein) plays an important role in the analysis of its geometric structure as needed in the study of interactions between proteins, protein folding, protein docking, and so forth. There are a number of algorithms for the computation of molecular surfaces and their triangulations, but only a few take advantage of graphics processing unit computing. This paper describes a graphics processing unit-based marching cubes algorithm to triangulate molecular surfaces. In the end of the paper, a performance analysis of three implementations (i.e., serial CPU, CUDA, and OpenCL) of the marching cubes-based triangulation algorithm takes place as a way to realize beforehand how molecular surfaces can be rendered in real-time in the future. Copyright © 2011 John Wiley & Sons, Ltd. Copyright © 2011 John Wiley & Sons, Ltd.

Cite

CITATION STYLE

APA

Dias, S. E. D., & Gomes, A. J. P. (2011). Graphics processing unit-based triangulations of Blinn molecular surfaces. Concurrency and Computation: Practice and Experience, 23(17), 2280–2291. https://doi.org/10.1002/cpe.1783

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free