Triangle Strip Compression

Martin Isenburg

In this paper we introduce a simple and efficient scheme for encoding the connectivity and the stripification of a triangle mesh. Since generating a good set of triangle strips is a hard problem, it is desirable to do this just once and store the computed strips with the triangle mesh. However, no previously reported mesh encoding scheme is designed to include triangle strip information into the compressed representation. Our algorithm encodes the stripification and the connectivity in an interwoven fashion, that exploits the correlation existing between the two.


  • [i-tsc-00.pdf slides] Martin Isenburg, Triangle Strip Compression, Proceedings of Graphics Interface 2000, pages 197-204, May 2000.
    ---> appeared as a journal version in Computer Graphics Forum, Volume 20, Issue 2, pages 91-101, June 2001.
  • related publication:

  • [i-tf-00.pdf slides] Martin Isenburg, Triangle Fixer: Edge-based Connectivity Compression, European Workshop on Computational Geometry 2000, pages 18-23, March 2000.
  • [is-ff-00.pdf slides] Martin Isenburg, Jack Snoeyink, Face Fixer: Compressing Polygon Meshes with Properties, Proceedings of SIGGRAPH 2000, pages 263-270, July 2000.
  • results:

  • skull
  • fandisk
  • eight
  • bunny
  • triceratops
  • download:

  • video: tsc.ram
  • slides: tsc.ppt
  • interactive demo software and models: