Succinct representations of planar maps

This paper addresses the problem of representing the connectivity information of geometric objects, using as little memory as possible. As opposed to raw compression issues, the focus here is on designing data structures that preserve the possibility of answering incidence queries in constant time. We propose, in particular, the first optimal representations for 3-connected planar graphs and triangulations, which are the most standard classes of graphs underlying meshes with spherical topology. Optimal means that these representations asymptotically match the respective entropy of the two classes, namely 2 bits per edge for 3-connected planar graphs, and 1.62 bits per triangle, or equivalently 3.24 bits per vertex for triangulations. These representations support adjacency queries between vertices and faces in constant time.

[1]  R. Mullin,et al.  The enumeration of c-nets via quadrangulations , 1968 .

[2]  W. T. Tutte.  A Census of Planar Maps , 1963, Canadian Journal of Mathematics.

[3]  Olivier Devillers,et al.  Dynamic updates of succinct triangulations , 2005, CCCG.

[4]  Dominique Poulalhon,et al.  Optimal Coding and Sampling of Triangulations , 2003, Algorithmica.

[5]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[6]  Neil A. Dodgson,et al.  Advances in Multiresolution for Geometric Modelling , 2005 .

[7]  Jeffery R. Westbrook,et al.  Short Encodings of Planar Graphs and Maps , 1995, Discret. Appl. Math..

[8]  Venkatesh Raman,et al.  Representing dynamic binary trees succinctly , 2001, SODA '01.

[9]  Xin He,et al.  Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses , 1998, ICALP.

[10]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  Avi Wigderson,et al.  Succinct Representations of Graphs , 1984, Inf. Control..

[12]  Rajeev Raman,et al.  Succinct ordinal trees with level-ancestor queries , 2004, SODA '04.

[13]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

[14]  J. Ian Munro,et al.  Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[15]  Éric Fusy,et al.  Dissections and trees, with applications to optimal mesh encoding and to random sampling , 2005, SODA '05.

[16]  Guy E. Blelloch,et al.  Compact representations of separable graphs , 2003, SODA '03.

[17]  Mariette Yvinec,et al.  Triangulations in CGAL , 2002, Comput. Geom..

[18]  Olivier Devillers,et al.  Succinct Representation of Triangulations with a Boundary , 2005, WADS.

[19]  Olivier Devillers,et al.  Optimal succinct representations of planar maps , 2006, SCG '06.

[20]  Pierre Alliez,et al.  Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes , 2002, Graph. Model..

[21]  Yi-Ting Chiang,et al.  Orderly spanning trees with applications to graph encoding and graph drawing , 2001, SODA '01.

[22]  Olivier Devillers,et al.  2D Triangulation Representation Using Stable Catalogs , 2006, CCCG.

[23]  György Turán,et al.  On the succinct representation of graphs , 1984, Discret. Appl. Math..

[24]  Pierre Alliez,et al.  Recent advances in compression of 3D meshes , 2005, 2005 13th European Signal Processing Conference.

[25]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[26]  Martin Isenburg,et al.  Graph Coding and Connectivity Compression , 2005 .

[27]  Daniel Thalmann,et al.  Star-Vertices: A Compact Representation for Planar Meshes with Adjacency Information , 2001, J. Graphics, GPU, & Game Tools.