A Compact Encoding of Rectangular Drawings with Efficient Query Supports

Authors:
Katsuhisa Yamanaka;Shin-Ichi Nakano
Affiliations:
Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho Kiryu, Gunma, 376-8515, Japan;Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho Kiryu, Gunma, 376-8515, Japan
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 12
Cited 1

A note on succinct representations of graphs

Information and Control
Floor-planning by graph dualization: 2-concave rectilinear modules

SIAM Journal on Computing
Short encodings of planar graphs and maps

Discrete Applied Mathematics
Compact pat trees

Compact pat trees
On Floor-Plan of Plane Graphs

SIAM Journal on Computing
Orderly spanning trees with applications to graph encoding and graph drawing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Concrete Math

Concrete Math
Succinct Representation of Balanced Parentheses and Static Trees

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
Succinct representation of balanced parentheses, static trees and planar graphs

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Succinct static data structures

Succinct static data structures
Enumerating Floorplans with n Rooms

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Optimal binary representation of mosaic floorplans and baxter permutations

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

A rectangular drawing is a plane drawing in which every face is a rectangle. In this paper we give a simple encoding scheme for rectangular drawings. Given a rectangular drawing Rwith maximum degree 3, our scheme encodes Rwith $\frac{5}{3}m + o(n)$ bits for each n-vertex rectangular drawing R, where mis the number of edges of R, and supports a rich set of queries, including adjacency and degree queries on the faces, in constant time.