A Compact Encoding of Rectangular Drawings with Efficient Query Supports

Authors:
Katsuhisa Yamanaka;Shin-ichi Nakano
Affiliations:
-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 10
Cited 0

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

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 R with maximum degree 3, our scheme encodes R with 5/3m + o(n) bits where n is the number of vertices of R and m is the number of edges of R. Also we give an algorithm to supports a rich set of queries, including adjacency and degree queries on the faces, in constant time.