GRID: An Intercative Tool for Computing Orthogonal Drawings with the Minimum Number of Bends

Didimo, Walter and Leonforte, Antonio (1998) GRID: An Intercative Tool for Computing Orthogonal Drawings with the Minimum Number of Bends. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 309-316(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_74).

Full text not available from this repository.

Abstract

In this paper we present a new interactive tool for computing orthogonal grid drawings of planar graphs. The tool is based on GDToolkit, an object-oriented library of classes for handling graphs and computing their layout. GDToolkit is built on LEDA (an efficient library of data types and algorithms) and currently implements three orthogonal layout methods. Especially, we provide a new branch-and-bound algorithm choosing a planar embedding in order to minimize the number of bends. The enumeration schema of the branch-and-bound algorithm is based on the GDToolkit SPQR-tree class (as far as we know, the only existing SPQR-tree implementation). The tool offers an interactive grapical interface to the branch-and-bound algorithm, which allows to edit the embedding, to execute the algorithm step by step and to view partial results. It also gives qualtiy measures on the drawing, and quantitative measures on the algorithm's performance.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-63938-1_74
Classifications: M Methods > M.300 Dynamic / Incremental / Online
M Methods > M.600 Planar
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/132

Actions (login required)

View Item View Item