A compact encoding ;of rectangular drawings with efficient query supports
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/3 m + o(n) bits where n is the number of vertices of R and in 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.
rectangular drawing query supports algorithm graph graph encoding