Results 1 - 10
of
167
The Challenge of Information Visualization Evaluation
- In Proc. ACM Advanced Visual Interfaces
, 2004
"... As the field of information visualization matures, the tools and ideas described in our research publications are reaching users. The reports of usability studies and controlled experiments are helpful to understand the potential and limitations of our tools, but we need to consider other evaluation ..."
Abstract
-
Cited by 195 (4 self)
- Add to MetaCart
(Show Context)
As the field of information visualization matures, the tools and ideas described in our research publications are reaching users. The reports of usability studies and controlled experiments are helpful to understand the potential and limitations of our tools, but we need to consider other evaluation approaches that take into account the long exploratory nature of users tasks, the value of potential discoveries or the benefits of overall awareness. We need better metrics and benchmark repositories to compare tools, and we should also seek reports of successful adoption and demonstrated utility. Categories and Subject Descriptors H.5.2 [Information interfaces and presentation] User Interfaces-Evaluation/methodology; Graphical user interfaces (GUI)
Mylar: A degree-of-interest model for IDEs
- In International Conference on AspectOriented Software Design
, 2005
"... Even when working on a well-modularized software system, programmers tend to spend more time navigating the code than working with it. This phenomenon arises because it is impossible to modularize the code for all tasks that occur over the lifetime of a system. We describe the use of a degree-of-int ..."
Abstract
-
Cited by 148 (5 self)
- Add to MetaCart
(Show Context)
Even when working on a well-modularized software system, programmers tend to spend more time navigating the code than working with it. This phenomenon arises because it is impossible to modularize the code for all tasks that occur over the lifetime of a system. We describe the use of a degree-of-interest (DOI) model to capture the task context of program elements scattered across a code base. The Mylar tool that we built encodes the DOI of program elements by monitoring the programmer’s activity, and displays the encoded DOI model in views of Java and AspectJ programs. We also present the results of a preliminary diary study in which professional programmers used Mylar for their daily work on enterprise-scale Java systems.
A review of overview+detail, zooming, and focus+context interfaces
- ACM COMPUT. SURV
, 2008
"... There are many interface schemes that allow users to work at, and move between, focused and contextual views of a data set. We review and categorise these schemes according to the interface mechanisms used to separate and blend views. The four approaches are overview+detail, which uses a spatial sep ..."
Abstract
-
Cited by 85 (1 self)
- Add to MetaCart
There are many interface schemes that allow users to work at, and move between, focused and contextual views of a data set. We review and categorise these schemes according to the interface mechanisms used to separate and blend views. The four approaches are overview+detail, which uses a spatial separation between focused and contextual views; zooming, which uses a temporal separation; focus+context, which minimizes the seam between views by displaying the focus within the context; and cue-based techniques which selectively highlight or suppress items within the information space. Critical features of these categories, and empirical evidence of their success, are discussed. The aim is to provide a succinct summary of the state-of-the-art, to illuminate successful and unsuccessful interface strategies, and to identify potentially fruitful areas for further work.
CARPENDALE S.: Interactive tree comparison for co-located collaborative information visualization
- IEEE Trans. Vis. and Comput. Graphics
"... Abstract—In many domains, increased collaboration has lead to more innovation by fostering the sharing of knowledge, skills, and ideas. Shared analysis of information visualizations does not only lead to increased information processing power, but team members can also share, negotiate, and discuss ..."
Abstract
-
Cited by 53 (18 self)
- Add to MetaCart
(Show Context)
Abstract—In many domains, increased collaboration has lead to more innovation by fostering the sharing of knowledge, skills, and ideas. Shared analysis of information visualizations does not only lead to increased information processing power, but team members can also share, negotiate, and discuss their views and interpretations on a dataset and contribute unique perspectives on a given problem. Designing technologies to support collaboration around information visualizations poses special challenges and relatively few systems have been designed. We focus on supporting small groups collaborating around information visualizations in a co-located setting, using a shared interactive tabletop display. We introduce an analysis of challenges and requirements for the design of colocated collaborative information visualization systems. We then present a new system that facilitates hierarchical data comparison tasks for this type of collaborative work. Our system supports multi-user input, shared and individual views on the hierarchical data visualization, flexible use of representations, and flexible workspace organization to facilitate group work around visualizations. Index Terms—Information visualization, collaboration, co-located work, hierarchical data comparison. 1
DocuBurst: Visualizing Document Content using Language Structure
"... Textual data is at the forefront of information management problems today. One response has been the development of visualizations of text data. These visualizations, commonly based on simple attributes such as relative word frequency, have become increasingly popular tools. We extend this direction ..."
Abstract
-
Cited by 44 (7 self)
- Add to MetaCart
Textual data is at the forefront of information management problems today. One response has been the development of visualizations of text data. These visualizations, commonly based on simple attributes such as relative word frequency, have become increasingly popular tools. We extend this direction, presenting the first visualization of document content which combines word frequency with the human-created structure in lexical databases to create a visualization that also reflects semantic content. DocuBurst is a radial, space-filling layout of hyponymy (the IS-A relation), overlaid with occurrence counts of words in a document of interest to provide visual summaries at varying levels of granularity. Interactive document analysis is supported with geometric and semantic zoom, selectable focus on individual words, and linked access to source text.
Comparison of tree-child phylogenetic networks
- IEEE/ACM Trans. Comput. Biol. Bioinform
, 2009
"... ..."
(Show Context)
Visual comparison of hierarchically organized data
- Comput. Graph. Forum
"... We provide a novel visualization method for the comparison of hierarchically organized data. Our technique visualizes a pair of hierarchies that are to be compared and simultaneously depicts how these hierarchies are related by explicitly visualizing the relations between matching subhierarchies. El ..."
Abstract
-
Cited by 38 (1 self)
- Add to MetaCart
We provide a novel visualization method for the comparison of hierarchically organized data. Our technique visualizes a pair of hierarchies that are to be compared and simultaneously depicts how these hierarchies are related by explicitly visualizing the relations between matching subhierarchies. Elements that are unique to each hierarchy are shown, as well as the way in which hierarchy elements are relocated, split or joined. The relations between hierarchy elements are visualized using Hierarchical Edge Bundles (HEBs). HEBs reduce visual clutter, they visually emphasize the aforementioned splits, joins, and relocations of subhierarchies, and they provide an intuitive way in which users can interact with the relations. The focus throughout this paper is on the comparison of different versions of hierarchically organized software systems, but the technique is applicable to other kinds of hierarchical data as well. Various data sets of actual software systems are used to show how our technique can be employed to easily spot splits, joins, and relocations of elements, how sorting both hierarchies with respect to each other facilitates comparison tasks, and how user interaction is supported. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Viewing Algorithms I.3 1
Simultaneous embedding of planar graphs with few bends
- In 12th Symposium on Graph Drawing (GD
, 2004
"... We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all pairs of planar graphs have simultaneous geometric embedding. However, using bends, pairs of planar graphs can be simultaneously embedded on the O(n 2) × O(n 2) grid, wit ..."
Abstract
-
Cited by 36 (7 self)
- Add to MetaCart
(Show Context)
We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all pairs of planar graphs have simultaneous geometric embedding. However, using bends, pairs of planar graphs can be simultaneously embedded on the O(n 2) × O(n 2) grid, with at most three bends per edge, where n is the number of vertices. The O(n) time algorithm guarantees that two corresponding vertices in the graphs are mapped to the same location in the final drawing and that both the drawings are crossing-free. The special case when both input graphs are trees has several applications, such as contour tree simplification and evolutionary biology. We show that if both the input graphs are are trees, only one bend per edge is required. The O(n) time algorithm guarantees that both drawings are crossings-free, corresponding tree vertices are mapped to the same locations, and all vertices (and bends) are on the O(n 2) × O(n 2) grid (O(n 3) × O(n 3) grid). For the special case when one of the graphs is a tree and the other is a path we can find simultaneous embedding with fixed-edges. That is, we can guarantee that corresponding vertices are mapped to the same locations and that corresponding edges are drawn the same way. We describe an O(n) time algorithm for simultaneous embedding with fixededges for tree-path pairs with at most one bend per tree-edge and no bends along path edges, such that all vertices (and bends) are on the O(n) × O(n 2) grid, (O(n 2) × O(n 3) grid).
Moiregraphs: Radial focus+context visualization and interaction for graphs with visual nodes
- in Proc. IEEE Symposium on Information Visualization, INFOVIS 2003, T. Munzner and
"... Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed for situations where visual information such as images is also present at each node and must be displayed. This paper pre ..."
Abstract
-
Cited by 34 (2 self)
- Add to MetaCart
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed for situations where visual information such as images is also present at each node and must be displayed. This paper presents MoireGraphs to address this need. MoireGraphs combine a new focus+context radial graph layout with a suite of interaction techniques (focus strength changing, radial rotation, level highlighting, secondary foci, animated transitions and node information) to assist in the exploration of graphs with visual nodes. The method is scalable to hundreds of displayed visual nodes.
Visualizing changes of hierarchical data using treemaps
- IEEE TVCG
, 2007
"... Abstract—While the treemap is a popular method for visualizing hierarchical data, it is often difficult for users to track layout and attribute changes when the data evolve over time. When viewing the treemaps side by side or back and forth, there exist several problems that can prevent viewers from ..."
Abstract
-
Cited by 34 (1 self)
- Add to MetaCart
(Show Context)
Abstract—While the treemap is a popular method for visualizing hierarchical data, it is often difficult for users to track layout and attribute changes when the data evolve over time. When viewing the treemaps side by side or back and forth, there exist several problems that can prevent viewers from performing effective comparisons. Those problems include abrupt layout changes, a lack of prominent visual patterns to represent layouts, and a lack of direct contrast to highlight differences. In this paper, we present strategies to visualize changes of hierarchical data using treemaps. A new treemap layout algorithm is presented to reduce abrupt layout changes and produce consistent visual patterns. Techniques are proposed to effectively visualize the difference and contrast between two treemap snapshots in terms of the map items ’ colors, sizes, and positions. Experimental data show that our algorithm can achieve a good balance in maintaining a treemap’s stability, continuity, readability, and average aspect ratio. A software tool is created to compare treemaps and generate the visualizations. User studies show that the users can better understand the changes in the hierarchy and layout, and more quickly notice the color and size differences using our method. Index Terms—Treemap, tree comparison, visualize changes, treemap layout algorithm. 1
