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.
Chapter PDF
Similar content being viewed by others
References
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.
H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41–51, 1990.
G. Di Battista, G. Liotta, and F. Vargiu. Diagram Server. J. Visual Lang. Comput., 6(3):275–298, 1995.
G. Di Battista, G. Liotta, and F. Vargiu. Spirality and optimal orthogonal drawings. SIAM J. Comput., 27(6):1764–1811, 1998.
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.
G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33thA nnu. IEEE Sympos. Found. Comput. Sci., pages 101–110, 1992.
R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421–444, 1987.
R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230–1234, 1989.
W. T. Tutte. A census of planar triangulation. Canad. J. Math., 14:21–38, 1962. awings.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chanda, A., Garg, A. (2002). Compact Encodings of Planar Orthogonal Drawings. In: Goodrich, M.T., Kobourov, S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36151-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-36151-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00158-4
Online ISBN: 978-3-540-36151-0
eBook Packages: Springer Book Archive