Results 1  10
of
13
An open graph visualization system and its applications to software engineering
 SOFTWARE  PRACTICE AND EXPERIENCE
, 2000
"... We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, highquality static and dynamic layout alg ..."
Abstract

Cited by 310 (9 self)
 Add to MetaCart
We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, highquality static and dynamic layout algorithms, and the ability to handle sizable graphs. We conclude with a description of the applications of this package to a variety of software engineering tools.
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 80 (2 self)
 Add to MetaCart
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 ...
Incremental Layout in DynaDAG
 In Proceedings of the 4th Symposium on Graph Drawing (GD
, 1996
"... . Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system. 1 Introduction Effective te ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system. 1 Introduction Effective techniques have been developed for some important families of graph layouts, such as hierarchies, planar embeddings, orthogonal grids and forceddirected (spring) models [1]. These techniques have been incorporated in practical user interfaces that display static diagrams of relationships between objects [19, 18, 17]. Static diagrams are not completely satisfactory because in many situations, the displayed graphs can change. Three common scenarios are: Manual editing. Most interactive graph drawing systems allow users to manually insert and delete nodes and edges. Layouts must be updated dynamically to reflect such changes. Browsing large graphs. When only static layout is available, browsin...
A Multidimensional Approach to ForceDirected Layouts of Large Graphs
, 2000
"... Abstract. We present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or thr ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
Abstract. We present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or three dimensional subspace of E. Projecting highdimensional drawings onto two or three dimensions often results in drawings that are “smoother ” and more symmetric. Among the other notable features of our approach are the utilization of a maximal independent set filtration of the set of vertices of a graph, a fast energy function minimization strategy, efficient memory management, and an intelligent initial placement of vertices. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a midrange PC. 1
A Fast MultiDimensional Algorithm for Drawing Large Graphs
 In Graph Drawing’00 Conference Proceedings
, 2000
"... We present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or three dimensi ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
We present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or three dimensional subspace of E. Projecting highdimensional drawings onto two or three dimensions often results in drawings that are "smoother" and more symmetric. Among the other notable features of our approach are the utilization of a maximal independent set filtration of the set of vertices of a graph, a fast energy function minimization strategy, e#cient memory management, and an intelligent initial placement of vertices. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a midrange PC. 1 Introduction Graphs are common in many applications, from data structures to networks, from software engineering...
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
 Journal of Graph Algorithms and Applications
, 1998
"... We describe a new approach for clusterbased drawing of large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSPtype decomposition, called the balanced aspect ratio (BAR) tree, which guarantees that the cells produced are convex and have bounde ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
We describe a new approach for clusterbased drawing of large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSPtype decomposition, called the balanced aspect ratio (BAR) tree, which guarantees that the cells produced are convex and have bounded aspect ratios. In addition, the tree depth is O(log n), and its construction takes O(n log n) time, where n is the number of points. We show that the BAR tree can be used to recursively divide a graph embedded in the plane into subgraphs of roughly equal size, such that the drawing of each subgraph has a balanced aspect ratio. As a result, we obtain a representation of a graph as a collection of O(log n) layers, where each succeeding layer represents the graph in an increasing level of detail. The overall running time of the algorithm is O(n log n+m+D0(G)), where n and m are the number of vertices and edges of the graph G, andD0(G) is the time it takes to obtain an initial embedding of G in the plane. In particular, if the graph is planar each layer is a graph drawn with straight lines and without crossings on the n×n grid and the running time reduces to O(n log n).
Planaritypreserving clustering and embedding for large planar graphs
 In Graph Drawing (GD'99
, 1999
"... Abstract. In this paper we present a novel approach for clusterbased drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compoundplanarity (cplanarity). Using the clustering, we obtai ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. In this paper we present a novel approach for clusterbased drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compoundplanarity (cplanarity). Using the clustering, we obtain a representation of the graph as a collection of O(log n) layers, where each succeeding layer represents the graph in an increasing level of detail. At the same time, the difference between two graphs on neighboring layers of the hierarchy is small, thus preserving the viewer's mental map. The overall running time of the algorithm is O(n log n), where n is the number of vertices of graph G.
Visualisations of Large ObjectOriented Systems
 In Software Visualization. WorldScientific
, 1995
"... The use of ternary diagrams to represent normalised call graph directions permit the succinct visualisations of objectoriented (OO) systems. Important features of such diagrams include (i) the ability to compare different objectoriented applications; and (ii) the potential ability to make value ju ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The use of ternary diagrams to represent normalised call graph directions permit the succinct visualisations of objectoriented (OO) systems. Important features of such diagrams include (i) the ability to compare different objectoriented applications; and (ii) the potential ability to make value judgments about partially completed systems. Ternary diagrams also permit an overview of very large graphs. For example, we present here a visualisation of five OO applications comprising 1,643 vertices and 194,451 edges. 1 Introduction A call graph is a directed graph whose vertices represent basic data values and whose edges represent how those basic data values are passed to subroutines. An anonymous call graph is a call graph where all the vertices have been changed to anonymous variables (e.g. class0023) and the source of the call graph is not recorded with the graph. Call graphs offer a uniform view for a variety of programming systems. For example, the dependency network within a prop...
Clustered Graphs and Cplanarity
 In 3rd Annual European Symposium on Algorithms (ESA’95), LNCS 979
, 1995
"... In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study Cplanarity of clustered graphs. Given a clustered graph, the Cplanar ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study Cplanarity of clustered graphs. Given a clustered graph, the Cplanarity testing problem is to determine whether the clustered graph can be drawn without edge crossings, or edgeregion crossings. In this paper, we present efficient algorithms for testing Cplanarity and finding Cplanar embeddings of clustered graphs. 1 Introduction Representing information visually, or by drawing graphs can greatly improve the effectiveness of user interfaces in many relational information systems [12, 17, 18, 5]. Developing algorithms for drawing graphs automatically and efficiently has become the interest of research for many computer scientists. Research in this area has been very active for the last decade. A recent survey citelabel13new of literature in this area inclu...
Orthogonal Grid Drawing of Clustered Graphs
, 1996
"... Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical representation, the clustering structure is represented by a simple region that contains the drawing of all the vertices which belong to that cluster. In this paper, we present an algorithm which pro ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical representation, the clustering structure is represented by a simple region that contains the drawing of all the vertices which belong to that cluster. In this paper, we present an algorithm which produces planar drawings of clustered graphs in a convention known as orthogonalgrid rectangular cluster drawings. The drawing produced by the algorithm has constant number of bends on each edge and has O(n 2 ) area, which is as good as existing results for classical graph drawings. 1 Introduction Clustered graphs are graphs with recursive clustering structures over the vertices (see Fig. 1). This type of clustering structure appears in many systems. Examples include CASE tools [19], management information systems [10], and VLSI design tools [8]. For graphical representation, the clustering structure is represented by a simple region that contains the drawing of all the vertices which ...