A Compact Encoding of Plane Triangulations with Efficient Query Supports

DOI10.1007/978-3-540-77891-2_12MaRDI QIDQ5452159zbMATH OpenOpenAlexFDO

Authors Katsuhisa Yamanaka, Shin-Ichi Nakano

Publication date 25 March 2008

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77891-2_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• A compact encoding of plane triangulations with efficient query supports
• Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
• Optimal coding and sampling of triangulations
• Succinct encoding of binary strings representing triangulations
• scientific article; zbMATH DE number 2038776

Cites work

• A Census of Planar Triangulations
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• Algorithms and Data Structures
• Balanced parentheses strike back
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 5506222 (Why is no real title available?)
• scientific article; zbMATH DE number 1277120 (Why is no real title available?)
• scientific article; zbMATH DE number 1962839 (Why is no real title available?)
• scientific article; zbMATH DE number 2038776 (Why is no real title available?)
• Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
• On the succinct representation of graphs
• Orderly Spanning Trees with Applications
• Orderly spanning trees with applications to graph encoding and graph drawing
• Short encodings of planar graphs and maps
• Succinct representation of balanced parentheses and static trees

Cited in

(11)

• Succinct representation of labeled graphs
• Succinct encoding of binary strings representing triangulations
• Explicit Array-Based Compact Data Structures for Triangulations
• A compact encoding of plane triangulations with efficient query supports
• scientific article; zbMATH DE number 1974118 (Why is no real title available?)
• scientific article; zbMATH DE number 2038776 (Why is no real title available?)
• Array-based compact data structures for triangulations: practical solutions with theoretical guarantees
• Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
• scientific article; zbMATH DE number 917638 (Why is no real title available?)
• I/O-efficient path traversal in succinct planar graphs
• Optimal coding and sampling of triangulations

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 Q5452159)