Results 1  10
of
28
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 39 (7 self)
 Add to MetaCart
(Show Context)
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.
Visual Ranking of Link Structures
 Journal of Graph Algorithms and Applications
, 2003
"... Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e#ective means for search engines to cope with the explosive growth and diversification of the Web. Closely related metho ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
(Show Context)
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e#ective means for search engines to cope with the explosive growth and diversification of the Web. Closely related methods have been used in other disciplines for quite some time.
Connectivity Shapes
 IN IEEE VISUALIZATION 2001 CONFERENCE PROCEEDINGS (2001
, 2001
"... We describe a method to visualize the connectivity graph of a mesh using a natural embedding in 3D space. This uses a 3D shape representation that is based solely on mesh connectivity  the connectivity shape. Given a connectivity, we define its natural geometry as a smooth embedding in space with ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
(Show Context)
We describe a method to visualize the connectivity graph of a mesh using a natural embedding in 3D space. This uses a 3D shape representation that is based solely on mesh connectivity  the connectivity shape. Given a connectivity, we define its natural geometry as a smooth embedding in space with uniform edge lengths and describe efficient techniques to compute it. Our main contribution is to demonstrate that a surprising amount of geometric information is implicit in the connectivity. We also
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 15 (0 self)
 Add to MetaCart
(Show Context)
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
ForceDirected Approaches to Sensor Localization
 in Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX’06
, 2006
"... We consider the centralized, anchorfree sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information about the relative order of each sensor’s neighbors. We experimented with classi ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
We consider the centralized, anchorfree sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information about the relative order of each sensor’s neighbors. We experimented with classic and new forcedirected techniques. The classic techniques work well for small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with noisy data. We describe a new forcedirected technique, based on a multiscale deadreckoning, that scales well for large networks, is resilient under range errors, and can reconstruct complex underlying regions. 1
A MaxentStress Model for Graph Layout
"... In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an in ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
In some applications of graph visualization, input edges have associated target lengths. Dealing with these lengths is a challenge, especially for large graphs. Stress models are often employed in this situation. However, the traditional full stress model is not scalable due to its reliance on an initial allpairs shortest path calculation. A number of fast approximation algorithms have been proposed. While they work well for some graphs, the results are less satisfactory on graphs of intrinsically high dimension, because nodes overlap unnecessarily. We propose a solution, called the maxentstress model, which applies the principle of maximum entropy to cope with the extra degrees of freedom. We describe a forceaugmented stress majorization algorithm that solves the maxentstress model. Numerical results show that the algorithm scales well, and provides acceptable layouts for large, nonrigid graphs. This also has potential applications to scalable algorithms for statistical multidimensional scaling (MDS) with variable distances.
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
, 2006
"... We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical MultiDimensional Scaling yields a quadratictime spectral algorithm, which approximates the real distances of the nodes in the final drawing with their graph theoretical distances. We build from th ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical MultiDimensional Scaling yields a quadratictime spectral algorithm, which approximates the real distances of the nodes in the final drawing with their graph theoretical distances. We build from this idea to develop the lineartime spectral graph drawing algorithm SSDE. We reduce the space and time complexity of the spectral decomposition by approximating the distance matrix with the product of three smaller matrices, which are formed by sampling rows and columns of the distance matrix. The main advantages of our algorithm are that it is very fast and it gives aesthetically pleasing results, when compared to other spectral graph drawing algorithms. The runtime for typical 10 5 node graphs is about one second and for 10 6 node graphs about ten seconds.
Skeletal Animation for the Exploration of Graphs
, 2002
"... The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computergenerated characters for motion pictures and computer games. This thesis investigates the use of similar techniques in the scope of exploring threedimensional visualisations ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computergenerated characters for motion pictures and computer games. This thesis investigates the use of similar techniques in the scope of exploring threedimensional visualisations of relational networks (graphs). A system
Generating node coordinates for shortestpath computations in transportation networks
 ACM Journal on Experimental Algorithmics
"... Speedup techniques that exploit given node coordinates have proven useful for shortestpath computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Speedup techniques that exploit given node coordinates have proven useful for shortestpath computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speedup achieved with coordinates from our drawings is close to that achieved with the true coordinates—and in some special cases even better.