Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract)

Cruz, Isabel F. and Garg, Ashim (1995) Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 404-415(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_394).

Full text not available from this repository.

Abstract

Constraint-based graph drawing systems provide expressive power and flexibility. Previously proposed approaches make use of general constraint solvers, which are inefficient, and of textual specification of constraints, which can be long and difficult to understand. In this paper we propose the use of a constraint-based visual language for constructing planar drawings of trees, series-parallel graphs, and acyclic digraphs in linear time. A graph drawing system based on our approach can therefore provide the power of constraint-based graph drawing, the simplicity of visual specifications, and the computational efficiency that is typical of the algorithmic-based approaches.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-58950-3_394
Classifications: S Software and Systems > S.001 General
M Methods > M.900 Tree
M Methods > M.500 Layered
G Algorithms and Complexity > G.630 Labeling
URI: http://gdea.informatik.uni-koeln.de/id/eprint/240

Actions (login required)

View Item View Item