Proceedings: GI 2002

Compressing Polygon Mesh Connectivity with Degree Duality Prediction

Martin Isenburg

Proceedings of Graphics Interface 2002: Calgary, Alberta, Canada, 27 - 29 May 2002, 161-170

DOI 10.20380/GI2002.19

  • BibTeXex

    @inproceedings@inproceedings{Isenburg:CPM:2002,
     title = {Compressing Polygon Mesh Connectivity with Degree Duality Prediction},
     author = {Martin Isenburg},
     booktitle = (Proceedings of the Graphics Interface 2002 Conference, May 27-29, 2002, Calgary, Alberta, Canada},
     url = {http://graphicsinterface.org/wp-content/uploads/gi2002-19.pdf},
     year = {2002},
     month = {May},
     location = {Calgary, Alberta},
     pages = {161--170}
    }
    

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.