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

Venue: | Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science |

Citations: | 13 - 7 self |

### BibTeX

@INPROCEEDINGS{Cruz95drawinggraphs,

author = {Isabel F. Cruz and Ashim Garg},

title = {Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract)},

booktitle = {Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science},

year = {1995},

pages = {404--415},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

) Isabel F. Cruz 1 and Ashim Garg 2 1 Department of Electrical Engineering and Computer Science Tufts University Medford, MA 02155, USA 2 Department of Computer Science Brown University Providence, RI 02912--1910, USA 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. 1 Introduction It is common practice to explain the layout of a graph using pictu...

### Citations

1215 |
The Visual Display of Quantitative Information
- Tufte
- 1983
(Show Context)
Citation Context ...raph using pictures that describe the drawing of its different components and the constraints between their relative positions. Pictures have been successfully used to convey quantitative information =-=[28]-=-, in analogy reasoning, e.g., in geometry problems [18], for software visualization [6], and their importance in discrete mathematics has been emphasized [25]. In this paper we explore the use of pict... |

1081 |
Database and Knowledge-Base Systems
- Ullman
- 1988
(Show Context)
Citation Context ...ion arises whether algorithms and constraints expressed by a visual language such as doodle can be efficiently evaluated. The general inference mechanism of rule-based query languages such as Datalog =-=[29]-=- and F-logic [22] is a least-fixed point and bottom-up approach: starting with the database facts, rules are applied until no new facts are generated. In general this approach is inefficient, and much... |

790 | Logical foundations of object-oriented and framebased languages
- Kifer, Lausen, et al.
- 1995
(Show Context)
Citation Context ...r algorithms and constraints expressed by a visual language such as doodle can be efficiently evaluated. The general inference mechanism of rule-based query languages such as Datalog [29] and F-logic =-=[22]-=- is a least-fixed point and bottom-up approach: starting with the database facts, rules are applied until no new facts are generated. In general this approach is inefficient, and much effort has been ... |

525 | A heuristic for graph drawing
- Eades
- 1984
(Show Context)
Citation Context ...er, another possibility consists of providing the user with a tool-box of algorithmic components, which can be combined in a modular fashion. Steps have been taken in this direction by Diagram Server =-=[13, 3]-=-, where algorithmic components are placed in an objectoriented inheritance network with coarse granularity (e.g., the algorithms for drawing trees are represented by a single node). In this model the ... |

345 | Constraint Query Languages
- Kanellakis, Kuper, et al.
- 1995
(Show Context)
Citation Context ...ams express constraints. Work in Datalog with constraints and the study of the timecomplexity of such programs concentrates on the "bigger picture", such as characterizing which programs are=-= in PTIME [20]-=-. Object-oriented work for visual programming such as ThingLab [4] is also concerned with the efficient evaluation of constraints, but does not focus on graphs or other specific display classes. This ... |

237 |
Algorithms for drawing graphs: An annotated bibliography
- Eades, Tamassia
- 1994
(Show Context)
Citation Context ...rithmic approach the layout of the graph is generated according to a prespecified set of general rules or aesthetic criteria (such as planarity or area minimization) that are embodied in an algorithm =-=[12]-=-. The algorithmic approach is computationally efficient but does not naturally support constraints, i.e., requirements that the user may want to impose on the drawing of a specific graph (e.g., cluste... |

205 |
The Programming Language Aspects of ThingLab, A Constraint-Oriented Simulation Laboratory
- Borning
- 1981
(Show Context)
Citation Context ...tudy of the timecomplexity of such programs concentrates on the "bigger picture", such as characterizing which programs are in PTIME [20]. Object-oriented work for visual programming such as=-= ThingLab [4]-=- is also concerned with the efficient evaluation of constraints, but does not focus on graphs or other specific display classes. This paper is organized as follows. In Section 2 we describe the class ... |

94 | C.: Automatic graph drawing and readability of diagrams
- Tamassia, Battista, et al.
- 1988
(Show Context)
Citation Context ...t naturally support constraints, i.e., requirements that the user may want to impose on the drawing of a specific graph (e.g., clustering or aligning a given set of vertices). Work by Tamassia et al. =-=[26]-=- has shown the importance of satisfying constraints in graph drawing systems, and has demonstrated that a limited constraint satisfaction capability can be added to an existing drawing algorithm. ? Re... |

84 | On the computational complexity of upward and rectilinear planarity testing
- GARG, TAMASSIA
- 1995
(Show Context)
Citation Context ...ams is an upward planar embedding of G (an embedding admitting an upward planar drawing) in which the edges of each vertex are separated into two lists of its incoming and outgoing edges respectively =-=[2, 17]-=-. This section is organized as follows. In Section 5.1, we first show how to visually specify, using doodle rules, a topological numbering of a planar stdigraph. In Section 5.2 we give a doodle progra... |

84 |
A unified approach to visibility representations of planar graphs
- Tamassia, Tollis
- 1986
(Show Context)
Citation Context ... that constructs the dual planar st-graph of G in linear time. 5.3 Visibility Representations A visibility representation maps vertices to horizontal line segments and edges to vertical line segments =-=[27]-=-. The doodle program consists of visually specifying each step of the following algorithm given in [27]: 1. Construct a topological numbering l of the vertices of G. Set y(v) to l(v). 2. Construct a d... |

61 |
Algorithms for plane representations of acyclic digraphs
- Battista, Tamassia
- 1988
(Show Context)
Citation Context ... in linear time. Since each upward planar acyclic digraph can be easily transformed into a planar st-digraph (i.e., a planar acyclic digraph with exactly one source and one sink) by adding some edges =-=[21, 14]-=-, we limit our discussion to planar st-digraphs. Let G be a planar st-digraph. We assume that the input to our doodle programs is an upward planar embedding of G (an embedding admitting an upward plan... |

57 |
DOODLE: A Visual Language for Object-Oriented Databases
- Cruz
- 1992
(Show Context)
Citation Context ...grams for drawing graphs, in this paper we show how to write visual programs for constructing planar drawings of trees, series-parallel digraphs, and acyclic digraphs using the visual language doodle =-=[8, 9, 10]-=-. The drawings that we consider are: upward planar drawings of trees, \Delta-drawings of series-parallel digraphs, and visibility and planar upward polyline drawings of planar acyclic digraphs. We als... |

44 |
Area requirement and symmetry display of planar upward drawings
- Battista, Tamassia, et al.
- 1992
(Show Context)
Citation Context ...G in linear time. 5.4 Upward Planar Polyline Drawings The doodle program to construct an upward planar polyline drawing of a planar st-graph G is based on the dominance drawing algorithm presented in =-=[15]-=-. Theorem10. Given an upward planar embedding of a planar st-graph G, there exists a doodle program that constructs a planar upward polyline drawing of G in linear time. 6 Conclusions and Future Work ... |

21 |
Fundamentals of planar ordered sets
- Kelly
- 1987
(Show Context)
Citation Context ... in linear time. Since each upward planar acyclic digraph can be easily transformed into a planar st-digraph (i.e., a planar acyclic digraph with exactly one source and one sink) by adding some edges =-=[21, 14]-=-, we limit our discussion to planar st-digraphs. Let G be a planar st-digraph. We assume that the input to our doodle programs is an upward planar embedding of G (an embedding admitting an upward plan... |

17 |
How to draw a series-parallel digraph
- Bertolazzi, Cohen, et al.
- 1994
(Show Context)
Citation Context ...odle program that constructs a planar upward straight-line drawing of T in O(n) time. 4 Series-Parallel Digraphs A series-parallel digraph G with a source and a sink is recursively defined as follows =-=[1]-=-: it is either a single directed edge, or a series composition, or a parallel composition of two series-parallel directed graphs G 1 and G 2 . G 1 and G 2 are called the series-parallel components of ... |

15 |
Visualizing Abstract Objects and Relations -- A Constraint-Based Approach. World Scientific
- Kamada
- 1989
(Show Context)
Citation Context ...ic classes of graphs and drawings, but are difficult to extend. Other constraint-based approaches allow declarative specification of the layout and decouple this specification from the drawing engine =-=[19, 24]-=-, therefore requiring less expertise from the end-user than previously described techniques. However, they use general constraint solvers, which are inefficient, and constraints are textually specifie... |

14 | Expressing constraints for data display specification: A visual approach
- Cruz
- 1995
(Show Context)
Citation Context ...grams for drawing graphs, in this paper we show how to write visual programs for constructing planar drawings of trees, series-parallel digraphs, and acyclic digraphs using the visual language doodle =-=[8, 9, 10]-=-. The drawings that we consider are: upward planar drawings of trees, \Delta-drawings of series-parallel digraphs, and visibility and planar upward polyline drawings of planar acyclic digraphs. We als... |

14 |
The architecture of diagram server
- Battista, Giammarco, et al.
- 1990
(Show Context)
Citation Context ...er, another possibility consists of providing the user with a tool-box of algorithmic components, which can be combined in a modular fashion. Steps have been taken in this direction by Diagram Server =-=[13, 3]-=-, where algorithmic components are placed in an objectoriented inheritance network with coarse granularity (e.g., the algorithms for drawing trees are represented by a single node). In this model the ... |

12 |
On upward drawing testing of triconnected digraphs
- Bertolazzi, Battista
- 1991
(Show Context)
Citation Context ...ams is an upward planar embedding of G (an embedding admitting an upward planar drawing) in which the edges of each vertex are separated into two lists of its incoming and outgoing edges respectively =-=[2, 17]-=-. This section is organized as follows. In Section 5.1, we first show how to visually specify, using doodle rules, a topological numbering of a planar stdigraph. In Section 5.2 we give a doodle progra... |

9 |
Layout Graph Grammars: The Placement Approach
- Brandenburg
(Show Context)
Citation Context ...on [24]. Even for small graphs, the enumeration of the constraints can be long and difficult to understand. Layout graph-grammars can however draw trees and series-parallel digraphs in quadratic time =-=[5]-=-. To avoid leaving the evaluation to a constraint solver, another possibility consists of providing the user with a tool-box of algorithmic components, which can be combined in a modular fashion. Step... |

9 | User-Defined Visual Query Languages
- Cruz
- 1994
(Show Context)
Citation Context ...grams for drawing graphs, in this paper we show how to write visual programs for constructing planar drawings of trees, series-parallel digraphs, and acyclic digraphs using the visual language doodle =-=[8, 9, 10]-=-. The drawings that we consider are: upward planar drawings of trees, \Delta-drawings of series-parallel digraphs, and visibility and planar upward polyline drawings of planar acyclic digraphs. We als... |

6 |
A visual approach to graph drawing
- Cruz, Tamassia, et al.
- 1993
(Show Context)
Citation Context ...etwork with coarse granularity (e.g., the algorithms for drawing trees are represented by a single node). In this model the execution of an algorithm corresponds to a path in the network. Cruz et al. =-=[11]-=-, propose the combination of a declarative specification of graph layout with the tool-box approach of Diagram Server. The particular approach resides on the existence of a visual language and of a co... |

5 |
Algorithmic and declarative approaches to aesthetic layout
- Eades, Lin
- 1993
(Show Context)
Citation Context ...by the National Science Foundation, by the U.S. Army Research Office, and by the Advanced Research Projects Agency. Email addresses of the authors: isabel@cs.tufts.edu, ag@cs.brown.edu. Eades and Lin =-=[16, 23]-=- present a system where constraints are incorporated into tree drawing algorithms and the user can fine tune the layout by giving input parameters. In both approaches each algorithm has to be individu... |

5 |
Conceptual Entities.” Mental Models
- Greeno
- 1983
(Show Context)
Citation Context ...fferent components and the constraints between their relative positions. Pictures have been successfully used to convey quantitative information [28], in analogy reasoning, e.g., in geometry problems =-=[18]-=-, for software visualization [6], and their importance in discrete mathematics has been emphasized [25]. In this paper we explore the use of pictures for expressing and computing the layout of graphs,... |

3 |
A formal specification for network diagrams that facilitates automated design
- Marks
- 1991
(Show Context)
Citation Context ...ic classes of graphs and drawings, but are difficult to extend. Other constraint-based approaches allow declarative specification of the layout and decouple this specification from the drawing engine =-=[19, 24]-=-, therefore requiring less expertise from the end-user than previously described techniques. However, they use general constraint solvers, which are inefficient, and constraints are textually specifie... |

1 |
A General Schema for Diagrammatic User Interfaces
- Lin
- 1993
(Show Context)
Citation Context ...by the National Science Foundation, by the U.S. Army Research Office, and by the Advanced Research Projects Agency. Email addresses of the authors: isabel@cs.tufts.edu, ag@cs.brown.edu. Eades and Lin =-=[16, 23]-=- present a system where constraints are incorporated into tree drawing algorithms and the user can fine tune the layout by giving input parameters. In both approaches each algorithm has to be individu... |