An interactive, interdisciplinary, on-line graphics system for presenting and manipulating directed graphs (original) (raw)

A graph-theoretic language extension for an interactive computer graphics environment

Computers & Graphics, 1980

A programming language extension, AGILE, for the processing of graphs within an interactive computer graphics environment, is defined. The language is intended to be used for expressing and illustrating graph-theoretic algorithms and applications. However it does not deal with the actual drawing or display of graphs; rather one is able to access an existing general-purpose graphics package. The language then is intended to be used, in conjunction with a graphics package, as a tool for the production of more specialised graphics systems: the language allows one to naturally exploit the underlying graph structure found in a wide class of problems, while a graphics environment permits the elegant display of (and interaction with) such representations.

Design of a Graph Drawing and Visualization System

2002

The visualization of complex conceptual structures is a key component of support tools for many applications in science and engineering. A graph is an abstract data structure that is used to model information. Hence, many information visualization systems require graphs to be drawn so that they are easy to read and understand. Also many practical applications like VLSI design need the drawing of a graph in some specific way. In this paper, we address the problem of drawing and visualization of graphs using various algorithms by presenting an integrated software environment for both the design and the visualization of graphs.

A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering, 1993

We describe a four-pass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce crossings. The third pass finds optimal coordinates for nodes by constructing and ranking an auxiliary graph. The fourth pass makes splines to draw edges. The algorithm makes good drawings and runs fast.

Experiments and a User Study for Hierarchical Drawings of Graphs

2022

We present experimental results and a user study for hierarchical drawings of graphs. A detailed hierarchical graph drawing technique that is based on the Path Based Framework (PBF) is presented. Extensive edge bundling is applied to draw all edges of the graph and the height of the drawing is minimized using compaction. The drawings produced by this framework are compared to drawings produced by the well known Sugiyama framework in terms of area, number of bends, number of crossings, and execution time. The new algorithm runs very fast and produces drawings that are readable and efficient. Since there are advantages (and disadvantages) to both frameworks, we performed a user study and the results show that the drawings produced by the new framework are well received in terms of clarity, readability, and usability. Hence, the new technique offers an interesting alternative to drawing hierarchical graphs, and is especially useful in applications where user defined paths are important and need to be highlighted.

Drawing, Manipulating, and Recognizing Graphs

In this paper, we describe di erent methods for three dimensional embedding of graphs, as well as a two dimensional layout method, namely barycentric embedding. In addition, we present a program for automatic recognition of graphs. We nally describe servers for graph drawing routines that can be called from C or C++ programs and applications such as Mosaic.

Issues in the Non-Visual Presentation of Graph Based Diagrams

2004

One aspect of non-visual visualisation is providing accessibility to diagrams for users with visual impairments. In this paper we review the literature on diagrams and nonvisual presentation in order to elucidate the issues involved in making graph based diagrams accessible using speech and non-speech sound. First we examine the nature, scope and uses of these diagrams. We then describe the nature of diagrams: how do diagrams differ from other representations; how do sighted readers read, understand, and extract information from diagrams; what cognitive processes do diagrams facilitate; and what factors affect how diagrams may be understood? After a comparison of visual with aural presentation we discuss the work presented by others in this field, particularly looking at their reasons for implementing how they do in light of our examination of visual comprehension. The paper concludes with a discussion of how these issues combine and conflict to influence requirements for interface design.

Improvements to GraphPack: A System to Manipulate Graphs and Digraphs

1992

This paper describes the improvements that we have carried out on GraphPack, the system that we have developed here. These improvements are speciically four fold. We have incorporated GraphPack to communicate with other systems; speciically, Mathematica, Maple, Matlab and SetPlayer. Further, we have incorporated commands to perform graph algorithms on MasPar,a SIMD machine. A lot of display routines are added for diierent embeddings of graphs. We also incorporated a 3D display of graphs, including rotation and swapping of vertices to get a better embedding. Finally, the language LiLa and the interpreter has been enhanced so as to write application programs easier.

Graphical programming and educational technologies

Technology, 2011

The quick evolution in the fields of knowledge, technology and communication has determined us to think more and more often about a strong reform of the “teaching systems”. It is taken into considering the usage of the information technologies in education and their correlation ...

Drawing and marking graph diagrams

2009

The marking of graph diagrams (that is to say diagrams that are composed of nodes, possibly joined by edges) is tedious if the diagrams are presented on paper. If the key content of the diagrams is available in electronic form then the marking can be much more efficient. This is achieved because the tutor only has to mark each different diagram element once and this mark is transmitted to all diagrams that contain the element. This benefit to the tutor is obtained by requiring the students to use a diagram drawing program of some kind. However using such an editor can simplify the process for the students by allowing them to concentrate more on the problem and less on its graphical representation. The students can also be rewarded for going to this extra effort by receiving a much more detailed, personalised commentary on their work than would have been possible before, given the same amount of tutor time. We present the evolution of a dragand-drop diagram editor specialised for the area of ER diagrams and an associated marking system with a simple but effective feedback mechanism. Some results from initial trials are presented along with some ideas for improvement and extension.

An Interactive Multi-user System for Simultaneous Graph Drawing

Lecture Notes in Computer Science, 2005

In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuristic algorithm and with human assistance. Our implementation uses the DiamondTouch table, a multiuser, touch-sensitive input device, to take advantage of direct physical interaction of several users working collaboratively. The system can be downloaded at http://dt.cs.arizona.edu where it is also available as an applet.