1 Graph streams have been studied extensively, such as for data mining, while fairly limitedly for visualizations. Recently, edge bundling promises to diminish visual clutter in large graph visualizations, though mainly focusing on static graphs. This paper presents a new framework, namely StreamEB, for edge bundling of graph streams, which integrates temporal, neighbourhood, data-driven and sp...

In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are based on force-directed or algebraic approaches in terms of running time and drawing quality on a big variety of artificial and real-world graphs. Our experiments indicate that there exist significant differences in dr...

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. The system can handle large graphs, using multi-scale variations of the force-directed methods. Finally, the system can layout and visualize graphs that evolve though time, using static views, animation, and morph...

In this paper, we present a fast layout algorithm using an entirely different approa h to edge routing, based on dire tions of ontrol segments rather than positions of ontrol points. We reveal an interesting theoreti al onne tion with Tutte's bary entri layout method [18℄, and our omputational studies show that this new approa h yields satisfa tory layouts even for huge timetable graphs within ...

Closed or nearly closed regions are an important form of perceptual structure arising both in natural imagery and in many forms of human-created imagery including sketches, line art, graphics, and formal drawings. This paper presents an effective algorithm especially suited for finding perceptually salient, compact closed region structure in hand-drawn sketches and line art. We start with a gra...

Euler diagrams are the only diagrams that intuitively represent containment, intersection and exclusion of data, but none of the current automatic diagram layout techniques produce good layouts in a reasonable time. We adopt a force-directed approach to automatically layout aesthetically pleasing Euler diagrams in a relatively fast time. A Java prototype demonstrates our novel force model.

We present a new layout algorithm for complex networks that combines a multi-scale approach for community detection with a standard forcedirected design. Since community detection is computationally cheap, we can exploit the multi-scale approach to generate network configurations with close-to-minimal energy very fast. As a further asset, we can use the knowledge of the community structure to f...

This paper describes some improvements over the original Space-Optimized Tree technique for the visualization and manipulation of very large hierarchies. The new system uses an improved algorithm to calculate geometrical layouts and it also provides better navigation capability. We introduce our new layout algorithm that can make more consistence of the display than the original layout techniqu...

This publication presents InfoSky, a system enabling exploration of large, hierarchically structured knowledge spaces. InfoSky employs a two-dimensional graphical representation with variable magnification, much like a real-world telescope, to visualise individual documents as stars, hierarchical structures as constellations, and the whole knowledge repository as a galaxy. Force-directed placem...

Graphs provide a visual means for examining relation data and forcedirected methods are often used to lay out graphs for viewing. Making sense of a dynamic graph as it evolves over time is challenging, and previous force-directed methods were designed for static graphs. In this paper, we present an incremental version of a multilevel multi-pole layout method with a refinement scheme incorporate...