Compressing Polygon Mesh Connectivity with Degree Duality Prediction
Martin Isenburg
Graphics Interface 2002, May 2002, pp. 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.
BibTeX format:
@inproceedings{Isenburg:2002:CPM,
  author = {Martin Isenburg},
  title = {Compressing Polygon Mesh Connectivity with Degree Duality Prediction},
  booktitle = {Graphics Interface 2002},
  pages = {161--170},
  month = may,
  year = {2002},
}
Search for more articles by Martin Isenburg.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."