High-Performance Cross-Architecture Bounding Volume Hierarchy for Collision Detection and Ray Tracing
New in v0.5.0: Ray Tracing and GPU acceleration via AcceleratedKernels.jl/KernelAbstractions.jl targeting all JuliaGPU backends, i.e. Nvidia CUDA, AMD ROCm, Intel oneAPI, Apple Metal.
It uses an implicit bounding volume hierarchy constructed from an iterable of some geometric
primitives' (e.g. triangles in a mesh) bounding volumes forming the ImplicitTree leaves. The leaves
and merged nodes above them can have different types - e.g. BSphere{Float64} leaves merged into
larger BBox{Float64}.
The initial geometric primitives are sorted according to their Morton-encoded coordinates; the
unsigned integer type used for the Morton encoding can be chosen between UInt16, UInt32 and UInt64.
Finally, the tree can be incompletely-built up to a given built_level and later start contact
detection downwards from this level.
Simple usage with bounding spheres and default 64-bit types:
using ImplicitBVH
using ImplicitBVH: BBox, BSphere
# Generate some simple bounding spheres
bounding_spheres = [
BSphere([0., 0., 0.], 0.5),
BSphere([0., 0., 1.], 0.6),
BSphere([0., 0., 2.], 0.5),
BSphere([0., 0., 3.], 0.4),
BSphere([0., 0., 4.], 0.6),
]
# Build BVH
bvh = BVH(bounding_spheres)
# Traverse BVH for contact detection
traversal = traverse(bvh)
@show traversal.contacts
# output
traversal.contacts = [(1, 2), (2, 3), (4, 5)]Using Float32 bounding spheres for leaves, Float32 bounding boxes for nodes above, and UInt32
Morton codes:
using ImplicitBVH
using ImplicitBVH: BBox, BSphere
# Generate some simple bounding spheres
bounding_spheres = [
BSphere{Float32}([0., 0., 0.], 0.5),
BSphere{Float32}([0., 0., 1.], 0.6),
BSphere{Float32}([0., 0., 2.], 0.5),
BSphere{Float32}([0., 0., 3.], 0.4),
BSphere{Float32}([0., 0., 4.], 0.6),
]
# Build BVH
bvh = BVH(bounding_spheres, BBox{Float32}, UInt32)
# Traverse BVH for contact detection
traversal = traverse(bvh)
@show traversal.contacts
# output
traversal.contacts = [(1, 2), (2, 3), (4, 5)]Build BVH up to level 2 and start traversing down from level 3, reusing the previous traversal cache:
bvh = BVH(bounding_spheres, BBox{Float32}, UInt32, 2)
traversal = traverse(bvh, 3, traversal)Update previous BVH bounding volumes' positions and rebuild BVH reusing previous memory:
new_positions = rand(3, 5)
bvh_rebuilt = BVH(bvh, new_positions)Compute contacts between two different BVH trees (e.g. two different robotic parts):
using ImplicitBVH
using ImplicitBVH: BBox, BSphere
# Generate some simple bounding spheres (will be BVH leaves)
bounding_spheres1 = [
BSphere{Float32}([0., 0., 0.], 0.5),
BSphere{Float32}([0., 0., 3.], 0.4),
]
bounding_spheres2 = [
BSphere{Float32}([0., 0., 1.], 0.6),
BSphere{Float32}([0., 0., 2.], 0.5),
BSphere{Float32}([0., 0., 4.], 0.6),
]
# Build BVHs using bounding boxes for nodes
bvh1 = BVH(bounding_spheres1, BBox{Float32}, UInt32)
bvh2 = BVH(bounding_spheres2, BBox{Float32}, UInt32)
# Traverse BVH for contact detection
traversal = traverse(
bvh1,
bvh2,
default_start_level(bvh1),
default_start_level(bvh2),
# previous_traversal_cache,
# options=BVHOptions(),
)Check out the benchmark folder for an example traversing an STL model.
Simply use a GPU array for the bounding volumes; the interface remains the same, and all operations - Morton encoding, sorting, BVH building and traversal for contact finding - will run on the right backend:
# Works with CUDA.jl/CuArray, AMDGPU.jl/ROCArray, oneAPI.jl/oneArray, Metal.jl/MtlArray
using AMDGPU
using ImplicitBVH
using ImplicitBVH: BBox, BSphere
# Generate some simple bounding spheres; save them in a GPU array
bounding_spheres = ROCArray([
BSphere{Float32}([0., 0., 0.], 0.5),
BSphere{Float32}([0., 0., 1.], 0.6),
BSphere{Float32}([0., 0., 2.], 0.5),
BSphere{Float32}([0., 0., 3.], 0.4),
BSphere{Float32}([0., 0., 4.], 0.6),
])
# Build BVH
bvh = BVH(bounding_spheres, BBox{Float32}, UInt32)
# Traverse BVH for contact detection
traversal = traverse(bvh)Using BSphere{Float32} for leaves, BBox{Float32} for merged nodes above, and UInt32 Morton codes:
using ImplicitBVH
using ImplicitBVH: BBox, BSphere
# Load mesh and compute bounding spheres for each triangle. Can download mesh from:
# https://github.com/alecjacobson/common-3d-test-models/blob/master/data/xyzrgb_dragon.obj
using MeshIO
using FileIO
mesh = load("xyzrgb_dragon.obj")
# Generate bounding spheres around each triangle in the mesh
bounding_spheres = [BSphere{Float32}(tri) for tri in mesh]
# Build BVH
bvh = BVH(bounding_spheres, BBox{Float32}, UInt32)
# Generate some rays
points = rand(Float32, 3, 1000)
directions = rand(Float32, 3, 1000)
# Traverse BVH to get indices of rays intersecting the bounding spheres
traversal = traverse_rays(bvh, points, directions)
@show traversal.contacts
# output
traversal.contacts = Tuple{Int32, Int32}[...]The bounding spheres around each triangle can be computed in parallel (including on GPUs) using AcceleratedKernels.jl:
import AcceleratedKernels as AK
bounding_spheres = Vector{BSphere{Float32}}(undef, length(mesh))
AK.map!(BSphere{Float32}, bounding_spheres, mesh)For GPUs simply swap Vector with ROCVector, MtlVector, oneVector or CuVector, and AcceleratedKernels will automatically run the code on the right GPU backend (from AMDGPU, Metal, oneAPI, CUDA).
The main idea behind the ImplicitBVH is the use of an implicit perfect binary tree constructed from some bounding volumes. If we had, say, 5 objects to construct the BVH from, it would form an incomplete binary tree as below:
Implicit tree from 5 bounding volumes - i.e. the real leaves:
Tree Level Nodes & Leaves Build Up Traverse Down
1 1 Ʌ |
2 2 3 | |
3 4 5 6 7v | |
4 8 9 10 11 12 13v 14v 15v | V
-------Real------- ---Virtual---
We do not need to store the "virtual" nodes in memory; rather, we can compute the number of virtual nodes we need to skip to get to a given node index, following the fantastic ideas from [1].
As contact detection is one of the most computationally-intensive parts of physical simulation and computer
vision applications, we spent a stupid amount of time optimising this implementation has been optimised for maximum performance and scalability:
- Computing bounding volumes is optimised for triangles, e.g. constructing 249,882
BSphere{Float32}on a single thread takes 4.47 ms on my Mac M1. The construction itself has zero allocations; all computation can be done in parallel in user code. - Building a complete bounding volume hierarchy from the 249,882 triangles of
xyzrgb_dragon.objtakes 11.83 ms single-threaded. The sorting step is the bottleneck, so multi-threading the Morton encoding and BVH up-building does not significantly improve the runtime; waiting on a multi-threaded sorter.- Building the BVH on an Nvidia A100 takes 409.58 μs!
- Contact detection (
traverse) of the same 249,882BSphere{Float32}for the triangles (aggregated intoBBox{Float32}parents) takes 107.25 ms single-threaded on an Intel IceLake 8570 and 37.25 ms with 4 threads, at 72% strong scaling.- Traversing the BVH on an Nvidia A100 takes 1.14 ms!
- Ray-tracing (
traverse_rays) of 100,000 random rays over the same 249,882BSphere{Float32}for the triangles (aggregated intoBBox{Float32}parents) takes 671.01 ms single-threaded on an Intel IceLake 8570 and 216.99 ms with 4 threads, at 77% strong scaling.- Ray-tracing on an Nvidia A100 takes 2.00 ms.
Only fundamental Julia types are used - e.g. struct, Tuple, UInt, Float64 - which can be straightforwardly inlined, unrolled and fused by the compiler. These types are also straightforward to transpile to accelerators via KernelAbstractions.jl such as CUDA, AMDGPU, oneAPI, Apple Metal.
- Avoiding / exposing memory allocations (temps, minmax reduce, morton order, etc.)
- GPU CI
The implicit tree formulation (genius idea!) which forms the core of the BVH structure originally appeared in the following paper:
[1] Chitalu FM, Dubach C, Komura T. Binary Ostensibly‐Implicit Trees for Fast Collision Detection. InComputer Graphics Forum 2020 May (Vol. 39, No. 2, pp. 509-521).
ImplicitBVH.jl is MIT-licensed. Enjoy.