Bounding Volume Hierarchy Compression via Node Inheritance

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The large size of bounding volume hierarchies in computer graphics rendering limits their storage in local memory, leading to inefficiencies due to long latency access to backing stores, while reducing model complexity to fit within memory constraints decreases rendering quality.

Innovation Solution

A method for compressing bounding volume hierarchies by encoding each node to indicate whether it inherits values from a parent node, reducing the number of stored coordinates and using variable-length node structures, along with approximating coordinate values to minimize memory usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If the bounding volume hierarchy is stored in local memory, then rendering speed is improved, but the model size is limited by memory capacity

Engineering Contradiction:
Improverendering speedVSAvoidmodel size
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The bounding volume hierarchy data is segmented into variable-length node structures where each node only stores the coordinates it uniquely defines. Nodes inherit coordinates from parent nodes when applicable, dividing the complete bounding volume data into minimal necessary segments across the hierarchy tree.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a new dimension of data organization by adding inheritance information to each node, transforming the traditional fixed-structure bounding volume data into a hierarchical inheritance structure that reduces redundant coordinate storage across multiple levels of the tree.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Volume of stationary object

If the bounding volume hierarchy is compressed to fit in local memory, then memory usage is reduced, but rendering accuracy may deteriorate

Engineering Contradiction:
Improvememory usageVSAvoidrendering accuracy
Core Design Contradiction:
Volume of stationary objectVSManufacturing precision

Solution Approach 1:

The patent performs preliminary organization of bounding volume data during the compression phase, structuring nodes to inherit coordinates from parents when possible. This preliminary structuring enables efficient storage without requiring approximation or loss of precision, as the inheritance structure naturally captures the hierarchical relationships needed for accurate rendering.

Inventive Principle:
Principle #10Preliminary action

3Manufacturing precision

If all coordinates are stored for each node, then rendering accuracy is maintained, but memory consumption increases

Engineering Contradiction:
Improverendering accuracyVSAvoidmemory consumption
Core Design Contradiction:
Manufacturing precisionVSVolume of stationary object

Solution Approach 1:

The patent extracts redundant coordinate information from child nodes when those coordinates can be inherited from parent nodes. Instead of storing complete coordinate sets for every node, the system extracts only the unique coordinate information needed at each node level, significantly reducing memory consumption while preserving rendering accuracy.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

Parent node coordinates serve multiple functions by being inherited by multiple child nodes. A single set of coordinates stored in a parent node can define bounding volume boundaries for multiple descendant nodes, making the coordinate data universal across the hierarchy and eliminating redundant storage.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS9224235B2System, method, and computer program product for compression of a bounding volume hierarchy
Publication Date: 2015.12.29 NVIDIA CORP
  • US9224235B2 patent drawing
  • US9224235B2 patent drawing
  • US9224235B2 patent drawing

AI summary

A system, method, and computer program product for compressing a bounding volume hierarchy is disclosed. The method includes the steps of receiving a bounding volume hierarchy and encoding the bounding volume hierarchy to generate an encoded bounding volume hierarchy, wherein each node in the encoded bounding volume hierarchy indicates whether the node inherits zero or more values from a parent node. The bounding volume hierarchy includes a plurality of nodes, each node in the plurality of nodes is associated with a bounding volume.