Graph Drawing
Lecture Notes in Computer Science, 2002, Volume 2528/2002, 174-186, DOI: 10.1007/3-540-36151-0_17

Compact Encodings of Planar Orthogonal Drawings

Amrita Chanda and Ashim Garg

View Related Documents

Abstract

We present time-efficient algorithms for encoding (and decoding) planar orthogonal drawings of degree-4 and degree-3 biconnected and triconnected planar graphs using small number of bits. We also present time-efficient algorithms for encoding (and decoding) turn-monotone planar orthogonal drawing.
Research supported by NSF CAREER Award IIS-9985136and NSF CISE Research Infrastructure Award No. 0101244.

Fulltext Preview

Image of the first page of the fulltext document