BADF: Bounding Volume Hierarchies Centric Adaptive Distance Field Computation for Deformable Objects on GPUs

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 w...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer science and technology Ročník 37; číslo 3; s. 731 - 740
Hlavní autoři: Chen, Xiao-Rui, Tang, Min, Li, Cheng, Manocha, Dinesh, Tong, Ruo-Feng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Singapore Springer Nature Singapore 01.06.2022
Springer
Springer Nature B.V
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
Témata:
Algorithms
Analysis
Artificial Intelligence
Central processing units
Computation
Computer Science
Construction
CPUs
Data Structures and Information Theory
Deformation
Formability
Graphics processing units
Hierarchies
Information Systems Applications (incl.Internet)
Microprocessors
Octrees
Queries
Regular Paper
Software Engineering
Theory of Computation
graphics processing unit (GPU)
octree
distance field
bounding volume hierarchy
deformable object
graphics processing unit(GPU)
ISSN:1000-9000, 1860-4749
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-022-0331-x