Refit Always —Precomputed Ensembles of Bounding Volume Hierarchies for Parametric Animations

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.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2026-11-13
DOI
https://doi.org/10.1111/cgf.70645
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Refit Always —Precomputed Ensembles of Bounding Volume Hierarchies for Parametric Animations

Carsten Dachsbacher, Jean‐Marc Thiery, Reiner Dolp
Computer Graphics Forum
Computer Graphics and Visualization Techniques
article

Refit Always —Precomputed Ensembles of Bounding Volume Hierarchies for Parametric Animations

Carsten Dachsbacher, Jean‐Marc Thiery, Reiner Dolp
article en

Abstract

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.

Computer Graphics Forum
Karlsruhe Institute of Technology (DE)
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon