We created an improved layout algorithm for automatically generating visual video summaries reminiscent of comic book pages. The summaries are comprised of images from the video that are sized according to their importance. The algorithm performs a global optimization with respect to a layout cost function that encompasses features such as the number of resized images and the amount of whitespa...

In the metro-line crossing minimization problem, we are given a plane graph G = (V,E) and a set L of simple paths (or lines) that cover G, that is, every edge e ∈ E belongs to at least one path in L. The problem is to draw all paths in L along the edges of G such that the number of crossings between paths is minimized. This crossing minimization problem arises, for example, when drawing metro m...

This paper is focused on the visualization of dynamic social networks, i.e. graphs whose edges model social relationships which evolve during time. In order to overcome the problem of discontinuities of the graphical representations computed by discrete methods, the proposed approach is a continuous one which updates the changes as soon as they happen in the visual restitution. The vast majorit...

We investigate the readability of node-link diagrams for directed graphs when using partially drawn links instead of showing each link explicitly in its full length. Providing the complete link information between related nodes in a graph can lead to visual clutter caused by many edge crossings. To reduce visual clutter, we draw only partial links. Then, the question arises if such diagrams are...

Visualization of interactive narrative structures remains a difficult problem: while authoring systems have developed robust ways to visually communicate narrative structures, comparatively little work has been done towards visualizing the output of playthroughs, namely story metrics and redundant content paths. This paper explores an interactive visualization that quickly helps authors spot re...

This paper describes an efficient global cell (module) placement strategy called HALO (Hierarchical Alternating Linear Ordering) which generates a global 2-D placement of circuit modules by hierarchical application of linear ordering in alternating direction. It is explained why HALO should perform better than other typical, somewhat successful, analytical approaches such as min-cut, force-dire...

This paper presents a novel real-time algorithm to integrate internal and external labels of arbitrary size into 3D visualizations. Moreover, comprehensive dynamic content can be displayed in annotation boxes. Our system employs multiple metrics in order to achieve an effective and aesthetic label layout with adjustable weights. The layout algorithm employs several heuristics to reduce the sear...

While the quality of the results of T E X's mathematical formula layout algorithm is convincing, its original description is hard to understand since it is presented as an imperative program with complex control ow and destructive manipulations of the data structures representing formulae. In this paper, we present a re-implementation of T E X's formula layout algorithm in the functional langua...

We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the graph based on the electric spring model that is force-directed approach. We evaluate the performance of this method through experiments. Then we apply the proposed method to the area of Web Ontology Language.

As human knowledge increases, so the volume of electronically available information grows. Finding specific information becomes more difficult and ever more matches are returned in response to a search query. Since quantity is seldom quality, numerous approaches to make sense of search result sets have been proposed. This thesis describes an approach called SearchVis to visualise search result ...