Compact Encodings of Planar Orthogonal Drawings

  • Amrita Chanda
  • Ashim Garg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)

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.

References

  1. 1.
    R. C. Chuang, A. Garg, X. He, M. Y. Kao, and H. Lu. Compact encoding of planar graphs via canonical ordering and multiple parenthesis. In Proc. International Colloqium on Automata, Languages and Programming (ICALP), pp. 118–129, 1998.Google Scholar
  2. 2.
    H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41–51, 1990.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    G. Di Battista, G. Liotta, and F. Vargiu. Diagram Server. J. Visual Lang. Comput., 6(3):275–298, 1995.CrossRefGoogle Scholar
  4. 4.
    G. Di Battista, G. Liotta, and F. Vargiu. Spirality and optimal orthogonal drawings. SIAM J. Comput., 27(6):1764–1811, 1998.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Xin He, M.-Y. Kao, and H. Lu. A fast general methodology for informationtheoretically optimal encodings of graphs. SIAM J. Comput., 30(3):838–846, 2000.Google Scholar
  6. 6.
    G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33thA nnu. IEEE Sympos. Found. Comput. Sci., pages 101–110, 1992.Google Scholar
  7. 7.
    R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421–444, 1987.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230–1234, 1989.CrossRefMathSciNetGoogle Scholar
  9. 9.
    W. T. Tutte. A census of planar triangulation. Canad. J. Math., 14:21–38, 1962. awings.MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Amrita Chanda
    • 1
  • Ashim Garg
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity at BuffaloBuffaloNY

Personalised recommendations