BVH Data Compression by Removing Rebuildable 3D Geometry
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The large size of Bounding Volume Hierarchy (BVH) data for 3D graphics consumes significant storage space, making it difficult to fit on removable media and prolongs download and installation times, while conventional compression techniques provide poor data reduction ratios.
Innovation Solution
A lossless data compression method that removes recoverable and rebuildable data from BVH structures, using a compression function during offline development and a decompression function at runtime to restore the data, ensuring compatibility with GPUs for real-time raytracing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If conventional compression techniques are used on BVH data, then some data reduction is achieved, but the compression ratio is poor and storage space is still excessively large
Solution Approach 1:
The patent extracts and removes redundant data elements from the BVH structure, specifically duplicate triangle data and rebuildable bounding volume information. By identifying and eliminating these unnecessary components, the compression achieves significant size reduction without requiring complex compression algorithms, directly resolving the poor compression ratio problem.
Solution Approach 2:
The patent discards redundant data during compression that can be recovered or rebuilt during decompression. Triangle data is removed and recovered from the model, while bounding volumes are discarded and rebuilt from triangle data. This approach enables aggressive compression while maintaining full functionality, solving the storage space issue effectively.
2Reliability
If BVH data is stored in full uncompressed form, then rendering performance is maintained, but storage space consumption is excessive and transfer times are prolonged
Solution Approach 1:
The patent performs preliminary organization and identification of redundant data during the compression phase. By pre-identifying duplicate triangle data and rebuildable bounding volumes before compression, the system prepares the data structure for efficient compression while ensuring that all necessary information for rendering performance is preserved or can be reconstructed.
Solution Approach 2:
The patent changes the representation parameters of the BVH data by storing only essential unique information and deriving other parameters during decompression. Instead of storing complete bounding volume data, the system stores compact representations that can be expanded back to full precision during runtime, maintaining rendering performance while reducing storage requirements.
3Quantity of substance
If redundant data is removed from BVH structure, then data size is reduced, but data structure complexity increases
Solution Approach 1:
The patent segments the BVH data into distinct functional components: essential structure data, triangle data, and bounding volume data. By separating these components and identifying redundancy within each segment independently, the compression process becomes more manageable and the resulting structure, while different from the original, follows a systematic pattern that simplifies implementation.
Data Source
AI summary
The present concepts relate to lossless data compression techniques for reducing the size of a data structure. Certain data in the data structure that can be either recovered from another source or rebuilt from other available information may be removed from the data structure. To further reduce data size, the retained data in the data structure may be packed into a smaller-bit encoding data type. Additionally, to reduce the data size even more, the packed data may be zipped using a lossless data compression algorithm. To regain the original data structure, the process may be reversed. The zipped data may be unzipped using a lossless data decompression algorithm. The packed data may be unpacked into the original bit-sized data encoding. The removed data may be restored by either recovering it from another source or rebuilding it from other available information.