摘要
We present a novel algorithm BADF(Bounding Volume Hierarchy Based Adaptive Distance Fields)for accelerating the construction of ADFs(adaptive distance fields)of rigid and deformable models on graphics processing units.Our approach is based on constructing a bounding volume hierarchy(BVH)and we use that hierarchy to generate an octree-based ADF.We exploit the coherence between successive frames and sort the grid points of the octree to accelerate the computation.Our approach is applicable to rigid and deformable models.Our GPU-based(graphics processing unit based)algorithm is about 20x--50x faster than current mainstream central processing unit based algorithms.Our BADF algorithm can construct the distance fields for deformable models with 60k triangles at interactive rates on an NVIDIA GTX GeForce 1060.Moreover,we observe 3x speedup over prior GPU-based ADF algorithms.
作者
Xiao-Rui Chen
Min Tang
Cheng Li
Dinesh Manocha
Ruo-Feng Tong
陈潇瑞;唐敏;李澄;Dinesh Manocha;童若锋(Laboratory of Geometry,Image and Video Processing Enterprise Intelligent Computing,College of Computer Science and Technology,Zhejiang University,Hangzhou 310007,China;Geometric Algorithms for Modeling,Motion,and Animation Laboratory,University of Maryland,Maryland 20742,U.S.A.)
基金
the National Key Research and Development Program of China under Grant No.2018AAA0102703
the National Natural Science Foundation of China under Grant Nos.61972341,61972342,and 61732015.