Polygon Mesh Compression With Priority-Based Pivot Vertices

The patent applies preliminary action by pre-ordering vertices using depth-first search (DFS) traversal before compression. This preprocessing step assigns sequential indices to vertices based on their DFS visit order, which is stored and reused during both encoding and decoding. By establishing this vertex ordering in advance, the method eliminates the need for complex split vertex offset and position signaling, as the predetermined DFS order naturally handles vertex connectivity without requiring additional split information.

The patent extracts and removes the need for split vertex offset and position signaling from the mesh compression process. By using DFS-based vertex ordering, the method separates the connectivity representation from the traditional approach that requires explicit split information. The DFS order inherently captures vertex connectivity relationships, allowing the extraction of split information requirements while maintaining accurate mesh reconstruction through the predetermined vertex sequence.

The patent applies preliminary action by performing DFS-based vertex ordering as a preprocessing step before compression. This initial ordering action establishes a vertex sequence that minimizes splits during encoding, and the same ordering is reused during decoding. By taking this preliminary ordering action, the method achieves both encoding simplicity and high efficiency, as the predetermined DFS order naturally reduces the number of splits without complicating the encoding process.