Optimal Succinct Representations of Planar Maps - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Optimal 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 is here 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.
Fichier principal
Vignette du fichier
succinct-triangulation.pdf (202.2 Ko) Télécharger le fichier

Dates and versions

inria-00098669 , version 1 (25-09-2006)



Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Optimal Succinct Representations of Planar Maps. Proceedings of the 22nd Annual Symposium on Computational Geometry, Jun 2006, Sedona, Arizona, United States. ⟨10.1145/1137856.1137902⟩. ⟨inria-00098669⟩
129 View
214 Download



Gmail Facebook Twitter LinkedIn More