Triangle Mesh Compression using B-Spline Curves

We present a new method to compress triangle meshes in a lossless manner. Triangle compression requires compression of the geometry (vertices) as well as the topology (connectivity). The method is loosely based on the Edgebreaker algorithm by Rossignac et al. in the sense that the traversal of the mesh is done the same way during compression. We use B-Spline curves to store, compute and predict the geometry or the vertices. We do not need to store the connectivity in our method unlike Edgebreaker. The resulting compressed files are roughly 10% smaller than that from Edgebreaker.

• Type: Conference
• Year: 2003
• Where: CISST
• Authors: Anshuman Razdan, Vinodth Kumar Mohanam, Gerald E. Farin
• Keywords: CISST 2003, Edgebreaker Algorithm, Hardware, Method Unlike Edgebreaker, Triangle Compression