Skip to Main content Skip to Navigation
Journal articles

Succinct representations of planar maps

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Saturday, November 8, 2008 - 7:39:40 PM
Last modification on : Friday, February 4, 2022 - 3:19:47 AM
Long-term archiving on: : Tuesday, October 9, 2012 - 3:10:51 PM


Files produced by the author(s)




Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Succinct representations of planar maps. Theoretical Computer Science, Elsevier, 2008, Excursions in Algorithmics: A Collection of Papers in Honor of Franco P. Preparata, 408 (2-3), pp.174-187. ⟨10.1016/j.tcs.2008.08.016⟩. ⟨inria-00337821⟩



Record views


Files downloads