Quick encoding of plane graphs in _214 bits per edge
From MaRDI portal
Publication:975433
Recommendations
Cites work
- A Census of Planar Maps
- A Census of Planar Triangulations
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- An information-theoretic upper bound of planar graphs using triangulation
- Compressing the Property Mapping of Polygon Meshes
- Dissections and trees, with applications to optimal mesh encoding and to random sampling
- Efficient Coding of Nontriangular Mesh Connectivity
- scientific article; zbMATH DE number 2079399 (Why is no real title available?)
- On the succinct representation of graphs
- Optimal coding and sampling of triangulations
- Short encodings of planar graphs and maps
- Simplication and compresssion of 3D meshes
- Succinct representation of general unlabeled graphs
Cited in
(3)
This page was built for publication: Quick encoding of plane graphs in \(\log _{2}14\) bits per edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975433)