Results 1 
4 of
4
Multilevel Visualization of Clustered Graphs
, 1997
"... Clustered graphs are graphs with recursive clustering structures over the vertices. This type of structure appears in many systems. Examples include CASE tools, management information systems, VLSI design tools, and reverse engineering systems. Existing layout algorithms represent the clustering str ..."
Abstract

Cited by 87 (2 self)
 Add to MetaCart
(Show Context)
Clustered graphs are graphs with recursive clustering structures over the vertices. This type of structure appears in many systems. Examples include CASE tools, management information systems, VLSI design tools, and reverse engineering systems. Existing layout algorithms represent the clustering structure as recursively nested regions in the plane. However, as the structure becomes more and more complex, two dimensional plane representations tend to be insufficient. In this paper, firstly, we describe some two dimensional plane drawing algorithms for clustered graphs; then we show how to extend two dimensional plane drawings to three dimensional multilevel drawings. We consider two conventions: straightline convex drawings and orthogonal rectangular drawings; and we show some examples. 1 Introduction Graph drawing algorithms are widely used in graphical user interfaces of software systems. As the amount of information that we want to visualize becomes larger, we need more structure ...
AGDLibrary: A Library of Algorithms for Graph Drawing
, 1997
"... A graph drawing algorithm produces a layout of a graph in two or threedimensional space that should be readable and easy to understand. Since the aesthetic criteria differ from one application area to another, it is unlikely that a definition of the "optimal drawing" of a graph in a s ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
A graph drawing algorithm produces a layout of a graph in two or threedimensional space that should be readable and easy to understand. Since the aesthetic criteria differ from one application area to another, it is unlikely that a definition of the "optimal drawing" of a graph in a strict mathematical sense exists. A large number of graph drawing algorithms taking different aesthetic criteria into account have already been proposed. In this paper we describe the design and implementation of the AGDLibrary, a library of Algorithms for Graph Drawing. The library offers a broad range of existing algorithms for twodimensional graph drawing and tools for implementing new algorithms. The library is written in C++ using the LEDA platform for combinatorial and geometric computing ([16, 17]). The algorithms are implemented independently of the underlying visualization or graphics system by using a generic layout interface. Most graph drawing algorithms place a set of restriction...
A Graph Model which Supports Flexible Layout Functions
, 1996
"... Graphs are commonly used to model relations in computer systems. Nodes are used to represent entities in an application, and edges represent relationships between entities. Many graph based applications need to provide user interfaces for the user to create and edit graphs depicted as diagrams. The ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Graphs are commonly used to model relations in computer systems. Nodes are used to represent entities in an application, and edges represent relationships between entities. Many graph based applications need to provide user interfaces for the user to create and edit graphs depicted as diagrams. The underlying graph model should be powerful enough to represent a wide range of applications yet simple enough to enable good layout. In this paper we propose a new model: cigraphs. In a cigraph, each node may consist of a (sub)cigraph. Layout functions are assigned to nodes (that is, to subcigraphs) in an objectoriented fashion; this allows considerable user control of layout. Keywords: graph, graph drawing, formalism, cigraph, user interface. 1 Introduction Diagrams of graphs have been widely used in humancomputer interaction. A graph is a set of nodes and edges. Graphs are commonly used to model relations in computer systems. Nodes are used to represent entities in an application, and...
The Graphlet System (System Demonstration)
 In Proc. of Graph Drawing ’96
, 1997
"... . Graphlet is a portable, object oriented toolkit for graph editors and graph drawing algorithms, and is the successor of the GraphEd system. Graphlet is based on LEDA and Tcl/Tk. Algorithms can be implemented in C++ and LedaScript, a new scripting language based on Tcl/Tk. The GML format is a porta ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
. Graphlet is a portable, object oriented toolkit for graph editors and graph drawing algorithms, and is the successor of the GraphEd system. Graphlet is based on LEDA and Tcl/Tk. Algorithms can be implemented in C++ and LedaScript, a new scripting language based on Tcl/Tk. The GML format is a portable file format for graphs. The implementation and visualization of graph algorithms is an important area in research and applications. There is a growing number of systems to support this process. LEDA [8] and GraphBase [7] concentrate on the implementation of a library of graph algorithms. Systems like daVinci [4], DynaDAG [11], DABDUCTOR [14] and EDGE [10] concentrate on graph visualization and/or graph editing, while CABRI [3], GDWorkbench [2], GraphEd [6], the Graph Editor Toolkit [9] or VCG [13] combine an editor and a library of algorithms. The scope of these systems ranges from small and onpurpose systems to large, complex ones. However, the user interfaces of many systems are not...