GVU Technical Report Number:
GIT-GVU-99-17
Title:
Guaranteed 3.67V Bit Encoding of Planar Triangle Graphs
Authors:
Davis King
Jarek Rossignac
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.
Keywords:
3D representations, triangle meshes, planar graph encoding, geometry
compression
You can access this technical report via:
PDF
Postscript
|
