Search For:

Displaying 1-11 out of 11 total
Edge Compression Techniques for Visualization of Dense Directed Graphs
Found in: IEEE Transactions on Visualization and Computer Graphics
By Tim Dwyer,Nathalie Henry Riche,Kim Marriott,Christopher Mears
Issue Date:December 2013
pp. 2596-2605
We explore the effectiveness of visualizing dense directed graphs by replacing individual edges with edges connected to 'modules'-or groups of nodes-such that the new edges imply aggregate connectivity. We only consider techniques that offer a lossless com...
 
Untangling Euler Diagrams
Found in: IEEE Transactions on Visualization and Computer Graphics
By Nathalie Henry Riche, Tim Dwyer
Issue Date:November 2010
pp. 1090-1099
In many common data analysis scenarios the data elements are logically grouped into sets. Venn and Euler style diagrams are a common visual representation of such set membership where the data elements are represented by labels or glyphs and sets are indic...
 
Exploration of Networks using overview+detail with Constraint-based cooperative layout
Found in: IEEE Transactions on Visualization and Computer Graphics
By Tim Dwyer, Kim Marriott, Falk Schreiber, Peter Stuckey, Michael Woodward, Michael Wybrow
Issue Date:November 2008
pp. 1293-1300
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The user explores the network by changing the focal node in the detailed view or ...
 
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs
Found in: 2014 IEEE Pacific Visualization Symposium (PacificVis)
By Tim Dwyer,Christopher Mears,Kerri Morgan,Todd Niven,Kim Marriott,Mark Wallace
Issue Date:March 2014
pp. 105-112
Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules. An edge connected to the module then impli...
 
A Comparison of User-Generated and Automatic Graph Layouts
Found in: IEEE Transactions on Visualization and Computer Graphics
By Tim Dwyer, Bongshin Lee, Danyel Fisher, Kori Inkpen Quinn, Petra Isenberg, George Robertson, Chris North
Issue Date:November 2009
pp. 961-968
The research presented in this paper compares user-generated and automatic graph layouts. Following the methods suggested by van Ham et al. (2008), a group of users generated graph layouts using both multi-touch interaction on a tabletop display and mouse ...
 
Drawing Directed Graphs Using Quadratic Programming
Found in: IEEE Transactions on Visualization and Computer Graphics
By Tim Dwyer, Yehuda Koren, Kim Marriott
Issue Date:July 2006
pp. 536-548
<p><b>Abstract</b>—We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force-directed placement (FDP) algorithm. The resulting placements highlight h...
 
DIG-COLA: Directed Graph Layout through Constrained Energy Minimization
Found in: Information Visualization, IEEE Symposium on
By Tim Dwyer, Yehuda Koren
Issue Date:October 2005
pp. 9
We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force-directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful prope...
 
WilmaScope Graph Visualisation
Found in: Information Visualization, IEEE Symposium on
By Adel Ahmed, Tim Dwyer, Colin Murray, Le Song, Ying Xin Wu
Issue Date:October 2004
pp. r4
Our visualisation of the IEEE InfoVis citation network is based on 3D graph visualisation techniques. To make effective use of the third dimension we use a layered approach, constraining nodes to lie on parallel planes depending on parameters such as year ...
   
Visualising a Fund Manager Flow Graph with Columns and Worms
Found in: Information Visualisation, International Conference on
By Tim Dwyer, Peter Eades
Issue Date:July 2002
pp. 147
This paper describes a paradigm for visualising time dependant flow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We show two variants of the paradigm, one in which the elements of the gr...
 
Edge Compression Techniques for Visualization of Dense Directed Graphs
Found in: IEEE Transactions on Visualization and Computer Graphics
By Tim Dwyer,Nathalie Henry Riche,Kim Marriott,Christopher Mears
Issue Date:December 2013
pp. 2596-2605
We explore the effectiveness of visualizing dense directed graphs by replacing individual edges with edges connected to 'modules'-or groups of nodes-such that the new edges imply aggregate connectivity. We only consider techniques that offer a lossless com...
 
Scrolling behaviour with single- and multi-column layout
Found in: Proceedings of the 18th international conference on World wide web (WWW '09)
By Cameron Braganza, Kim Marriott, Michael Wybrow, Peter Moulder, Tim Dwyer
Issue Date:April 2009
pp. 66-66
The standard layout model used by web browsers is to lay text out in a vertical scroll using a single column. The horizontal-scroll layout model--in which text is laid out in columns whose height is set to that of the browser window and the viewer scrolls ...
     
 1