Efficient and Quality Contouring Algorithms on the GPU
Efficient and Quality Contouring Algorithms on the GPU
复制标题
GPU 上高效、优质的轮廓算法
DOI：
10.1111/j.1467-8659.2010.01825.x
复制
发表时间：
2010
影响因子：
2.5
通讯作者：
J. Comba
中科院分区：
文献类型：
--
作者：
Leonardo A. Schmitz;Luiz F. Scheidegger;D. Osmari;C. Dietrich;J. Comba
交互式等值面提取最近通过成功地将诸如行进立方体(MC)和行进四面体(MT)等算法映射到现代图形处理单元(GPU)架构而成为可能。然而，其他等值面算法不那么容易移植到GPU，要么是因为它们涉及更复杂的操作，要么是因为它们不像大多数行进技术那样基于离散案例表。在本文中，我们回顾了对偶轮廓线(MC)和Macet等值面提取算法，并分别提出了：(I)新的、高效的、可并行化的对偶轮廓线算法和(Ii)一组扩展了原始Marching Cube算法的GPU模块。与行进方法类似，我们的新技术是基于案例表的，这允许非常高效的GPU实现。此外，我们列举和评估了几种在GPU上实现高效轮廓算法的方法，并给出了各种方法之间的权衡。最后，我们验证了在所有这些备选方案中产生的镶嵌的效率和质量。
Interactive 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.