Technical Reports

The ICICS/CS Reading Room


UBC CS TR-99-08 Summary

Spirale Reversi: Reverse decoding of the Edgebreaker encoding, October 4, 1999 Martin Isenburg and Jack Snoeyink, 12 pages

We present a simple linear time algorithm for decoding Edgebreaker encoded triangle meshes in a single traversal. The Edgebreaker compression technique , introduced by Rossignac, encodes the topology of meshes homeomorphic to a sphere with a guaranteed 2 bits per triangle or less. The encoding algorithm visits every triangle of the mesh in a depth-first order. The original decoding algorithm recreates the triangles in the same order they have been visited by the encoding algorithm and exhibits a worst case time complexity of O(n^2). More recent work by Szymczak and Rossignac uses the same traversal order and improves the worst case to O(n). However, for meshes with handles multiple traversals are needed during both encoding and decoding. We introduce here a simpler decompression technique that performs a single traversal and recreates the triangles in reverse order.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.