Dias, SérgioGomes, AbelCoelho, António and Cláudio, Ana Paula2021-06-182021-06-182021978-3-03868-154-0https://doi.org/10.2312/pt.20091217https://diglib.eg.org:443/handle/10.2312/pt20091217Modeling molecular surfaces enables us to extract useful information about interactions with other molecules and measurements of areas and volumes. Over the years many types of algorithms have been developed to represent and rendering molecular surfaces, but all these algorithms have problems related to time performance in triangulating molecular surfaces. One possible solution to solve this problem is using parallel computing systems, but until recently they have been very expensive. Fortunately, the appearance of the new generation of low-cost GPUs with massive computational power opens up an opportunity window to solve this problem. So, in this paper, we present a GPU-based algorithm to speed up the triangulation and rendering of molecular surfaces. Besides we carry out a study that compares a sequential version (CPU) and a parallel version (GPU) of a molecular surface representation using the Marching Cubes (MC) Algorithm.Connolly surfacemolecular surfaceimplicit surfaceGPU computing10.2312/pt.20091217103-110