Mesh Collapse Compression

We present a novel algorithm for encoding the topology of triangular meshes. A sequence of edge contract and divide operations collapses the entire mesh into a single vertex. This implicitly creates a tree with weighted edges. The weights are vertex degrees and capture the topology of the unlabeled mesh. The nodes are vertices and capture the labeling of the mesh. This weighted-edge tree has a very compact encoding.

• Type: Conference
• Year: 1999
• Where: COMPGEOM
• Authors: Martin Isenburg, Jack Snoeyink
• Keywords: COMPGEOM 1999, Discrete Geometry, Entire Mesh, Single Vertex, Unlabeled Mesh