New Lower Bounds for Orthogonal Graph Drawings

Biedl, Therese (1996) New Lower Bounds for Orthogonal Graph Drawings. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 28-39(Official URL: http://dx.doi.org/10.1007/BFb0021788).

Full text not available from this repository.

Abstract

An orthogonal drawing is an embedding of a graph such that edges are drawn as sequences of horizontal and vertical segments. In this paper we explore lower bounds. We find lower bounds on the number of bends when crossings are allowed, and lower bounds on both the grid-size and the number of bends for planar and plane drawings.

Item Type: Conference Paper
Additional Information: 10.1007/BFb0021788
Classifications: M Methods > M.600 Planar
G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/45

Actions (login required)

View Item View Item