Evaluating Cognitive Load: Force-directed Layout vs. Chord Layout

In this section, we give a short overview of modern GPUs, a review of the transitive closure and the all-pairs shortest- path algorithms, and describe a memory layout of the graph

Fig- ure 4 also shows that the larger the number of processors used in the computation, the fewer iterations of the algorithm are required to generate a similar quality of layout..

Our graph-drawing algorithm is essentially a binary graph operation - when applied to a dataset with two associations, we represent the initial association as a graph and the sec-

Both re- sults, that the force-directed layout outperformed the other layouts with respect to correctness and response time, were statistically significant for graphs of size 15 and

Building on literature that compared multiple force-directed layouts and found that the best layout of a network depends on the task to be performed [DLF ∗ 09], we find that

In this work, we propose an intuitive design layout for showing the hierarchical social circles at the outer layer of the inside Chord diagram, where this Chord diagram shows

In an initial exploration, experiment I, seven different candidate algorithms (including a baseline force-directed layout and a baseline simplistic representation plotting

In a nutshell, the rendered interactive treemap layout is that of the nested Power cells, but we control the position and area of the cells with a force-directed approach applied