Data-Parallel Octrees for Surface Reconstruction

被引:85
作者
Zhou, Kun [1 ]
Gong, Minmin [2 ]
Huang, Xin [2 ]
Guo, Baining [2 ]
机构
[1] Zhejiang Univ, State Key Lab CAD&CG, ZiJinGang Campus, Hangzhou 310058, Zhejiang, Peoples R China
[2] Microsoft Res Asia, Beijing 100190, Peoples R China
关键词
Surface reconstruction; octree; programable graphics unit; marching cubes; GPU;
D O I
10.1109/TVCG.2010.75
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds an octree for the given set of oriented points, then computes an implicit function over the space of the octree, and finally extracts an isosurface as a watertight triangle mesh. A key component of our algorithm is a novel technique for octree construction on the GPU. This technique builds octrees in real time and uses level-order traversals to exploit the fine-grained parallelism of the GPU. Moreover, the technique produces octrees that provide fast access to the neighborhood information of each octree node, which is critical for fast GPU surface reconstruction. With an octree so constructed, our GPU algorithm performs Poisson surface reconstruction, which produces high-quality surfaces through a global optimization. Given a set of 500K points, our algorithm runs at the rate of about five frames per second, which is over two orders of magnitude faster than previous CPU algorithms. To demonstrate the potential of our algorithm, we propose a user-guided surface reconstruction technique which reduces the topological ambiguity and improves reconstruction results for imperfect scan data. We also show how to use our algorithm to perform on-the-fly conversion from dynamic point clouds to surfaces as well as to reconstruct fluid surfaces for real-time fluid simulation.
引用
收藏
页码:669 / 681
页数:13
相关论文
共 37 条
[1]   Point set surfaces [J].
Alexa, M ;
Behr, J ;
Cohen-Or, D ;
Fleishman, S ;
Levin, D ;
Silva, CT .
VISUALIZATION 2001, PROCEEDINGS, 2001, :21-28
[2]   Defining point-set surfaces [J].
Amenta, N ;
Kil, YJ .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :264-270
[3]  
Amenta N., 1998, Computer Graphics. Proceedings. SIGGRAPH 98 Conference Proceedings, P415, DOI 10.1145/280814.280947
[4]  
[Anonymous], 1987, ACM siggraph computer graphics, DOI [10.1145/37401.37422, DOI 10.1145/37401.37422]
[5]  
BAJAJ C, 1995, SIGGRAPH 95, P109
[6]  
Benson D, 2002, ACM T GRAPHIC, V21, P785, DOI 10.1145/566570.566652
[7]   GEOMETRIC STRUCTURES FOR 3-DIMENSIONAL SHAPE REPRESENTATION [J].
BOISSONNAT, JD .
ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (04) :266-286
[8]   Sparse matrix solvers on the GPU:: Conjugate gradients and multigrid [J].
Bolz, J ;
Farmer, I ;
Grinspun, E ;
Schröder, P .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03) :917-924
[9]  
Borghese NA, 2002, HAVE 2002 - IEEE INTERNATIONAL WORKSHOP ON HAPTIC VIRTUAL ENVIRONMENTS AND THEIR APPLICATIONS, P19, DOI 10.1109/HAVE.2002.1106908
[10]   GPU Local Triangulation: an interpolating surface reconstruction algorithm [J].
Buchart, C. ;
Borro, D. ;
Amundarain, A. .
COMPUTER GRAPHICS FORUM, 2008, 27 (03) :807-814