Polygon Mesh Connectivity Coding With Incident Face Arrays

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing 3D mesh representation technologies consume significant data resources for creation and transmission, necessitating more efficient encoding and decoding methods to reduce data volume.

Innovation Solution

Implementing dual-degree based connectivity coding to process polygon meshes, which includes generating incident face sets and configuring arrays based on vertex connections for efficient iteration and processing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If traditional mesh encoding methods are used, then the mesh data can be stored and transmitted, but the data volume is large and consumes significant data resources

Engineering Contradiction:

Improvedata volumeVSAvoidcoding efficiency

Core Design Contradiction:

Quantity of substanceVSProductivity

Solution Approach 1:

The patent segments the mesh data processing into distinct components: incident face set generation, array configuration, and ordered iteration. By dividing the encoding process into these modular segments, the system achieves more efficient data representation and reduced redundancy, directly addressing the contradiction between data volume and coding efficiency

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary actions by pre-configuring arrays and establishing incident face sets before the actual encoding process. This preliminary organization of data structures enables more compact representation during encoding, reducing the final data volume while maintaining coding efficiency

Inventive Principle:

Principle #10Preliminary action

2Productivity

If incident face sets are generated for each vertex, then geometry coding efficiency is improved, but the processing complexity increases

Engineering Contradiction:

Improvegeometry coding efficiencyVSAvoidprocessing complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent creates simplified copies of mesh connectivity information through incident face sets and array structures. Instead of processing the complete mesh data structure, the system works with these condensed representations, achieving improved geometry coding efficiency while managing processing complexity through the use of simplified data models

Inventive Principle:

Principle #26Copying

Solution Approach 2:

The patent changes the parameter representation by organizing mesh data into incident face sets with specific array configurations. This parameter transformation converts the traditional mesh structure into a format that improves geometry coding efficiency while the systematic approach to parameter changes keeps processing complexity manageable

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS20250308164A1Efficient iteration of incident faces in polygon meshes

Publication Date: 2025.10.02 TENCENT AMERICA LLC

AI summary

A polygon mesh includes a plurality of vertices that are connected into faces, a first face in the faces includes at least a first vertex, a first previous vertex of the first vertex, a first next vertex of the first vertex in a first list of vertices that are incident to the first face. A method of mesh processing includes generating a first incident face set associated with the first vertex, the first incident face set includes a first set of faces that includes the first vertex as an incident vertex, the first incident face set including the first face. Further, the method includes configuring an array according to the first incident face set associated with the first vertex, and determining an iteration order for processing the first set of faces based on the array.