Compact Encodings of Planar Orthogonal Drawings

Authors:
Amrita Chanda;Ashim Garg
Affiliations:
-;-
Venue:
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Year:
2002

Citing 5
Cited 0

On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
Spirality and Optimal Orthogonal Drawings

SIAM Journal on Computing
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs

SIAM Journal on Computing
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Drawing planar graphs using the lmc-ordering

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present time-efficient algorithms for encoding (and decoding) planar orthogonal drawings of degree-4 and degree-3 biconnected and triconnected planar graphs using small number of bits. We also present time-efficient algorithms for encoding (and decoding) turn-monotone planar orthogonal drawings.