并行化的双轮廓算法  

A Parallel Dual Contouring Algorithm

作　　者：李一鹏 贾世宇 潘振宽 王吉强 LI Yi-peng;JIA Shi-yu;PAN Zhen-kuan;WANG Ji-qiang(College of Computer Science&Technology,Qingdao University,Qingdao Shandong 266000,China)

机构地区：[1]青岛大学计算机科学技术学院,山东青岛266000

出　　处：《计算机仿真》2020年第6期262-267,共6页Computer Simulation

基　　金：国家十二五科技支撑计划项目(2013BAI01B03)。

摘　　要：提出一种新颖的适用于GPU且支持化简的并行化的双轮廓方法。通过使用新的GPU八叉树生成算法,克服了传统的八叉树数据结构难以完全在GPU端并行生成与存储的困难,适用于对三维离散点云、数据场及三角网格模型构建(包含等值面或原模型的)八叉树。上述方法逐层并行生成八叉树结点,线性存储每层结点信息同时避免存储空结点信息,有效节约了存储空间并且便于后续对各层结点并行处理。以并行八叉树生成方法为基础,提出了对原始双轮廓算法的GPU加速实现。与在CPU上单线程执行的算法相比,速度可以提高1个数量级。A novel method for parallel Dual Contouring Algorithm on GPU is proposed. It is difficult using traditional octree construction and storage methods to efficiently implemented on GPU. Our method overcomes this difficulty and is applicable to octrees for discrete point clouds, data fields, triangular meshes and iso-surfaces. Octree nodes were constructed level by level. For each level, only data related to previous level and current level were retained to save storage space. The data were stored in linear arrays excluding empty nodes and therefore suitable for parallel processing. A GPU-accelerated dual contouring algorithm based on our method was implemented and it is approximately an order of magnitude faster than a single-threaded CPU implementation.

关 键 词：八叉树 图形处理器加速 双轮廓 表面重构 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]