
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A Compact Encoding of Rectangular Drawings with Efficient Query Supports
Katsuhisa YAMANAKA Shinichi NAKANO
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E91A
No.9
pp.22842291 Publication Date: 2008/09/01
Online ISSN: 17451337
DOI: 10.1093/ietfec/e91a.9.2284
Print ISSN: 09168508 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: graph, algorithm, graph encoding, rectangular drawing, query supports,
Full Text: PDF(274.5KB)>>
Summary:
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 m + 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.

