Grid Layouts of Block Diagrams  Bounding the Number of Bends in Each Connection (Extended Abstract)Even, S. and Granot, G. (1995) Grid Layouts of Block Diagrams  Bounding the Number of Bends in Each Connection (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 6475(Official URL: http://dx.doi.org/10.1007/3540589503_357). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540589503_357
AbstractConsider an input data which specifies rectangular modules and connections between them; this is a graph. The size of the modules and the placements of the terminals on them is given as part of the input. We produce a block diagram, conforming to the input. The block diagram is on the rectilinear grid, and each edge (connection between modules) has few bends. For planar input, a lineartime algorithm is described to construct a planar drawing with at most 6 bends in each selfloop and at most 4 bends in any other edge. The external face of the drawing may be specified by the user. We show a planar input with no selfloops which has no drawing with at most 3 bends in every edge and another planar input which has no drawing with at most 5 bends in every selfloop. A lineartime algorithm is described to construct a nonplanar drawing of any input, with at most 4 bends in each edge. We show inputs that have no drawing with at most 3 bends in every edge.
Actions (login required)
