New Lower Bounds For Orthogonal Drawings
Thérèse Biedl · Journal of Graph Algorithms and Applications · 1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for orthogonal graph drawings. We prove lower bounds on the number of bends and, when crossings are not allowed, also lower bounds on the size of the grid.