Results 1 
6 of
6
Using Eye Tracking to Investigate Graph Layout Effects
"... Graphs are typically visualized as nodelink diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has been paid on how to handle crossings when they are an essential part of the final visualizations. This requires us to unde ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Graphs are typically visualized as nodelink diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has been paid on how to handle crossings when they are an essential part of the final visualizations. This requires us to understand how people read graphs and how crossings affect reading performance. As an initial step to this end, a preliminary eye tracking experiment was conducted. The specific purpose of this experiment was to test the effects of crossing angles and geometricpath tendency on eye movements and performance. Sixteen subjects performed both path search and node locating tasks with six drawings. The results showed that small angles can slow down and trigger extra eye movements, causing delays for path search tasks, whereas crossings have little impact on node locating tasks. Geometricpath tendency indicates that a path between two nodes can become harder to follow when many branches of the path go toward the target node. The insights obtained are discussed with a view to further confirmation in future work.
Improving graph drawing readability by incorporating readability metrics: A software tool for network analysts
, 2009
"... Designing graph drawings that effectively communicate the underlying network is challenging as for every network there are many potential unintelligible or even misleading drawings. Automated graph layout algorithms have helped, but frequently generate ineffective drawings. In order to build awarene ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
Designing graph drawings that effectively communicate the underlying network is challenging as for every network there are many potential unintelligible or even misleading drawings. Automated graph layout algorithms have helped, but frequently generate ineffective drawings. In order to build awareness of effective graph drawing strategies, we detail readability metrics on a [0,1] continuous scale for node occlusion, edge crossing, edge crossing angle, and edge tunneling and summarize many more. Additionally, we define new node & edge readability metrics to provide more localized identification of where improvement is needed. These are implemented in SocialAction, a tool for social network analysis, in order to direct users towards poor areas of the drawing and provide realtime readability metric feedback as users manipulate it. These contributions are aimed at heightening the awareness of network analysts that the images they share or publish could be of higher quality, so that readers could extract relevant information.
Notes on Large Angle Crossing Graphs
, 2010
"... A graph G is an α angle crossing (αAC) graph if every pair of crossing edges in G intersect at an angle of at least α. The concept of right angle crossing (RAC) graphs (α = π/2) was recently introduced by Didimo et al. [6]. It was shown that any RAC graph with n vertices has at most 4n −10 edges and ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
A graph G is an α angle crossing (αAC) graph if every pair of crossing edges in G intersect at an angle of at least α. The concept of right angle crossing (RAC) graphs (α = π/2) was recently introduced by Didimo et al. [6]. It was shown that any RAC graph with n vertices has at most 4n −10 edges and that there are infinitely many values of n for which there exists a RAC graph with n vertices and 4n − 10 edges. In this paper, we give upper and lower bounds for the number of edges in αAC graphs for all 0 < α < π/2. 1
The Graph Crossing Number and its Variants: A Survey
"... The crossing number is a popular tool in graph drawing and visualization, but there is not really just one crossing number; there is a large family of crossing number notions of which the crossing number is the best known. We survey the rich variety of crossing number variants that have been introdu ..."
Abstract
 Add to MetaCart
The crossing number is a popular tool in graph drawing and visualization, but there is not really just one crossing number; there is a large family of crossing number notions of which the crossing number is the best known. We survey the rich variety of crossing number variants that have been introduced in the literature for purposes that range from studying the theoretical underpinnings of the crossing number to crossing minimization for visualization problems. 1 So, Which Crossing Number is it? The crossing number, cr(G), of a graph G is the smallest number of crossings required in any drawing of G. Or is it? According to a popular introductory textbook on combinatorics [320, page 40] the crossing number of a graph is “the minimum number of pairs of crossing edges in a depiction of G”. So, which one is it? Is there even a difference? To start with the second question, the easy answer is: yes, obviously there is a difference, the difference between counting all crossings and counting pairs of edges that cross. But maybe these different ways of counting don’t make a difference and always come out
SPECIAL ISSUE FOR CATS 2010 Notes on Large Angle Crossing Graphs
, 2010
"... Abstract: A geometric graph G is an α angle crossing (αAC) graph if every pair of crossing edges in G cross at an angle of at least α. The concept of right angle crossing (RAC) graphs (α = π/2) was recently introduced by Didimo et al. [10]. It was shown that any RAC graph with n vertices has at most ..."
Abstract
 Add to MetaCart
Abstract: A geometric graph G is an α angle crossing (αAC) graph if every pair of crossing edges in G cross at an angle of at least α. The concept of right angle crossing (RAC) graphs (α = π/2) was recently introduced by Didimo et al. [10]. It was shown that any RAC graph with n vertices has at most 4n − 10 edges and that there are infinitely many values of n for which there exists a RAC graph with n vertices and 4n − 10 edges. In this paper, we give upper and lower bounds for the number of edges in αAC graphs for all 0 < α < π/2. 1