An algorithm for drawing general undirected graphs
Information Processing Letters
Introduction to algorithms
Graph drawing by force-directed placement
Software—Practice & Experience
Highlights: language- and domain-independent automatic indexing terms for abstracting
Journal of the American Society for Information Science
Visualizing Abstract Objects and Relations
Visualizing Abstract Objects and Relations
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Algorithms for Drawing Graphs: An Annotated Bibliography
Algorithms for Drawing Graphs: An Annotated Bibliography
Aspect windows, 3-D visualizations, and indirect comparisons of information retrieval systems
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Managing graph(ical) complexity with raisin and its category explorer
Proceedings of the 2nd international symposium on Smart graphics
The Shape of Shakespeare: Visualizing Text using Implicit Surfaces
INFOVIS '98 Proceedings of the 1998 IEEE Symposium on Information Visualization
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An empirical evaluation of Chernoff faces, star glyphs, and spatial visualizations for binary data
APVis '03 Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24
Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Visual unrolling of network evolution and the analysis of dynamic discourse
Information Visualization
Visualizations of binary data: a comparative evaluation
International Journal of Human-Computer Studies
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Drawing Directed Graphs Using Quadratic Programming
IEEE Transactions on Visualization and Computer Graphics
Measuring and extracting proximity in networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Mapping and visualizing the internet
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Measuring and extracting proximity graphs in networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Data-driven enhancement of facial attractiveness
ACM SIGGRAPH 2008 papers
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Data & Knowledge Engineering
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Eigensolver methods for progressive multidimensional scaling of large data
GD'06 Proceedings of the 14th international conference on Graph drawing
Showing the essential science structure of a scientific domain and its evolution
Information Visualization
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
LoopWeaver --- loop modeling by the weighted scaling of verified proteins
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Drawing Large Graphs by Low-Rank Stress Majorization
Computer Graphics Forum
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
| Hi-index | 0.00 |
Graph drawings are increasingly finding their way into user interfaces to convey a variety of relationships. This article deals with rendering graphs to show proximity between vertices by making their configuration (screen) distances reflect their distances in the graph. An arrangement method is described that achieves good drawings at speeds suitable for user interaction on a desktop computer. The method is “incremental” in that it first arranges a small portion of the graph, then arranges successively larger fractions of the graph until a suitable arrangement for the entirety is achieved. The incremental approach not only offers speed improvements, but avoids many of the suboptimal solutions reached with other iterative approaches. Algorithms are described in pseudocode, and results are presented.