Graphics Texture Encoding Partitioning Pattern Selection

The patent applies preliminary action by pre-defining a set of candidate partitioning patterns before encoding begins. Instead of testing all possible patterns exhaustively, the system prepares a limited set of predefined patterns in advance, which are then tested and selected from. This reduces the computational burden while maintaining encoding accuracy by ensuring the optimal pattern is among the predefined candidates.

The patent changes the parameter of partitioning pattern selection from exhaustive search to predefined pattern selection. By modifying the search space from all possible patterns to a limited set of predefined patterns, the system reduces computational complexity while maintaining sufficient encoding accuracy. This parameter change transforms the encoding process from time-consuming brute-force testing to efficient pattern matching.

The patent applies partial action by selecting a representative subset of predefined partitioning patterns that covers the most common and important encoding scenarios. Instead of including all possible patterns (excessive action), the system chooses a carefully curated set of patterns that provides sufficient versatility for practical applications. This partial approach reduces computational complexity while maintaining adequate encoding versatility.

The patent segments the encoding process into distinct phases: predefined pattern selection, pattern testing, and final pattern selection. By dividing the complex task of pattern determination into manageable segments, the system reduces overall computational complexity. The segmentation allows the device to handle pattern selection systematically rather than through exhaustive search, reducing the burden on mobile and handheld devices.