Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. Angle has been developed as a platform for experimenting with 3D force-directed layout algorithms. The big-bang modification is proposed as a means of obtaining efficiently good 3D layouts for a wide range of graphs. Results are presented ...

Previous algorithms for multidimensional scaling, or MDS, aim for scalable performance as the number of points to lay out increases. However, they either assume that the distance function is cheap to compute, and perform poorly when the distance function is costly, or they leave the precise number of distances to compute as a manual tuning parameter. We present Glint, an MDS algorithm framework...

The wide availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph layout algorithms, able to scale to very large graphs. Nowadays, to process Big Data, companies are increasingly relying on PaaS infrastructures rather than buying and maintaining complex and expensive hardware. So far, only a few examples of basic force-directed algorit...

The automatic layout of metro maps has been investigated quite intensely over the last few years. Previous work has focused on the octilinear drawing style where edges are drawn horizontally, vertically, or diagonally at 45◦. Inspired by manually created curvy metro maps, we advocate the use of the curvilinear drawing style; we draw edges as Bézier curves. Since we forbid metro lines to bend (e...

We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multilevel nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints...

The visualisation pipeline approach is a flexible and extensible technique for generating visualisations. The basic pipeline functions involve the capture and representation of data, the computation of geometry and the presentation of visual output. Data is represented in XML at each stage and is successively transformed, typically by XSLT transformations, as it moves through the pipeline. A fo...

The effectiveness of wireless sensor networks (WSN) depends on the regional coverage provided by node deployment, which is one of the key topics in WSN. Virtual force-based algorithms (VFA) are popular approaches for this problem. In VFA, all nodes are seen as points subject to repulsive and attractive force exerted among them and can move according to the calculated force. In this paper, a sen...

This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topographic graph clustering provides an alternative to more classical solutions i...

Quad layouting, i.e. the partitioning of a surface into a coarse network of quadrilateral patches, is a fundamental step in application scenarios ranging from animation and simulation to reverse engineering and meshing. This process involves determining the layout’s combinatorial structure as well as its geometric embedding in the surface. We present a novel quad layout algorithm that focuses o...

The force-directed graph layout algorithm is one of the most widely used algorithms for drawing graphs. It aims at improving the graphs’ readability and understanding by producing high-quality drawings. However, the traditional algorithm, while trying to find the most stable position for each vertex, fails to produce graphs that satisfy different aesthetic criteria. In this paper, we present an...