Abstract
In this paper we present a linear algorithm to draw triconnected planar graphs of degree 3 planar on a linear-sized hexagonal grid such that in at most one edge are bends. This algorithm can be used to draw this class of graphs planar with straight lines on a n/2 × n/2 grid, improving the best known grid bounds by a factor 4. We also show how to draw planar graphs of degree at most 3 planar with straight lines such that the minimum angle is ≥ π/6, thereby answering a question of Formann et al.
This work was supported by the ESPRIT Basic Research Actions of the EC under contract No. 7141 (project ALCOM II).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Cohen, R.F., G. Di Battista, R. Tamassia, I.G. Tollis and P. Bertolazzi, A Framework for dynamic graph drawing, to appear in: Proc. ACM Symp. on Computational Geometry, Berlin, 1992.
Di Battista, G., and R. Tamassia, Algorithms for plane representations of acyclic digraphs, Theoret. Comp. Science 61 (1988), pp. 436–441.
Di Battista, G., R. Tamassia and I.G. Tollis, Area requirement and symmetry display in drawing graphs, Proc. ACM Symp. on Computational Geometry, Saarbrücken, 1989, pp. 319–321.
Di Battista, G., R. Tamassia and I.G. Tollis, Constrained visibility representations of graphs, Inf. Proc. Letters 41 (1992), pp. 1–7.
Formann, M., T. Hagerup, J. Haralambides, M. Kaufmann, F.T. Leighton, A. Simvonis, E. Welzl and G. Woeginger, Drawing graphs in the plane with high resolution, Proc. 31th Ann. IEEE Symp. on Found. of Comp. Science, St. Louis, 1990, pp. 86–95.
Fraysseix, H. de, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), pp. 41–51.
Kant, G., A New Method for Planar Graph Drawings on a Grid, Tech. Report, Dept. of Comp. Science, Utrecht University, 1992 (to appear).
Kant, G., and H.L. Bodlaender, Triangulating Planar Graphs While Minimizing the Maximum Degree, to appear in: Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT '92), Lecture Notes in Comp. Science, Springer-Verlag, Berlin/Heidelberg, 1992.
Schnyder, W., Embedding planar graphs on the grid, in: Proc. 1st Annual ACM-SIAM Symp. on Discr. Alg., San Fransisco, 1990, pp. 138–147.
Storer, J.A., On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181–212.
Tamassia, R., On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), pp. 421–444.
Tamassia, R., G. Di Battista and C. Batini, Automatic graph drawing and readability of diagrams, IEEE Trans. on Systems, Man and Cybernetics 18 (1988), pp. 61–79.
Tamassia, R., and I.G. Tollis, Efficient embedding of planar graphs in linear time, Proc. IEEE Int. Symp. on Circuits and Systems, Philadelphia, pp. 495–498, 1987.
Tamassia, R., I.G. Tollis and J.S. Vitter, Lower bounds for planar orthogonal drawings of graphs, Inf. Proc. Letters 39 (1991), pp. 35–40.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kant, G. (1993). Hexagonal grid drawings. In: Mayr, E.W. (eds) Graph-Theoretic Concepts in Computer Science. WG 1992. Lecture Notes in Computer Science, vol 657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56402-0_53
Download citation
DOI: https://doi.org/10.1007/3-540-56402-0_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56402-7
Online ISBN: 978-3-540-47554-5
eBook Packages: Springer Book Archive