A Compact Encoding of Plane Triangulations with Efficient Query Supports

DOI10.1007/978-3-540-77891-2_12zbMath1132.68799OpenAlexW1570005778MaRDI QIDQ5452159

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

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

Related Items (3)

A compact encoding of plane triangulations with efficient query supports ⋮ Succinct representation of labeled graphs ⋮ I/O-efficient path traversal in succinct planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the succinct representation of graphs
• Short encodings of planar graphs and maps
• Succinct Representation of Balanced Parentheses and Static Trees
• A Census of Planar Triangulations
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
• Balanced parentheses strike back
• Orderly Spanning Trees with Applications
• Algorithms and Data Structures

This page was built for publication: A Compact Encoding of Plane Triangulations with Efficient Query Supports