The graph-navigability problem concerns how one can find as short paths as possible between a pair of vertices, given an incomplete picture of a graph. We study the navigability of graphs where the vertices are tagged by a number (between 1 and the total number of vertices) in a way to aid navigation. This information is too little to ensure errorfree navigation but enough, as we will show, for...

Web-based collaboration is becoming increasingly common. Often such collaboration exhibits emergent characteristics, for which systems based on a notion of workspaces provide suitable support. Virtual teams collaborating in this manner create virtual organizational structures, the capture and retention of which into organizational memory promises to be of benefit, as it can facilitate reuse. Vi...

EvolutionWorks supports exploratory browsing of the academic paper citation network with an animated and zoom-able visualization that helps researchers explore the conceptual space that emerges from the relationships between academic papers. Metaphorically speaking, a researcher starts out with the seed of an idea that will grow into an unwieldy set of potentially useful papers that the researc...

There a.re certain straightforward algorithms for laying out finite-state ma.chines . This pa.per shows that these algorithms are optimal in the worst case for machines with fixed alphabets. That is, for any s and k, there is a. deterministic finite-state machine with s states and k symbols such that any layout algorithm requires O(kslgs) area. to lay out its realization. Similarly, any layout ...

Visualization technology has been extensive used in various fields which makes the information presented in a visual way. Visualization directly improves the cognitive efficiency of information, greatly reduces the complexity of data understanding, and breaks through the limitation of the traditional statistical analysis method. The automatic placement of nodes and edges in the network graph ha...

Force-directed layouts are typically used for minimizing overlaps in node-link graphs. This can make it easier to interpret and derive meaning from the resulting visualization. Once such a layout is put in motion, however, the person interacting with it has little control over the “final” layout. This paper describes an approach that puts even inexperienced users in charge of force-directed lay...

Procedural textures usually require spending time testing parameters to realize the diversity of appearances. This paper introduces the idea of a procedural texture preview: A single static image summarizing in a limited pixel space the appearances produced by a given procedure. Unlike grids of thumbnails our previews present a continuous image of appearances, analog to a map. The main challeng...

Cascades appear in many applications, including biological graphs and social media analysis. In a cascade, a dynamic attribute propagates through a graph, following its edges. We present the results of a formal user study that tests the effectiveness of different types of cascade visualisations on node-link diagrams for the task of judging cascade spread. Overall, we found that a small multiple...

Example-based modeling is an active line of research within the computer graphics community. With this work we propose a re-targeting scheme for polygonal domains containing a layout composed of discrete elements. Retargeting such domains is typically achieved employing a deformation to the initial domain. The goal of our approach is it to compute a novel layout within the deformed domain re-us...

Both the quality of the results of TEX s formula layout algorithm and the complexity of its description in the TEXbook are hard to beat The algorithm is verbally described as an imperative program with very complex control ow and complicated manipulations of the data structures representing formulae In a forthcoming textbook we describe TEX s formula layout algorithm as a functional program tra...