Hierarchical Topology Compression for 3D Graphics Data
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current 3D data representation methods, such as mesh and BREP, face challenges in achieving both efficient compression and accurate geometric representation, leading to large file sizes and performance issues in graphics display and analysis, especially when zoomed in or magnified, due to fixed LOD resolutions and the inability of mainstream graphics APIs to directly accept BREP surfaces.
Innovation Solution
A method is introduced that organizes topology elements in a hierarchical structure, represented as four arrays, and aggregates numerical values by type for lossy compression, utilizing a quantization engine and compression engine to facilitate efficient data compression, allowing for better compression of geometric elements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If LOD mesh representation is used for fast graphics display, then graphics performance is improved, but file size increases and geometric accuracy deteriorates
Solution Approach 1:
The patent embeds a compressed representation of the original BREP model within the LOD mesh structure. The compressed BREP data is nested inside the mesh file, allowing the system to store both the simplified mesh for fast display and the compressed original geometry for accuracy, creating a nested data structure that resolves the contradiction between speed and file size.
Solution Approach 2:
The patent applies compression algorithms that transform the parameter representation of geometric data. By changing how geometric parameters are encoded and stored (using compression techniques), the system reduces the quantity of data needed to represent the same geometric information, thereby reducing file size while maintaining display performance.
2Speed
If LOD mesh representation is used for fast graphics display, then graphics performance is improved, but geometric accuracy deteriorates
Solution Approach 1:
The patent embeds a compressed representation of the original BREP model within the LOD mesh structure. The compressed BREP data is nested inside the mesh file, allowing the system to store both the simplified mesh for fast display and the compressed original geometry for accuracy, creating a nested data structure that resolves the contradiction between speed and file size.
Solution Approach 2:
The patent enables dynamic switching between different levels of geometric representation. The system can dynamically choose to display the simplified mesh for speed or access the compressed BREP data for higher accuracy when needed, making the geometric representation flexible rather than fixed, thereby resolving the contradiction between display speed and geometric accuracy.
3Measurement precision
If BREP representation is used for accurate geometric representation, then geometric accuracy is improved, but file size increases
Solution Approach 1:
The patent applies compression algorithms that transform the parameter representation of geometric data. By changing how geometric parameters are encoded and stored (using compression techniques), the system reduces the quantity of data needed to represent the same geometric information, thereby reducing file size while maintaining display performance.
Data Source
AI summary
A system, method, and computer program for organizing elements for compression, comprising nesting a hierarchical topological structure having a plurality of elements; arranging said plurality of elements in a pattern to facilitate data compression; representing said pattern as four arrays; and compressing said plurality of elements from said arrays, and appropriate means and computer-readable instructions.


