Efficient and Quality Contouring Algorithms on the GPU

Simple item page
dc.contributor.authorSchmitz, L.en_US
dc.contributor.authorScheidegger, L. F.en_US
dc.contributor.authorOsmari, D. K.en_US
dc.contributor.authorDietrich, C. A.en_US
dc.contributor.authorComba, J. L. D.en_US
dc.date.accessioned2015-02-23T09:47:07Z
dc.date.available2015-02-23T09:47:07Z
dc.date.issued2010en_US
dc.description.abstractInteractive isosurface extraction has recently become possible through successful efforts to map algorithms such as Marching Cubes (MC) and Marching Tetrahedra (MT) to modern Graphics Processing Unit (GPU) architectures. Other isosurfacing algorithms, however, are not so easily portable to GPUs, either because they involve more complex operations or because they are not based on discrete case tables, as is the case with most marching techniques. In this paper, we revisit the Dual Contouring (MC) and Macet isosurface extraction algorithms and propose, respectively: (i) a novel, efficient and parallelizable version of Dual Contouring and (ii) a set of GPU modules which extend the original Marching Cubes algorithm. Similar to marching methods, our novel technique is based on a case table, which allows for a very efficient GPU implementation. In addition, we enumerate and evaluate several alternatives to implement efficient contouring algorithms on the GPU, and present trade-offs among all approaches. Finally, we validate the efficiency and quality of the tessellations produced in all these alternatives.en_US
dc.description.number8en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2010.01825.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages2569-2578en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2010.01825.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleEfficient and Quality Contouring Algorithms on the GPUen_US
Files
Collections
29-Issue 8