A compact encoding of plane triangulations with efficient query supports
DOI10.1016/J.IPL.2010.06.014zbMATH Open1234.68102OpenAlexW2074087808MaRDI QIDQ407553FDOQ407553
Authors: Katsuhisa Yamanaka, Shin-Ichi Nakano 
Publication date: 27 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2115/48327
Recommendations
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge
- Succinct encoding of binary strings representing triangulations
- scientific article; zbMATH DE number 2038776
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Succinct representation of balanced parentheses and static trees
- Balanced parentheses strike back
- On the succinct representation of graphs
- Title not available (Why is that?)
- Optimal coding and sampling of triangulations
- A Census of Planar Triangulations
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
- Short encodings of planar graphs and maps
- Title not available (Why is that?)
- Orderly spanning trees with applications to graph encoding and graph drawing
- Title not available (Why is that?)
- Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
- Orderly Spanning Trees with Applications
- Algorithms and Data Structures
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Succinct representations of planar maps
Cited In (9)
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Succinct encoding of binary strings representing triangulations
- Fast and compact planar embeddings
- A Compact Encoding of Rectangular Drawings with Efficient Query Supports
- Explicit Array-Based Compact Data Structures for Triangulations
- Navigating planar topologies in near-optimal space and time
Uses Software
This page was built for publication: A compact encoding of plane triangulations with efficient query supports
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407553)
