Hexagonal grid drawings: algorithms and lower bounds

Authors:
Shabnam Aziza;Therese Biedl
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 8
Cited 3

On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
Relating bends and size in orthogonal graph drawings

Information Processing Letters
Algorithms for area-efficient orthogonal drawings

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
A better heuristic for orthogonal graph drawings

Computational Geometry: Theory and Applications
Three-dimensional orthogonal graph drawing algorithms

Discrete Applied Mathematics
Hexagonal Grid Drawings

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
An Algorithm for Three-Dimensional Orthogonal Graph Drawing

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Optimal three-dimensional orthogonal graph drawing in the general position model

Theoretical Computer Science

Steinitz theorems for orthogonal polyhedra

Proceedings of the twenty-sixth annual symposium on Computational geometry
Drawing ordered (k - 1)-ary trees on k-grids

GD'10 Proceedings of the 18th international conference on Graph drawing
Delta-confluent drawings

GD'05 Proceedings of the 13th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study drawings of graphs of maximum degree six on the hexagonal (triangular) grid, with the main focus of keeping the number of bends small. We give algorithms that achieve 3.5n+3.5 bends for all simple graphs. We also prove optimal lower bounds on the number of bends for K7, and give asymptotic lower bounds for graph classes of varying connectivity.