Succinct encoding of binary strings representing triangulations
From MaRDI portal
Publication:2665909
Recommendations
- A compact encoding of plane triangulations with efficient query supports
- Encoding toroidal triangulations
- Succinct encoding of arbitrary graphs
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Algorithms and Data Structures
- Optimal coding and sampling of triangulations
- scientific article; zbMATH DE number 2038776
- Explicit Array-Based Compact Data Structures for Triangulations
- Binary codes from graphs on triples
- Compression of coordinates of triangulation nodes
Cites work
- A Census of Planar Triangulations
- A compact encoding of plane triangulations with efficient query supports
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- A simple optimal representation for balanced parentheses
- Algorithms and Data Structures
- Alphabet partitioning for compressed rank/select and applications
- Array-based compact data structures for triangulations: practical solutions with theoretical guarantees
- Catalog-based representation of 2D triangulations
- Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
- Encoding toroidal triangulations
- Explicit Array-Based Compact Data Structures for Triangulations
- Fully functional static and dynamic succinct trees
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2079399 (Why is no real title available?)
- On the succinct representation of graphs
- Optimal coding and sampling of triangulations
- Orderly spanning trees with applications to graph encoding and graph drawing
- Rank/select operations on large alphabets
- Succinct encoding of arbitrary graphs
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct representation of balanced parentheses and static trees
- Succinct Representation of Labeled Graphs
- Succinct representations of planar maps
- Succinct representations of separable graphs
- Succinct Trees in Practice
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
Cited in
(7)- A compact encoding of plane triangulations with efficient query supports
- Array-based compact data structures for triangulations: practical solutions with theoretical guarantees
- Algorithms and Data Structures
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Implementing the topological model succinctly
- SCARST: Schnyder compact and regularity sensitive triangulation data structure
- Succinct representations of planar maps
This page was built for publication: Succinct encoding of binary strings representing triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665909)
