Edge Hash Maps for Accelerated Triangle Mesh Corner Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing CPU and GPU architectures lack specialized acceleration capability for efficient mesh encoding and decoding, particularly in the creation of corner tables required for mesh compression in graphics processing, which is processing intensive due to the traversal of arbitrarily ordered and linked mesh elements.
Innovation Solution
An apparatus and process are provided to accelerate corner table creation, which is essential for mesh encoding, by optimizing the traversal of connected mesh elements and storing opposite corner indices in a data structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If mesh compression is performed using existing CPU and GPU architectures, then mesh encoding and decoding can be achieved, but the processing is highly intensive and lacks specialized acceleration capability
Solution Approach 1:
The patent segments the mesh data processing into distinct components: vertex data, index data, and corner table data. By separating these elements and processing them through specialized hardware units (vertex processing unit, index processing unit, corner table generation unit), the system achieves efficient parallel processing without requiring a completely complex general-purpose architecture.
Solution Approach 2:
The patent introduces a corner table as an intermediary data structure that facilitates efficient mesh compression. This corner table acts as a mediator between the mesh geometry data and the compression algorithm, enabling faster processing by pre-organizing vertex-corner relationships before compression occurs.
2Reliability
If corner table creation is performed through traversal of arbitrarily ordered and linked mesh elements, then complete mesh data can be processed, but the process becomes highly processing intensive
Solution Approach 1:
The patent applies preliminary action by pre-sorting vertex data and pre-organizing mesh elements before the main compression process. The vertex data is sorted by position coordinates, and the mesh topology is pre-traversed to identify all vertex-corner relationships. This preliminary organization eliminates the need for slow arbitrary traversal during compression, significantly improving corner table creation speed while maintaining complete mesh processing.
3Manufacturing precision
If large 3D triangle meshes with millions of triangles and vertices are stored and transmitted, then high photo-realism and resolution are achieved, but efficient storage and transmission become challenging
Solution Approach 1:
The patent applies parameter changes by transforming the mesh data representation from a traditional vertex-index format to a compressed format utilizing corner tables. This changes the organizational parameters of the data structure, allowing millions of vertices and triangles to be represented with fewer bytes. The compression achieves high storage efficiency while preserving the complete geometric detail required for photo-realism.
Data Source
Figure 1
Figure 2A
Figure 2B
AI summary
Corner table creation for graphics processing is described. An example of an apparatus includes corner data generator circuitry, including a circuit to generate a plurality of vertex-corner lists for a plurality of portions of a triangle mesh, wherein a vertex-corner list for a portion includes an index for a vertex, a count of corners for the vertex, and a list of corners associated with the vertex, and a circuit to receive the vertex-corner lists and generate one or more edge hash maps, each edge hash map including corner indices for edges of the triangle mesh.