New Lower Bounds For Orthogonal Drawings

11 years 5 months ago
New Lower Bounds For Orthogonal Drawings
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. Communicated by D. Wagner: submitted July 1997; revised November 1998. Some results of this paper were part of the author’s diploma thesis at TU Berlin under rvision of Prof. R. M¨ohring, and have been presented in an extended abstract at Graph Drawing ’95, Passau, Germany.
Therese C. Biedl
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where JGAA
Authors Therese C. Biedl
Comments (0)