Compressing Polygon Mesh Connectivity with Degree Duality Prediction

@inproceedings{Isenburg2002CompressingPM,
  title={Compressing Polygon Mesh Connectivity with Degree Duality Prediction},
  author={Martin Isenburg},
  booktitle={Graphics Interface},
  year={2002}
}
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 [26]. 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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
56 Citations
29 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Mesh connectivity coding by dual graph approach

  • J. Li, C. C. Kuo, H. Chen
  • Technical report, March
  • 1998
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…