Succinct encoding of binary strings representing triangulations
From MaRDI portal
Publication:2665909
DOI10.1007/s00453-021-00861-4OpenAlexW3187504173MaRDI QIDQ2665909
Diego Seco, José Fuentes-Sepúlveda, Raquel Viaña
Publication date: 19 November 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00861-4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct encoding of arbitrary graphs
- A compact encoding of plane triangulations with efficient query supports
- Encoding toroidal triangulations
- On the succinct representation of graphs
- A simple optimal representation for balanced parentheses
- Optimal coding and sampling of triangulations
- Succinct representations of planar maps
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Explicit Array-Based Compact Data Structures for Triangulations
- A Census of Planar Triangulations
- Succinct Representations of Separable Graphs
- Rank/select operations on large alphabets
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- Array-based Compact Data Structures for Triangulations: Practical Solutions with Theoretical Guarantees
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
- Succinct Trees in Practice
- Succinct Representation of Labeled Graphs
- Algorithms and Data Structures
- Fast and compact planar embeddings
This page was built for publication: Succinct encoding of binary strings representing triangulations
