“Real time compression of triangle mesh connectivity” by Gumhold and Straßer

In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough for real time applications. The achieved space compression rates keep pace with the best rates reported for any known global compression algorithm. These nice properties have great benefits for several important applications. Naturally, the technique can be used to compress triangle meshes without significant delay before they are stored on external devices or transmitted over a network. The presented decompression algorithm is very simple allowing a possible hardware realization of the decompression algorithm which could significantly increase the rendering speed of pipelined graphics hardware.

1. E. M. Arkin, M. Held, J. S. B. Mitchell, and S. S. Skiena. Hamiltonian triangulations for fast rendering. Lecture Notes in Computer Science, 855:36-57, 1994.]]
2. Rueven Bar-Yehuda and Craig Gotsman. Time/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics, 15(2):141-152, April 1996.]]
3. M. Deering. Geometry compression. In Computer Graphics (SIGGRAPH ’95 Proceedings), pages 13-20, 1995.]]
4. Francine Evans, Steven S. Skiena, and Amitabh Varshney. Optimizing triangle strips for fast rendering. In IEEE Visualization ’96. IEEE, October 1996. ISBN 0-89791-864-9.]]
5. Silicon Graphics Inc. GL programming guide. 1991.]]
6. Scott Meyers. Effective C++ : 50 specific ways to improve your programs and designs. – 2. ed. Addison-Wesley, Reading, MA, USA, 1997.]]
7. Jackie Neider, Tom Davis, and Mason Woo. OpenGL Programming Guide I The Official Guide to Learning OpenGL, Version 1.1. Addison-Wesley, Reading, MA, USA, 1997.]]
8. Gabriel Taubin and Jarek Rossignac. Geometric compression through topological surgery. Technical report, Yorktown Heights, NY 10598, January 1996. IBM Research Report RC 20340.]]