Sciweavers

Share
COMPGEOM
1999
ACM

Mesh Collapse Compression

11 years 10 months ago
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.
Martin Isenburg, Jack Snoeyink
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 1999
Where COMPGEOM
Authors Martin Isenburg, Jack Snoeyink
Comments (0)
books