Paper Info
Title
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
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.
Year
DOI
Venue
2007
10.1093/ietfec/e91-a.9.2284
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Keywords
DocType
Volume
maximum degree,n-vertex rectangular drawing r,degree query,scheme encodes r,constant time,rectangular drawing r,efficient query supports,compact encoding,rich set,rectangular drawings,plane drawing,simple encoding scheme,rectangular drawing,rectangular drawing rwith maximum
Conference
E91-A
Issue
ISSN
Citations 
9
0302-9743
3
PageRank 
References 
Authors
0.45
11
2
Name
Order
Citations
PageRank
Katsuhisa Yamanaka16015.73
Shin-ichi Nakano224624.40