Graphical Data Compression via Face Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
High-compression techniques for graphical data structures often result in information loss and degradation, particularly in complex objects, leading to propagation of errors and difficulties in storing and retrieving data without further degradation.
Innovation Solution
A computer-implemented method for compressing graphical data structures by accessing and generating compressed definitions of faces, edges, and surfaces, using parameter fields to represent objects, and re-injecting compressed values to avoid error propagation, allowing for significant data reduction while maintaining data integrity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If high-compression techniques are applied to graphical data structures, then data volume is reduced, but information loss and degradation occur
Solution Approach 1:
The patent segments the graphical data structure into independent face definitions, each with its own parameter fields. By processing and compressing each face separately rather than the entire object at once, the system achieves better compression ratios while maintaining local accuracy. Each face can be compressed independently, allowing selective application of compression techniques to different parts of the object based on their complexity and importance.
Solution Approach 2:
The patent applies different compression strategies to different faces based on their local characteristics. Simple faces with regular geometry receive higher compression, while complex faces with intricate details maintain higher precision. This local quality approach ensures that information loss is minimized in critical areas while achieving overall data reduction for the complete object.
2Quantity of substance
If high-compression techniques are applied to graphical data structures, then data volume is reduced, but error propagation occurs through the data structure
Solution Approach 1:
By segmenting the graphical data into independent face definitions, the patent prevents error propagation across the entire structure. Each face is processed and compressed independently, so errors remain localized to individual faces rather than spreading through interconnected data elements. This segmentation breaks the propagation path that would otherwise exist in a unified data structure.
Solution Approach 2:
The patent changes the parameter representation of each face by introducing compressed parameter fields that store essential geometric information in a reduced form. These parameter changes are applied locally to each face definition, transforming the data representation to achieve compression while maintaining the mathematical integrity of each face and preventing cumulative errors.
3Quantity of substance
If repeated storage and retrieval of compressed graphical data is performed, then storage efficiency is improved, but significant further degradation of information occurs
Solution Approach 1:
The patent creates a complete compressed representation of the graphical object that can be copied and stored multiple times without degradation. By establishing a full compressed data structure with all necessary parameter fields for each face, the system enables exact replication of the compressed data. This copied compressed data can be stored, retrieved, and re-stored indefinitely without accumulating additional information loss, unlike incremental compression approaches.
Data Source
AI summary
A computer-implemented method can provide compression of a digital representation of an object. The digital representation can include a graphical data structure with graphical data defining the object in terms of a definition of respective faces of the object. Each face can be defined in terms of a surface for the face and each edge of the face on that surface. The method can include, for respective faces of the object, accessing the definition of the face in the graphical data structure, generating a compressed definition of the face and replacing the definition of the face in the graphical data structure by the compressed definition of the face.