Results 1  10
of
10
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
GRIP: Graph dRawing with Intelligent Placement  Short System Demonstration
"... This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multidimensional forcedirected method together with fast energy function minimization. The system allows for drawing graphs with tens of thousa ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multidimensional forcedirected method together with fast energy function minimization. The system allows for drawing graphs with tens of thousands of vertices in under a minute on a midrage PC. To the best of the authors' knowledge GRIP surpasses the fastest previous algorithms. However, speed is not achieved at the expense of quality as the resulting drawings are quite aesthetically pleasing.
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...
Curvilinar graph drawing using the forcedirected method
 Proc. 12th Int. Symposium on Graph Drawing, 2004, Springer LNCS 3383
"... Abstract. We present a method for modifying a forcedirected graph drawing algorithm into an algorithm for drawing graphs with curved lines. Our method is based on embedding control points as dummy vertices so that edges can be drawn as splines. Our experiments show that our method yields aesthetica ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Abstract. We present a method for modifying a forcedirected graph drawing algorithm into an algorithm for drawing graphs with curved lines. Our method is based on embedding control points as dummy vertices so that edges can be drawn as splines. Our experiments show that our method yields aesthetically pleasing curvilinear drawing with improved angular resolution. Applying our method to the GEM algorithm on the test suite of the “Rome Graphs ” resulted in an average improvement of 46 % in angular resolution and of almost 6 % in edge crossings. 1
Constraints in graph drawing algorithms
 Constraints
, 1998
"... Abstract. Graphs are widely used for information visualization purposes, since they provide a natural and intuitive representation of complex abstract structures. The automatic generation of drawings of graphs has applications a variety of fields such as software engineering, database systems, and g ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. Graphs are widely used for information visualization purposes, since they provide a natural and intuitive representation of complex abstract structures. The automatic generation of drawings of graphs has applications a variety of fields such as software engineering, database systems, and graphical user interfaces. In this paper, we survey algorithmic techniques for graph drawing that support the expression and satisfaction of userdefined constraints. 1.
A Framework for HumanComputer Interaction in Directed Graph Drawing
 In the Proceeding of the Australian Symposium on Information Visualisation
, 2001
"... This paper describes some studies in HumanComputer Interaction for Directed Graph Drawing. We have developed a system where users can help some standard graph drawing algorithms to produce nice drawings of a graph according to a set of aesthetic criteria. The system follows a general framework for ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper describes some studies in HumanComputer Interaction for Directed Graph Drawing. We have developed a system where users can help some standard graph drawing algorithms to produce nice drawings of a graph according to a set of aesthetic criteria. The system follows a general framework for interaction with optimisation processes that can be applied to many optimisation problems. Some discussion about the framework and possible improvements is presented.
Graph drawing techniques for geographic visualization
, 2004
"... Geovisualizers often need to represent data that consists of items related together. Such data sets can be abstracted to a mathematical structure, the graph. A graph contains nodes and edges where the nodes represent the items or concepts of interest, and the edges connect two nodes together accordi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Geovisualizers often need to represent data that consists of items related together. Such data sets can be abstracted to a mathematical structure, the graph. A graph contains nodes and edges where the nodes represent the items or concepts of interest, and the edges connect two nodes together according to some associational scheme. Examples of graph data include: network topologies; maps, where nodes represent
Dynamic Network Visualization 1
"... Increased interest in longitudinal social networks and the recognition that visualization fosters theoretical insight create a need for dynamic network visualizations, or network “movies. ” This article confronts theoretical questions surrounding the temporal representations of social networks and t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Increased interest in longitudinal social networks and the recognition that visualization fosters theoretical insight create a need for dynamic network visualizations, or network “movies. ” This article confronts theoretical questions surrounding the temporal representations of social networks and technical questions about how best to link network change to changes in the graphical representation. The authors divide network movies into (1) static flip books, where node position remains constant but edges cumulate over time, and (2) dynamic movies, where nodes move as a function of changes in relations. Flip books are particularly useful in contexts where relations are sparse. For more connected networks, movies are often more appropriate. Three empirical examples demonstrate the advantages of different movie styles. A new software program for creating network movies is discussed in the appendix.