A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
A multi-dimensional approach to force-directed layouts of large graphs*1
2004
International Journal of Production Economics
Preserved Fulltext
We present a novel hierarchical force-directed 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 higher-dimensional embedding into a two or three dimensional subspace of E. ...
Force-directed methods are the methods of choice for drawing general graphs. ...
doi:10.1016/s0925-7721(04)00046-x
fatcat:msezbx6lxbeo3ot3qvln4iintm
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We present a novel hierarchical force-directed 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 higher-dimensional embedding into a two or three dimensional subspace of E. ...
Force-directed methods are the methods of choice for drawing general graphs. ...
doi:10.1007/3-540-44541-2_20
fatcat:v4zzs27vr5cvpilcl76vupbofe
A multi-dimensional approach to force-directed layouts of large graphs
2004
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We present a novel hierarchical force-directed 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 higher-dimensional embedding into a two or three dimensional subspace of E. ...
Force-directed methods are the methods of choice for drawing general graphs. ...
doi:10.1016/j.comgeo.2004.03.014
fatcat:hxdf4uxinrcelifzutu4gorhse
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
The algorithms are based on a modification of the force-directed algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining ...
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. ...
We then apply the modified force-directed layout algorithm to obtain a drawing for G A . From this drawing we extract the drawings of each individual graph in the series. ...
doi:10.1007/978-3-540-24595-7_41
fatcat:qoa2iqg545a5dcnd74kl4sjn5e
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
2005
Journal of Graph Algorithms and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
The algorithms are based on a modification of the force-directed algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining ...
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. ...
We then apply the modified force-directed layout algorithm to obtain a drawing for G A . From this drawing we extract the drawings of each individual graph in the series. ...
doi:10.7155/jgaa.00104
fatcat:hxmzeftnxrhdvalh63oubqdpmy
GRIP: Graph Drawing with Intelligent Placement
2002
Journal of Graph Algorithms and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. ...
This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. ...
A large class of graph drawing algorithms (including ours) is based on the force-directed placement technique. ...
doi:10.7155/jgaa.00052
fatcat:7yv7glq7k5alpgh3p5daf4milq
GRIP: Graph dRawing with Intelligent Placement
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. ...
This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. ...
A large class of graph drawing algorithms (including ours) is based on the force-directed placement technique. ...
doi:10.1007/3-540-44541-2_21
fatcat:tinv6zavgng6hpswl6v77q3kqm
GRIP: Graph Drawing with Intelligent Placement
[chapter]
2004
Graph Algorithms and Applications 3
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. ...
This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. ...
A large class of graph drawing algorithms (including ours) is based on the force-directed placement technique. ...
doi:10.1142/9789812796608_0011
fatcat:nbof32bl6ngfrnco4rjs6foota
Page 768 of Mathematical Reviews Vol. , Issue 2004b
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Moreover, it is shown how force- directed methods can be applied to visualize clusters.
“Dynamic graph drawing is a very recent and relevant topic. ...
“Handling large graphs is an important problem where some new methods are needed. ...
Spring Embedders and Force Directed Graph Drawing Algorithms
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. ...
In this survey we consider several classical algorithms, starting from Tutte's 1963 barycentric method, and including recent scalable multiscale methods for large and dynamic graphs. ...
Conclusion Force directed algorithms for drawing graphs have a long history and new variants are still introduced every year. ...
arXiv:1201.3011v1
fatcat:ndxz6xgx7fdkthtloaty5en2fq
A Multilevel Algorithm for Force-Directed Graph-Drawing
2003
Journal of Graph Algorithms and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. ...
At each successive change of level, l, the initial layout for G l is taken from its coarser and smaller child graph, G l+1 , and refined using force-directed placement. ...
Acknowledgements The author would like to acknowledge Yehuda Koren for interesting discussions relating to this work and thank the anonymous referees for their helpful comments. ...
doi:10.7155/jgaa.00070
fatcat:67mpauv3qvdntmp2fokhujjqza
A Multilevel Algorithm for Force-Directed Graph-Drawing
[chapter]
2006
Graph Algorithms and Applications 4
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. ...
At each successive change of level, l, the initial layout for G l is taken from its coarser and smaller child graph, G l+1 , and refined using force-directed placement. ...
Acknowledgements The author would like to acknowledge Yehuda Koren for interesting discussions relating to this work and thank the anonymous referees for their helpful comments. ...
doi:10.1142/9789812773296_0012
fatcat:rks33ofjfnebhbslzki25jhpva
A Multilevel Algorithm for Force-Directed Graph Drawing
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. ...
At each successive change of level, l, the initial layout for G l is taken from its coarser and smaller child graph, G l+1 , and refined using force-directed placement. ...
Acknowledgements The author would like to acknowledge Yehuda Koren for interesting discussions relating to this work and thank the anonymous referees for their helpful comments. ...
doi:10.1007/3-540-44541-2_17
fatcat:c2xq66zekzdqzot5ez7ageeq6e
Graphael: A System for Generalized Force-Directed Layouts
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
The system can handle large graphs, using multi-scale variations of the force-directed methods. ...
The graphael system implements several classic force-directed layout methods, as well as several novel layout methods for non-Euclidean geometries, including hyperbolic and spherical. ...
also generalize the multi-scale method for drawing large graphs to non-Euclidean spaces. ...
doi:10.1007/978-3-540-31843-9_47
fatcat:s33ul6x2pfgfbavogx6lbbjtfq
A generic algorithm for layout of biological networks
2009
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our method is based on constrained graph layout and we demonstrate how it can handle the drawing conventions used in biological networks. ...
Also the user cannot usually customize the placement of nodes to tailor the layout to their particular need or task and there is little support for interactive network exploration. ...
The basic approach in constrained graph layout (like force-directed layout) for finding aesthetically pleasing drawings of graphs is to define a cost function F(P) over the positions of the nodes P and ...
doi:10.1186/1471-2105-10-375
pmid:19909528
pmcid:PMC2785797
fatcat:5y63oo745netzkzw4npfwi2f44
« Previous
Showing results 1 — 15 out of 7,067 results