Refit Always —Precomputed Ensembles of Bounding Volume Hierarchies for Parametric Animations
Open Access
- 13 November 2026
- journal article
- research article
- Published by Wiley in Computer Graphics Forum
- p. e70645
Abstract
Bounding Volume Hierarchies (BVHs) are an integral part of modern real‐time rendering and simulation systems. For animated geometry, however, the runtime cost of rebuilding the BVH every frame to match the deformed geometry is often prohibitive. State‐of‐the‐art systems therefore amortize costs in several ways that negatively impact BVH quality: multi‐level BVHs confine updates to dynamic geometry, fast builders are chosen among algorithms striking different balances between BVH build time and BVH quality, and the BVH topology is updated at a lower temporal frequency with most frames only refitting bounding volumes instead of rebuilding the entire hierarchy. In this work, we present a parametric BVH, which is able to represent parametric animations without an expensive BVH rebuild within the scarce frame budget, and without the usual quality degradation associated with a BVH refit. For this, we precompute a small set of BVH topologies that jointly cover the animation's pose space with low error. At runtime, we obtain a BVH for the current pose by first selecting a BVH from the precomputed set, followed by a refit. We evaluate the practicality of our method on a large set of skeletal animations from the Mixamo dataset [Ado26]. Our approach matches results of high‐quality BVH builders at the significantly lower runtime cost of a BVH refit. Compared to the common methodology of rebuilding the BVH each frame using a fast builder (e.g. LBVH), this equates to 1.25 × lower SAH costs with 2.4 × lower runtimes.Keywords
This publication has 23 references indexed in Scilit:
- A Survey on Bounding Volume Hierarchies for Ray TracingComputer Graphics Forum, 2021
- Binary Ostensibly‐Implicit Trees for Fast Collision DetectionComputer Graphics Forum, 2020
- Parallel Reinsertion for Bounding Volume Hierarchy OptimizationComputer Graphics Forum, 2018
- Parallelizing the dual revised simplex methodMathematical Programming Computation, 2017
- Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy ConstructionIEEE Transactions on Visualization and Computer Graphics, 2017
- Fast Insertion‐Based Optimization of Bounding Volume HierarchiesComputer Graphics Forum, 2013
- Fast BVH Construction on GPUsComputer Graphics Forum, 2009
- RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs2006
- Distributed interactive ray tracing of dynamic scenes2004
- Heuristics for ray tracing using space subdivisionThe Visual Computer, 1990