Reverse Edgebreaker Coding for Faster Triangular Mesh Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing mesh encoding and decoding technologies, particularly those using Edgebreaker technology, face inefficiencies in handling large meshes with regular topology, especially in terms of compression performance and decoding speed, and require complex handling of virtual points and table restarts.

Innovation Solution

A reverse version of Edgebreaker coding is implemented to simplify the decoding process by eliminating the need for virtual points and table restarts, optimizing table consumption, and improving memory coherency and caching, while supporting attribute prediction and arithmetic coding.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If forward Edgebreaker decoding is used, then the mesh topology can be reconstructed, but the decoding process requires virtual points and table restarts which increases complexity and reduces speed

Engineering Contradiction:
Improvedecoding speedVSAvoiddecoding process complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies reverse Edgebreaker decoding instead of forward decoding. By inverting the decoding direction and using reverse traversal of the CLERS table, the method eliminates the need for virtual points and table restarts that plague forward decoding approaches. This inversion fundamentally simplifies the decoding process while improving speed.

Inventive Principle:
Principle #13The other way round (Inversion)

2Loss of information

If traditional Edgebreaker implementation is used, then mesh encoding can be performed, but compression performance is suboptimal for large meshes with regular topology

Engineering Contradiction:
Improvecompression performanceVSAvoidencoding efficiency
Core Design Contradiction:
Loss of informationVSProductivity

Solution Approach 1:

The patent uses reverse Edgebreaker encoding which traverses the mesh in reverse order. This reverse traversal pattern is particularly effective for large meshes with regular topology, achieving up to 6% better compression performance by more efficiently capturing the regular patterns in the mesh data.

Inventive Principle:
Principle #13The other way round (Inversion)

3Reliability

If forward traversal is used for attribute decoding, then attributes can be reconstructed, but memory coherency and caching are not optimized

Engineering Contradiction:
Improveattribute reconstruction accuracyVSAvoidmemory access efficiency
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent employs reverse traversal for attribute decoding instead of forward traversal. This reverse traversal order optimizes memory coherency and caching behavior by accessing memory in a pattern that better utilizes CPU caches, reducing memory access latency and improving overall encoding/decoding efficiency.

Inventive Principle:
Principle #13The other way round (Inversion)

Data Source

PatentEP4618020A1Efficient edgebreaker spiral reversi implementation with simplified decoder processing
Publication Date: 2025.09.17 INTERDIGITAL CE PATENT HOLDINGS SAS
  • EP4618020A1 patent drawingFigure 1
  • EP4618020A1 patent drawingFigure 2
  • EP4618020A1 patent drawingFigure 3

AI summary

Systems and methods for reverse edgebreaker coding of triangular mesh information. A mesh decoding method according to some embodiments comprises: obtaining from a bitstream a CLERS table representing an edgebreaker encoding of a topology of a triangular mesh; reconstructing the topology of the triangular mesh using a reverse traversal of the CLERS table; creating a first ordered table of corners of the triangular mesh representing an order of corners traversed during the reverse traversal of the CLERS table; obtaining from the bitstream ordered attribute information representing attributes of respective faces or vertices in the triangular mesh; and reconstructing the attributes of the respective faces or vertices using the attribute information and a forward iteration over the first ordered table of corners.