Abstract
We present a linear time algorithm that constructs a planar polyline grid drawing of any plane graph with n vertices and maximum degree d on a (2n − 5) × (3/2n − 7/2) grid with at most 5n − 15 bends and minimum angle > 2/d. In the constructed drawings, every edge has at most three bends and length O(n). To our best knowledge, this algorithm achieves the best simultaneous bounds concerning the grid size, angular resolution, and number of bends for planar grid drawings of high-degree planar graphs. Besides the nice theoretical features, the practical drawings are aesthetically very pleasing. An implementation of our algorithm is available with the AGD-Library (Algorithms for Graph Drawing) [2, 1]. Our algorithm is based on ideas by Kant for polyline grid drawings for triconnected plane graphs [23]. In particular, our algorithm significantly improves upon his bounds on the angular resolution and the grid size for non-triconnected plane graphs. In this case, Kant could show an angular resolution of 4/3d+7 and a grid size of (2n − 5) × (3n − 6), only.
Partially supported by DFG-Grant Mu 1129/3-1, Forschungsschwerpunkt “Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen”.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
AGD-Library. The AGD-Algorithms Library User Manual. Max-Planck-Institut Saarbrücken, Universität Halle, Universität Köln, 1998. Available via “http://www.mpi-sb.mpg.de/AGD/”. Partially supported by the DFG-cluster “Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen”.
D. Alberts, C. Gutwenger, P. Mutzel, and S. Näher. The design of the AGD-Algorithms Library. In G.F. Italiano and S. Orlando, editors, Proceedings of the Workshop on Algorithm Engineering (WAE)’ 97, 1997. Venice, Italy, Sept. 11–13.
T. Biedl. Optimal orthogonal drawings of connected plane graphs. In Proc. Canadian Conference Computational Geometry (CCCG’ 96, volume 5 of International Informatics Series, pages 306–311. Carleton Press, 1996.
T. Biedl. Orthogonal Graph Visualization: The Three-Phase Method with Applications. Ph.D. thesis, Rutgers University, Center for Operations Research, Rutgers, 1997.
T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications, 9:159–180, 1998.
T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97, volume 1353 of Lecture Notes in Computer Science, pages 391–402. Springer-Verlag, 1997.
F. Brandenburg. Nice drawings of graphs and trees are computationally hard. In Proc. of the 7th Interdisciplinary Workshop on Informatics and Psychology, volume 439 of Lecture Notes in Computer Science, pages 1–15. Springer-Verlag, 1988.
M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Interntl. Journal on Computational Geometry and Applications, 7(3):211–224, 1997.
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, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235–282, 1994.
G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303–326, 1997.
P. Eades and P. Mutzel. Graph Drawing Algorithms, CRC Handbook of Algorithms and Theory of Computation, Chapter 9, M. Atallah (Ed.). CRC Press, 1998. To appear.
S. Fialko and P. Mutzel. A new approximation algorithm for the planar augmentation problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’ 98, pages 260–269, San Francisco, California, 1998. ACM Press.
U. Fößmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97, volume 1353 of Lecture Notes in Computer Science, pages 134–145. Springer-Verlag, 1997.
M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods, 4(3):312–316, 1983.
A. Garg. New results on drawing angle graphs. Comput. Geom. Theory Appl., 9(1/2):43–82, 1998.
A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Report CS-94-10, Comput. Sci. Dept., Brown Univ., Providence RI, 1994.
A. Garg and R. Tamassia. Planar drawings and angular resolution: Algorithms and bounds. In Proc. 2nd Annual European Sympos. Algorithms (ESA’ 94, volume 855 of Lecture Notes in Computer Science, pages 12–23. Springer-Verlag, 1994.
A. Garg and R. Tamassia. A new minimum cost flow algorithm with applications to graph drawing. In S. North, editor, Graph Drawing (Proc. GD’ 96, volume 1190 of Lecture Notes in Computer Science, pages 201–216. Springer-Verlag, 1997.
C. Gutwenger and P. Mutzel. Grid embeddings of biconnected planar graphs. Extended Abstract, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1997.
J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549–568, 1974.
C. Hundack, P. Mutzel, I. Pouchkarev, and S. Thome. ArchE: A graph drawing system for archaeology. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97, volume 1353 of Lecture Notes in Computer Science, pages 297–302. Springer-Verlag, 1997.
G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, Special Issue on Graph Drawing, 16(1):4–32, 1996.
G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut für Informatik, Saarbrücken, 1998.
M. R. Kramer and J. van Leeuwen. The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In F. P. Preparata, editor, Advances in Computing Research, volume 2, pages 129–146. JAI Press, Greenwich, Conn., 1985.
P. Mutzel and S. Fialko. New approximation algorithms for planar augmentation. Extended Abstract, to appear, 1998.
H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97, volume 1353 of Lecture Notes in Computer Science, pages 248–261. Springer-Verlag, 1997.
R. Read. New methods for drawing a planar graph given the cyclic order of the edges at each vertex. Congr. Numer., 56:31–44, 1987.
J. A. Storer. On minimal node-cost planar embeddings. Networks, 14:181–212, 1984.
R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SI AM J. Comput., 16(3):421–444, 1987.
R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61–79, 1988.
R. Tamassia and I. G. Tollis. Efficient embedding of planar graphs in linear time. In Proc. IEEE Internat. Sympos. on Circuits and Systems, pages 495–498, 1987.
R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans, on Circuits and Systems, CAS-36(9):1230–1234, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gutwenger, C., Mutzel, P. (1998). Planar Polyline Drawings with Good Angular Resolution. In: Whitesides, S.H. (eds) Graph Drawing. GD 1998. Lecture Notes in Computer Science, vol 1547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37623-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-37623-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65473-5
Online ISBN: 978-3-540-37623-1
eBook Packages: Springer Book Archive