@ARTICLE{Gumhold-2002-Connectivitya,
   AUTHOR = {Stefan Gumhold},
   JOURNAL = {Informationstechnik und Technische Informatik},
   AFFILIATIONS = {CGV,GRIS},
   AREAS = {areagp},
   NUMBER = {6},
   PAGES = {308--313},
   TITLE = {Connectivity Coding: New Perspectives for Mesh Compression},
   VOLUME = {44},
   YEAR = {2002},
   URL = {http://tu-dresden.de/die_tu_dresden/fakultaeten/fakultaet_informatik/smt/cgv/publikationen/2002/ccnpfmc/cc.pdf},
   ABSTRACT = {Compact encodings of the connectivity of planar triangulations is a very
	  important subject not only in graph theory but also in computer graphics. For
	  triangle meshes used in computer graphics the topologically planar regions
	  dominate by far. New results by Isenburg et. al [6] even show that the connectivity
	  is sufficient to describe shape by itself. Most coding methods for
	  planar triangulations can be extended to manifolds of bounded genus with
	  the same upper and lower bounds on the bit rate.
	  In 1962 Tutte enumerated the number of different planar triangulations
	  and his results show, that at least 3.245 bits per vertex are necessary to encode
	  the connectivity graph of planar triangulations. In this article we improve the
	  so far best upper bound [4] and show that the connectivity of a planar triangulation
	  can be encoded with less than 3.525 bits per vertex, while ensuring
	  a linear run time for encoding and decoding.}
}