跳到正文
返回论文列表
cs.GR提交于 已译

NanoVDB 中的动态 GPU 体素网格与体素顺序处理

Dynamic GPU Voxel Grids and Voxel-sequential Processing in NanoVDB

Eftychios Sifakis · Francis Williams · Christopher Horvath · Rohan Sawhney · Mark Harris · Jonathan Swartz · et al.

中文摘要

NanoVDB 数据结构的两项基础性进展:GPU 原生的动态拓扑更新,以及一种体素顺序访问范式,可显著加速稀疏网格上的逐点与模板算子。NanoVDB 的线性化内存布局已带来强劲的 GPU 性能,fVDB 框架(Williams 等,2024)提出的 Index-Grid 概念实现了拓扑与数据分离,并在稀疏机器学习负载中达到最优存储紧凑性。但此前所有 NanoVDB 迭代都假设拓扑静态,使其无法用于仿真与动态几何过程。通过引入一组动态拓扑算子——形态学膨胀、网格合并、剪枝以及跨分辨率粗化与细化——消除了这一限制。这些算子采用位并行(bit-parallel)算法,可在数毫秒内重建包含数亿体素的网格。还引入体素顺序访问范式与数据结构,用于在稀疏数据上运行的 GPU 内核:将活跃体素作为扁平线性序列流式处理,在此过程中最小化或消除树遍历需求,从而实现计算密度与规整性,使复杂模板算子也能接近峰值内存带宽,且存储开销极小。这些贡献共同移除了 NanoVDB 的只读约束,使其成为动态 GPU 仿真与几何操作的高性能主表示。在 3D 重建、流体仿真和大规模网格体素化等应用的基准上评估了新算子的有效性。

关键要点

  1. 01此前 NanoVDB 假设拓扑静态,无法用于仿真和动态几何过程,这是论文要解决的核心限制。
  2. 02引入形态学膨胀、网格合并、剪枝、跨分辨率粗化与细化等动态拓扑算子,用位并行算法在数毫秒内重建数亿体素网格。
  3. 03提出体素顺序访问范式,将活跃体素作为扁平线性序列流式处理,减少或消除树遍历。
  4. 04复杂模板算子可接近峰值内存带宽,存储开销极小,移除了 NanoVDB 的只读约束。
  5. 05在 3D 重建、流体仿真和大规模网格体素化基准上评估新算子。

解读

尚无解读。

原始英文摘要

arXiv:2611.08665v1 Announce Type: cross Abstract: We introduce two fundamental advances to the NanoVDB data structure: dynamic GPU-native topological updates, and a voxel-sequential access paradigm that dramatically accelerates point-wise and stencil-based operators on sparse grids. NanoVDB's linearized memory layout has delivered strong GPU performance, and the Index-Grid concept introduced in the fVDB framework [Williams et al 2024] provided topology/data separation and optimal compactness of storage in sparse machine learning workloads. However, all these prior iterations of NanoVDB assume a static topology that has precluded use of this data structure in simulation and dynamic geometric processes. We eliminate this limitation by introducing a suite of dynamic topology operators -- morphological dilation, grid merging, pruning, and cross-resolution coarsening and refinement. These operators use bit-parallel algorithms to reconstruct grids containing hundreds of millions of voxels in just a few milliseconds. We also introduce a voxel-sequential access paradigm and data structure for GPU kernels operating on sparse data. We stream active voxels as a flat linear sequence, minimizing or eliminating the need for tree traversal in the process. This achieves compute density and regularity that allow even complex stencil-based operators to approach peak memory bandwidth, with minimal storage overhead. Together, these contributions remove the read-only constraint from NanoVDB, establishing it as a high-performance primary representation for dynamic GPU simulation and geometry manipulation. We evaluate the efficacy of our newly introduced operators in benchmarks sourced from applications such as 3D reconstruction, fluid simulation, and large-scale mesh voxelization.

同方向论文 · cs.GR

查看全部 →