Title:
Guaranteed 3.67V Bit Encoding of Planar Triangle Graphs
Guaranteed 3.67V Bit Encoding of Planar Triangle Graphs
Files
Author(s)
King, Davis
Rossignac, Jarek
Rossignac, Jarek
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
We present a new representation that is guaranteed to encode any planar triangle graph of V vertices in less than 3.67V bits. Our code improves on all prior solutions to this well studied problem and lies within 13% of the theoretical lower limit of the worst case guaranteed bound. It is based on a new encoding of the CLERS string produced by Rossignac's Edgebreaker compression [Rossignac99]. The elegance and simplicity of this technique makes it suitable for a variety of 2D and 3D triangle mesh compression applications. Simple and fast compression/decompression algorithms with linear time and space complexity are available.
Sponsor
Date Issued
1999
Extent
128188 bytes
Resource Type
Text
Resource Subtype
Technical Report