Abstract
AbstractWe consider the problem of designing a succinct data structure for representing the connectivity of planar triangulations. The main result is a new succinct encoding achieving the information-theory optimal bound of 3.24 bits per vertex, while allowing efficient navigation. Our representation is based on the bijection of Poulalhon and Schaeffer (Algorithmica, 46(3):505–527, 2006) that defines a mapping between planar triangulations and a special class of spanning trees, called PS-trees. The proposed solution differs from previous approaches in that operations in planar triangulations are reduced to operations in particular parentheses sequences encoding PS-trees. Existing methods to handle balanced parentheses sequences have to be combined and extended to operate on such specific sequences, essentially for retrieving matching elements. The new encoding supports extracting the d neighbors of a query vertex in O(d) time and testing adjacency between two vertices in O(1) time. Additionally, we provide an implementation of our proposed data structure. In the experimental evaluation, our representation reaches up to 7.35 bits per vertex, improving the space usage of state-of-the-art implementations for planar embeddings.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference42 articles.
1. Aleardi, L.C., Devillers, O., Rossignac, J.: ESQ: editable squad representation for triangle meshes. In: Conference on Graphics, Patterns and Images (SIBGRAPI), pp. 110–117 (2012)
2. Castelli Aleardi, L., Devillers, O., Schaeffer, G.: Succinct representations of planar maps. Theoret. Comput. Sci. 408(2), 174–187 (2008)
3. Aleardi, L.C., Devillers, O., Mebarki, A.: Catalog-based representation of 2D triangulations. Int. J. Comput. Geom. Appl. 21(04), 393–402 (2011)
4. Aleardi, L.C., Devillers, O., Schaeffer, G.: Succinct representation of triangulations with a boundary. In: Algorithms and Data Structures (WADS). Springer, Waterloo, Canada, pp. 134–145 (2005)
5. Aleardi, L.C., Devillers, O.: Array-based compact data structures for triangulations: Practical solutions with theoretical guarantees. J. Comput. Geom. 9(1), 247–289 (2018)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献