Force-Directed Drawing Algorithms

Force-Directed Drawing Algorithms (2004)

Cached

Download Links

[www.cs.brown.edu]

by Stephen G. Kobourov

Citations:

1 - 0 self

BibTeX

@MISC{Kobourov04force-directeddrawing,
    author = {Stephen G. Kobourov},
    title = { Force-Directed Drawing Algorithms},
    year = {2004}
}

Bookmark

OpenURL

Abstract

Citations

7320	Introduction to Algorithms - CORMEN, LEISERSON, et al. - 1985
2802	Optimization by Simulated Annealing - Kirkpatrick, Gelati, et al. - 1983
444	A Heuristic for Graph Drawing - Eades - 1984
361	An algorithm for drawing general undirected graph - Kamada, Kawai - 1989
342	Graph drawing by force-directed placement - Fruchterman, Reingold - 1991
314	How to draw a graph - Tutte - 1962
299	P: A Focus+Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies. Page 10 of 11 (page number not for citation purposes - Lamping, Rao, et al.
283	Graph Drawing – Algorithms for the Visualization of Graphs - Battista, Eades, et al. - 1999
149	Drawing graphs nicely using simulated annealing - Davidson, Harel - 1996
102	H3: Laying out large directed graphs in 3d hyperbolic space - Munzner - 1997
91	Fundamentals of spherical parameterization for 3d meshes - Gotsman, Gu, et al.
86	A fast adaptive layout algorithm for undirected graphs - Frick, Ludwig, et al. - 1995
69	A multilevel algorithm for force-directed graph drawing - Walshaw - 2002
68	A Fast Multiscale Method for Drawing Large Graphs - Harel, Koren - 2000
62	Visualizing the Structure of the World Wide Web in 3D Hyperbolic Space - Munzner, Burchard - 1995
47	A force directed component placement procedure for printed circuit boards - Quinn, Breuer - 1979
37	Drawing Large Graphs with H3Viewer and Site Manager - Munzner - 1998
31	D.: Drawing graphs to convey proximity: an incremental arrangement method - COHEN - 1997
31	FADE: Graph drawing, clustering, and visual abstraction - QUIGLEY, EADES - 1984
27	Self-organizing maps on non-euclidean spaces - Ritter - 1999
24	A parallel genetic algorithm for network-diagram layout - Kosak, Marks, et al. - 1991
21	A fast multi-dimensional algorithm for drawing large graphs. Computational Geometry: Theory and Applications - Gajer, Goodrich, et al.
19	A genetic algorithm for drawing undirected graphs - Branke, Bucher, et al. - 1997
19	Drawing on physical analogies - BRANDES
18	Drawing stressed planar graphs in three dimensions - Eades, Garvan - 1995
18	A.: A model for smooth viewing and navigation of large 2d information spaces - WIJK, NUIJ - 2004
15	Fast Interactive 3-D Graph Visualization - Bruß, Frick - 1995
12	A Multi-Scale Algorithm for Drawing Graphs Nicely - Hadany, Harel - 2001
11	and Piet Hut. A hierarchical o(n log n) force calculation algorithm. Nature - Barnes - 1986
10	Accel: Automated circuit card etching layout - Fisk, Caskey, et al. - 1971
6	Noneuclidean spring embedders - Kobourov, Wamplery - 2004
5	The Rapid Evolution of Potential Fields in Particle Systems - Greengard - 1988
3	Hyperbolic geometry, Möbius transformations, and geometric optimization - Eppstein - 2003
3	Hyperbolic self-organizing maps for semantic navigation - Ontrup, Ritter - 2001
1	Drawing large graphs woth a potential-field-based multilevel algorithm - Hachul, Jünger