• Guaranteed 3.67V Bit Encoding of Planar Triangle Graphs 

      King, Davis; Rossignac, Jaroslaw R. (Georgia Institute of Technology, 1999)
      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 ...
    • Wrap&zip: Linear decoding of planar triangle graphs 

      Rossignac, Jaroslaw R.; Szymczak, Andrzej (Georgia Institute of Technology, 1999)
      The Edgebreaker compression technique, introduced by Rossignac, encodes any unlabeled triangulated planar graph of t triangles using a string of 2t bits. The string contains a sequence of t letters from the set {C, L, E, ...