GI logo
GI 2002 Online Papers



Compressing Polygon Mesh Connectivity with Degree Duality Prediction

Martin Isenburg

Abstract

In this paper we present a coder for polygon mesh connectivity that delivers the best connectivity compression rates meshes reported so far. Our coder is an extension of the vertex-based coder for triangle mesh connectivity by Touma and Gotsman[GI98]. We code polygonal connectivity as a sequence of face and vertex degrees and exploit the correlation between them for mutual predictive compression. Because low-degree vertices are likely to be surrounded by high-degree faces and vice versa, we predict vertex degrees based on neighboring face degrees and face degrees based on neighboring vertex degrees.

The Paper

PDF paper (12627 Kb)


Up to Graphics Interface home page