<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>E ective User Interactions for Visual Analytics Tools</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vladimir Guchev</string-name>
          <email>guchev@di.unito.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science Department, University of Turin Tutor: prof. Cristina Gena</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the last few decades, there has formed a layer of traditions in the information processing from di erent elds of science and technology, which includes a variety of standards, techniques and approaches for visual analysis of diverse types and structures of data. Every year, the advanced technologies of human-computer interaction and computer graphics are becoming closer to information-based areas of activity, providing exible and adaptive solutions in the implementation of user interfaces for information management and decision-making systems that involving the human-analyst. Taking into account the fact that the resulting quality of activity in various areas of high-tech depends on the ability of studying and mastering of complexly structured storages of multidimensional data, the issue of developing e ective user interactions for visual analytics tools is becoming increasingly important. This paper pays attention to the problems and possible solutions of e ective visual representation and management of static and dynamic graph-based datasets. Particular attention given to ergonomic approaches of data visualization and concepts of its gesture-based handling and control.</p>
      </abstract>
      <kwd-group>
        <kwd>human-centered computing</kwd>
        <kwd>user interface design</kwd>
        <kwd>data visualization</kwd>
        <kwd>node-link diagram</kwd>
        <kwd>graph exploration</kwd>
        <kwd>pen-centric and sketchbased interaction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Among the wide variety of books and publications, focused on the intersection
of CHI and Data Visualization, there is a bias in applied areas, while more
fundamental things as the design and ergonomics of the both of interaction
patterns and visual symbolic systems are leaving without due attention. Even
the developers of specialised software for data analytics, who should be well
acquainted with the capabilities of advanced input devices (e.g. touch screens or
surface stylus pens), still remain using interactions that are more typical for the
WIMP (windows-icons-mouse-pointer) concept with its limitations. So far, the
most of visual analytics tools are inside the button paradigm: that is the user
actions are typically launched by the pressing a real or virtual but still button,
sometimes even with a stylus or a touch surface.</p>
      <p>For a human, well familiar with the culture of writing, the poking of points as
the base way of user interactions does not seem to be natural. Having advanced
input devices and computing systems, which are enough to enable the adaptive
and reactive gesture recognition, now is the good time for the reasonable
amplication of low-level interactions in order to reduce the number of micro-gestures
(e.g. click sequences) at least for visual data analytics software, based on
pencentric input systems. As a good practical example of e ective application of
sketch-based interactions, it is worth considering the user interfaces for graph
exploration and editing. Due to the large number of demanded functions for
application to the graph elements, layouts and views, the implementation of user
strokes tracing and recognition in the context of an active interaction mode may
be an e ective solution. The e ectiveness of the mentioned above application
example may also depend on the readability of the graph. The topic of visual graph
or hyper-graph representation is quite complex and requires special study.
However, among the approaches to partially ordered graph visualization, it is worth
noting the circular layout that has strengths in the both of the convenient form
for visual human perception and the exibility in arrangement methods.</p>
      <p>This paper is organized as follows. The \Related Work" section gives a brief
review of graph-based data visualization and manipulation techniques. The
\Towards Reactive Interacting" section overviews the approaches to the building of
gestures design space and the realisation of reactive interactions. The \Towards
Flexible Visualizing" section is reviewing the visualization techniques by means
of node-link-group diagrams.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        One of the most demanded concepts for visual analytics tools that has a rich
theoretical foundation, which allowing to study multidimensional datasets with
complex structures, is the interactive graph exploration. The signi cance and
ubiquity of interactive graph exploration are beyond any doubt: it gives wide
opportunities for extensive analysing of relationships and dependencies along
with patterns and exceptions in complex data such as biological, transport or
nancial datasets, etc. Among the variety of combinations and hybrids of
visualization methods, node-link diagrams on the force-layout basis remain demanded
for exible representation of network data like collaborative, social or
communication networks. However, the readability and manageability of this type of
diagrams are an open problem: typical solutions (such as geometric
compression, semantic abstraction, topologic simpli cation, etc.) provide to the analyst
albeit complete, but xed and arduous result [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The sensemaking of
graphformatted data involves a wide range of tools for interactive and adaptive
exploration. E ciency and clarity of such approaches for visual analysis depend on
the compliance between particular tasks and chosen modalities of interactivity
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Fully automated algorithms for graph layout cannot provide a
complete solution for e ective visualization. Several techniques have been proposed
for interacting with graphs, in particular, through customized layouts by
adjusting of nodes with interactive lenses and sticks, via magnet-based attraction and
radial menus [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. By ordering the chaos of the initial layout, the analyst
gains insights into the instant graph changes [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>
        E orts on post-layout enhancement of graph visualization are usually
associated with clusterization and multi-view representation [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Few menu-based
techniques, providing some ways of interaction that typical for graphic editors
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], may be considered as complicated to use. Studying of graph data through
free manipulation of nodes, speci cally by partial geometrization of arrangement
while preserving the context of nodes in a graph topology, requires the ability
of quick direct control of elements: that is achievable through the sketch-based
techniques [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>
        Focusing on the visual part, it is worth noticing a large number of
visualization techniques in the literature that represent graphs using node-link diagrams
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. Among the rich variety of graph drawing techniques, it would be
worth to make a choice of the circular layout as one of the easiest for
understanding and implementation. There are many examples of using the circular
and radial layouts for analysis of various datasets. Depending on the scope of
application, the circular and radial visualizations may be focused on di erent
formats and structures of exploring data, thus have great variety in approaches
to the graphical design. Burch et al. present the techniques and metaphors based
on a radial node-link approach for encoding of time-series relational data [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], as
well as for scalable dynamic graphical visualization [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Besides the discussion
of bene ts and drawbacks of the radial visualization, the work also reveal the
static and dynamic aspects in node-link representations. The research of Velhow
et al. [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] proposes the approach to the exploration of time-varying relational
data, presented by large dynamic graphs, where the edges are de ned by the
polar coordinates instead of Cartesian coordinates. The approach incorporates
several interaction techniques to explore dynamic patterns, such as trends and
counter-trends. The research of Holten [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] focuses on datasets, containing
hierarchical components, presents solutions for visualizing compound graphs based
on bundling of adjacency edges. The results of user studies, where
hierarchical edge bundles applied for a few available layouts (such as balloon, rooted
tree, squari ed treemap), show that the radial layout is the most preferable and
aesthetically pleasing.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Towards Reactive Interacting</title>
      <p>Techniques and tools for visual analytics are often represented by a complex and
diverse set of using actions. Typically, each action performed by an elongate
combination of separate short-term manipulations with branching menus, multiple
sliders and numerous buttons. Although, in some cases, it is more convenient to
expand the set of manipulations through use of natural for humans stroking and
touching sequences. Within context-aware applications, the access to available
actions by sketching and drawing gestures could be obvious and convenient.
Interactive data visualization that supplemented with tracing and recognition
of pen-centric sketching, drawing and tapping, which are technically available
from any pointing device, opens new opportunities for layout control during
exploratory data analysis. The current section presents an approach to gestures
processing, comprising a controller that classi es advanced pointer events and a
manager that allows handling events on data visualization elements.
3.1</p>
      <p>
        Advanced Pen-centric Control of Data Visualization
In order to expand the range of a user commands set, recognizable by the
system, an extended approach to interpreting the input strokes is proposed. To
broaden the classi cation of pen-centric gestures perceived by a system, the
set of measurements as in Fig. 1A is proposed for usage. Creating and dynamic
updating of the gesture space is available with the potential of reactive
programming [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Various view-driven actions and data-driven elements can be bind to
the preferred tools and functions of interactive visualization: Fig. 1B shows the
architecture of user interface along with the related components. In general, the
gestures at the visual analytics tool are processed by two possible ways, as shown
in Fig. 2A. Depending on the complexity assessment of an input stroke, its'
attributes are used for geometric calculations within the frame of related objects
positions or as the input vector for recognition by an arti cial neural network.
For the most e cient distribution of available functionality between handlers,
some gestures may be reused for di erent actions in keeping with conditions of
global environment (as it is depicted for zooming levels in Fig. 3).
The exploration of moderately dense networks is used in various challenges of
visual data analysis. Frequently, the solutions lay in graph drawing, based on
automatic force-directed layout, which results in a spontaneous and irreproducible
node-link diagram. Currently available approaches to improve its readability are
generally oriented to nite rendering without providing to the analyst handy
tools for post-layout manipulations. Enabling indirect manual control on
visualizations through multi-step menus may appear di cult to learn and use. Thus,
the problem requires a more intuitive way of solving. This subsection presents
an original toolset for user-guided re nement of the force-directed graph
layout, with a bias on sketching techniques. Bearing in mind the ease-of-use and
acceptable accuracy of pen-centric manipulations, the sketching technique allow
transition of a graph geometry from irregular to regular. The toolset contains
simple and intuitive gesture-friendly user interface for view-driven selection,
navigation, manipulation, ltering and arrangement of nodes on a graph.
      </p>
      <p>Depending on tasks and goals, performed during data exploration,
pencentric interactions require di erent levels of input precision. If general draft
actions like a preselection (that can be corrected further) or a gesture-command
(having a good potential to be recognized) are feasible even with a rough stroke,
the manipulations with elements of visualization require greater accuracy. The
described user interface solves relatively complex view-driven tasks through
easyperforming pointing device gestures of two main types. The rst type is the
imprecise drawing for shape recognition (which applies a corresponding action, in
particular the nodes alignment as in Fig. 4) or contextual tracing (for a rough
outline of constraints, as on the group selection tool in Fig. 5A). The second
type is the precise drag-and-drop manipulation that is a direct moving of graph
nodes or an accurate adjustment of the ruler sliders (as in Fig. 5C). The set
of pen-based single-stroke gestures for recognition is due to ease of drawing,
regardless whether it painted by a hardware stylus, or by a nger on touch-screen
device, or by a mouse. Sketching above the graph may be optionally visible: if
desired, the user interface allows to enable the indication of gesture path with
fading trace of a pointer, as well as to show a recognized pattern upon
completion. In addition to the untangling of force-directed layout while stroking above
it, the toolset provides usual actions as searching, brushing, picking and direct
modi cation of individual or related nodes and groups.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Towards Flexible Visualizing</title>
      <p>This section proposes guidelines to provide indications for an e ective visual
relational analysis and chronology browsing of graph-based (as well as
hypergraph-based) datasets. Such guidelines have been de ned on the basis of relevant
papers and on the study about divergent possible visual representations of
hypergraphs. As depicted in Fig. 6A, the semantics of data structure considers:
{ Nodes, for instance, members of a collaboration network;
{ Links, that are connections between vertices;
{ A liations, grouping relationships of vertices;
{ Relations, the dependencies among existing Groups.</p>
      <p>
        Groups interrelated among themselves, representing a range, a tree, or a
sparse network, contain relatively densely linked nodes. Each node may be a
liated with a group or a set of groups. The hyper-edge speci es a set of nodes or
an ordered list of nodes. In the following, techniques for representation of nodes,
links and groups, along with their composition (see Fig. 6B), are reviewed in
order to explore and nd proper visualization methods, related to circular,
radial or spiral layout for the node-link diagram with groups. This study excludes
graphic e ects, animation and obvious ways of coding, as colouring and
conditional marking [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
The displacement of an object on the screen is one of the problems to solve
when dealing with graph visualizations. Typically node-link diagrams are shown
on a Cartesian plane. There is a number of similar terms describing the items
distribution in a circular fashion: circular [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], radial [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and spiral [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], each
referring to a polar coordinates system, where the starting point is the centre of
coordinates. The geometric structure of the polar grid may be characterized as
comprising two measurements:
{ Circular, the position of element along the circular line. Visually, a circular
grid is built of concentric circles or a spiral as in Fig. 7B, which can be nested
or twisted with increasing radius in arithmetic or geometric progression. If
desired, the initially curved lines may be segmented in order to form a set
of straightened axes. Depending on the objectives, the curvature of guides
may be precluded (see Fig. 7B right) as it is done in the Radar Chart.
{ Radial, the distance on a polar axis between element and the centre, i.e. the
pole. The main components of the radial grid are guiding lines, diverging
from the pole (see Fig 7A). The grid lines can be straight or bowed, with
tilt to the rotation axis, starting from centre or indented to periphery. The
guides that may contain loops [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] deliberately not considered here.
      </p>
      <p>
        When the grid consists of concentric circles and centripetal lines and the
visualization is crowded, following curved lines can be di cult for a user. In
order to ease the reading of adjacent lines or sectors, there are several possible
implementations of segmentation of the diagram areas: the sectors, the circles,
the zebra stripes segments (Fig. 7D). Visualizations may support extending of
a selected sector angle and height stretching of a selected circle (Fig. 7C), or
adding of related details (Fig. 7E).
The main components of the diagram are nodes, links and groups, which are
described below. According to Krzywinski [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], the most common elements
for multilayer circular layout of nodes are the following (see Fig. 8A):
{ Glyphs: symmetric symbols, miniatures or motifs, having mnemonic extent,
used to denote vertices on a graph. The glyph refers to a unique data unit
that may be paired with text.
{ Patterns: a rectangular shape, transformed in the polar system that may
contain statistical graphics like scatter plots and charts.
{ Silhouettes: a form of continuous line or area; they convey contextual
timeseries or quantitative uctuations. There is a wide variety of positioning for
di erent types of layers (see Fig. 8B).
      </p>
      <p>
        The purpose of a link between a node pair is the binding of two elements of
the same type with a single line. This paragraph intentionally does not mention
the styling techniques that use colour, thickness, and other accessible attributes
of a line, which are widely observed in surveys and literature [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]; it presents
the systematization of geometric variations of the link contours, along with the
approach to combining of a guide grid with a coordinate plane for the purpose to
indicate quantitative values. The analysis of complex multi-dimensional datasets
often requires handling data items of multiple types and also dealing with a rich
variety of connecting ways between such data (see Fig. 9C). The main design goal
is the achievement of visual distinctiveness between di erent types of linking. An
important aspect of the linking line forming in a graph visualized in Cartesian
plane (as in Fig. 9B) is the shaping of lines (as in Fig. 9A).
      </p>
      <p>Fig. 8. Basic types of layers for circular layout (A): silhouette, pattern, glyph.
Combining variations of layers (B): direct review for the related item (blue), overview for a
group of neighbours (violet), report for a pair of distant nodes (dark grey).</p>
      <p>Considering that the polar coordinates grid has two basic elements (the
circle and the intersection of straight lines) among the variations of the line shape
it is worth highlighting the following. Orthogon, which, in principle, may
represent an alternate polygon tted for the polar grid properties. Applicable for
symmetrically spaced distant nodes. Round, which follows the shape of a
circular diagram and looks neat at close radial distances. Conoid, in contrast to the
previous types, it is fully overlaid on the grid. It combines the ability to vary in
two dimensions at once, through a rotation angle and a height above/below the
node placement guide. In addition to joining a pair of nodes, it may denote the
quantitative or chronological properties of a link by the sequence of bends.</p>
      <p>
        Many graphical solutions were proposed and applied to indicate containment
contexts of node sets: i.e. belonging of data units to certain classes for both
hyper-links in graphs [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] and groups in node-link diagrams [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. In comparison
with probabilistic layout techniques (e.g. springs-embedded [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ]), the precise
geometric layouts give more possibilities for visualizing containment.
      </p>
      <p>Visual grouping of nodes can be done using the alignment by a grid (in order
to achieve uniformity or proximity of adjacent units) and express containment
through graphic connectors. In the case of alignment (Fig. 10A), the visual e ect
of grouping is achievable through gaps and spaces on the circular visualization, as
well as using layers. To express containment, neighbour nodes can be combined
in groups of geometric outlines or underlines (Fig. 10B, left), distant nodes can
be gathered in groups with compound geometric or free-form contours and paths
(Fig. 10B, right), or via visual compression (as in Fig. 10D).</p>
      <p>Depending on the task and the level of visual di erentiation for
node-linkgroup diagram items, the circular layout may contain combinations of completely
di erent approaches to design or synthesis. Having a rich and wide overview of
the variety of representing modes for each element, it is important to know how
to combine them e ectively and properly for practical applications.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>De nitely, the visual analytics technologies have great potential for increasing
the e ectiveness of interactions during data exploration, as well as for improving
the readability and aesthetic qualities of data visualization.</p>
      <p>Among the advantages of drawing gestures is the distribution of application
functions between di erent physical user actions. Implementation of the
presented interaction style for enough complex data visualization tools, intended
for use by quali ed users, can speed up the analytical work by replacing
multistep actions (like selections in cascade menus) with pen-centric shortcuts. During
ltering and querying, when it is required just to \outline the boundaries" of
interesting values, this interaction style allows to signi cantly reduce a number
of short-term user manipulations with control elements by accomplishing the
task in one gesture.</p>
      <p>The future work towards reactive interacting will expand the capacity of
sketch-based gestures, applicable in visual analysis of various by type and
structure datasets, through the usage of multiple-touch and multiple-stroke actions,
and their combinations. Particular attention will be paid to studying of the users
learnability and preferences in a choice of gesturing methods and techniques for
speci c view-driven applications.</p>
      <p>Developing of the guidelines and framework for graph-based data visualizing
using circular techniques, which mainly focuses on the di erent possibilities of
visual representation of graphs and hyper-graphs, has a purpose to help
practitioners to have an easy reference in choosing the right technique according
to speci c needs. This work will continue by assembling existing techniques in
the literature and developing the software framework that provides a systematic
proposal of a set of techniques, which can be useful for designing of static or
dynamic graphs and hyper-graphs.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Leonel</given-names>
            <surname>Merino</surname>
          </string-name>
          , Dominik Seliner, Mohammad Ghafari, Oscar Nierstrasz.
          <article-title>CommunityExplorer: A Framework for Visualizing Collaboration Networks</article-title>
          .
          <source>Proceedings of the 11th Edition of the International Workshop on Smalltalk Technologies (IWST16)</source>
          , Prague, Czech Republic (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Xiaoru</given-names>
            <surname>Yuan</surname>
          </string-name>
          , Limei Che, Yifan Hu, Xin Zhang,
          <article-title>Intelligent Graph Layout Using Many Users Input</article-title>
          .
          <source>IEEE Trans. on Visualization and Computer Graphics</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>S.</given-names>
            <surname>Gladisch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Kister</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tominski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Dachselt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Schumann</surname>
          </string-name>
          ,
          <article-title>Mapping Tasks to Interactions for Graph Exploration and Graph Editing on Interactive Surfaces</article-title>
          .
          <source>IEEE Conference on Information Visualization (InfoVis15)</source>
          , Chicago, USA (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Yifan</given-names>
            <surname>Hu</surname>
          </string-name>
          , Shi Lei,
          <source>Visualizing Large Graphs. Wiley Interdisciplinary Reviews: Computational Statistics</source>
          , Volume
          <volume>7</volume>
          , pages
          <fpage>115</fpage>
          {
          <fpage>136</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Charles</surname>
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Stolper</surname>
          </string-name>
          , Minsuk Kahng, Zhiyuan Lin, Florian Foerster, Aakash Goel, John Stasko, Duen Horng Chau, GLOSTIX:
          <article-title>Graph-Level Operations for Specifying Techniques and Interactive eXploration</article-title>
          .
          <source>Transactions on Visualization and Computer Graphics</source>
          , IEEE Computer Society, Los Alamitos, CA, USA (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Michael</surname>
          </string-name>
          <article-title>McGu n and Igor Jurisica, Interaction Techniques for Selecting and Manipulating Subgraphs in Network Visualizations</article-title>
          .
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          , pages
          <volume>937</volume>
          {
          <fpage>944</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Tim</given-names>
            <surname>Dwyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Bongshin</given-names>
            <surname>Lee</surname>
          </string-name>
          , Danyel Fisher, Kori Inkpen Quinn, Petra Isenberg, George G. Robertson, Chris North,
          <article-title>A Comparison of User-Generated and Automatic Graph Layouts</article-title>
          .
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          , pages
          <volume>961</volume>
          {
          <fpage>968</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Wendy</surname>
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lucas</surname>
          </string-name>
          and
          <string-name>
            <surname>Taylor Gordon</surname>
          </string-name>
          ,
          <article-title>User Control of Force-directed Layouts</article-title>
          .
          <source>Proceedings of the 11th International Joint Conference on Software Technologies (ICSOFT</source>
          <year>2016</year>
          ), Volume
          <volume>1</volume>
          : ICSOFTEA, Lisbon, Portugal (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Arlind</given-names>
            <surname>Nocaj</surname>
          </string-name>
          , Mark Ortmann,
          <article-title>Ulrik Brandes, Untangling the Hairballs of MultiCentered, Small-World Online Social Media Networks</article-title>
          .
          <source>Journal of Graph Algorithms and Applications</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. Quang Vinh Nguyen,
          <article-title>Mao Lin Huang, A New Interactive Platform for Visual Analytics of Social Networks</article-title>
          .
          <source>Proceedings of the Visual Information Communications International</source>
          <year>2009</year>
          (
          <article-title>VINCI09), Sydney</article-title>
          , Australia (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>Leandro</given-names>
            <surname>Moraes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Cruz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Luiz</given-names>
            <surname>Velho</surname>
          </string-name>
          ,
          <source>A Sketch on Sketch-Based Interfaces and Modeling. 25th SIBGRAPI Conference on Graphics, Patterns and Images Tutorials</source>
          , pages
          <volume>22</volume>
          {
          <fpage>33</fpage>
          , IEEE Computer Society, Los Alamitos, CA, USA (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Sebastian</surname>
            <given-names>Schmidt</given-names>
          </string-name>
          , Miguel A.
          <string-name>
            <surname>Nacenta</surname>
            , Raimund Dachselt,
            <given-names>Sheelagh</given-names>
          </string-name>
          <string-name>
            <surname>Carpendale</surname>
          </string-name>
          ,
          <article-title>A Set of Multitouch Graph Interaction Techniques</article-title>
          .
          <source>International Conference on Interactive Tabletops and Surfaces (ITS10)</source>
          , New York, NY, USA (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Bertin</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <article-title>Semiologie graphique: les diagrammes, les reseaux, les cartes</article-title>
          .
          <source>Mouton</source>
          , Paris, France (
          <year>1967</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Burch</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fritz</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beck</surname>
            <given-names>F.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Diehl</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Timespidertrees</surname>
          </string-name>
          :
          <article-title>A novel visual metaphor for dynamic compound graphs. In Visual Languages and Human-Centric Computing (VL/HCC)</article-title>
          ,
          <source>IEEE Symposium</source>
          , pages
          <volume>168</volume>
          {
          <fpage>175</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Burch</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beck</surname>
            <given-names>F.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Weiskopf</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <article-title>Radial edge splatting for visualizing dynamic directed graphs</article-title>
          .
          <source>In GRAPP/IVAPP</source>
          , pages
          <volume>603</volume>
          {
          <fpage>612</fpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Vehlow</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burch</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmauder</surname>
            <given-names>H.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Weiskopf</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <article-title>Radial layered matrix visualization of dynamic graphs</article-title>
          .
          <source>In Information Visualisation (IV)</source>
          , 17th International Conference, pages
          <volume>51</volume>
          {
          <fpage>58</fpage>
          ,
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Holten</surname>
          </string-name>
          , Danny, Hierarchical Edge Bundles:
          <article-title>Visualization of Adjacency Relations in Hierarchical Data</article-title>
          .
          <source>In IEEE Trans. on Visualization and Computer Graphics</source>
          , pages
          <volume>741</volume>
          {
          <fpage>748</fpage>
          ,
          <string-name>
            <given-names>IEEE</given-names>
            <surname>Educational Activities</surname>
          </string-name>
          <string-name>
            <surname>Department</surname>
          </string-name>
          , Piscataway, NJ, USA (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Berry</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <article-title>Real Time Programming: Special Purpose or General Purpose Languages (</article-title>
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Tufte</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Envisioning</given-names>
            <surname>Information</surname>
          </string-name>
          . Graphics Press, Cheshire,
          <string-name>
            <surname>CT</surname>
          </string-name>
          , USA (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Zhao</surname>
            <given-names>J.</given-names>
          </string-name>
          , Chevalier F., and
          <string-name>
            <surname>Balakrishnan</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <article-title>Kronominer: using multi-foci navigation for the visual exploration of time-series data</article-title>
          .
          <source>In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems</source>
          , pages
          <fpage>1737</fpage>
          {
          <fpage>1746</fpage>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Diehl</surname>
            <given-names>S.</given-names>
          </string-name>
          , Beck F., and
          <string-name>
            <surname>Burch</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <article-title>Uncovering strengths and weaknesses of radial visualizations: an empirical approach</article-title>
          .
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          ,
          <volume>16</volume>
          (
          <issue>6</issue>
          ):
          <volume>935</volume>
          {
          <fpage>942</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Dragicevic</surname>
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Huot</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spiraclock</surname>
            <given-names>:</given-names>
          </string-name>
          <article-title>a continuous and non-intrusive display for upcoming events</article-title>
          .
          <source>In CHI'02 extended abstracts on Human factors in computing systems</source>
          , pages
          <volume>604</volume>
          {
          <fpage>605</fpage>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Vuillemot</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <article-title>Spirograph designs for ambient display of tweets</article-title>
          .
          <source>In IEEE VIS</source>
          <year>2013</year>
          ,
          <article-title>Atlanta</article-title>
          ,
          <string-name>
            <given-names>GA</given-names>
            ,
            <surname>United</surname>
          </string-name>
          <string-name>
            <surname>States</surname>
          </string-name>
          , IEEE (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Krzywinski</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schein</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Birol</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Connors</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gascoyne</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horsman</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            <given-names>S. J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Marra</surname>
            <given-names>M. A.</given-names>
          </string-name>
          ,
          <article-title>Circos: an information aesthetic for comparative genomics</article-title>
          .
          <source>Genome research</source>
          ,
          <volume>19</volume>
          (
          <issue>9</issue>
          ):
          <volume>1639</volume>
          {
          <fpage>1645</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Krzywinski</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Birol</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            <given-names>S. J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Marra</surname>
            <given-names>M. A.</given-names>
          </string-name>
          <article-title>Hive plots: rational approach to visualizing networks</article-title>
          .
          <source>Brie ngs in Bioinformatics</source>
          ,
          <volume>13</volume>
          (
          <issue>5</issue>
          ):
          <volume>627</volume>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Beck</surname>
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burch</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Diehl</surname>
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Weiskopf</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <article-title>A taxonomy and survey of dynamic graph visualization</article-title>
          .
          <source>Computer Graphics Forum</source>
          ,
          <volume>36</volume>
          (
          <issue>1</issue>
          ):
          <volume>133</volume>
          {
          <fpage>159</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Wu</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wei</surname>
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Au</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cui</surname>
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            <given-names>H.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Qu</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <article-title>Opinionseer: interactive visualization of hotel customer feedback</article-title>
          .
          <source>IEEE transactions on visualization and computer graphics</source>
          ,
          <volume>16</volume>
          (
          <issue>6</issue>
          ):
          <volume>1109</volume>
          {
          <fpage>1118</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Klamt</surname>
            <given-names>S.</given-names>
          </string-name>
          , Haus U.-U., and Theis F.,
          <article-title>Hypergraphs and cellular networks</article-title>
          .
          <source>PLoS Comput Biol</source>
          ,
          <volume>5</volume>
          (
          <issue>5</issue>
          ) (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Saket</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scheidegger</surname>
            <given-names>C.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Kobourov</surname>
            <given-names>S. G.</given-names>
          </string-name>
          ,
          <article-title>Comparing node-link and nodelink-group visualizations from an enjoyment perspective</article-title>
          .
          <source>Comput. Graph. Forum</source>
          ,
          <volume>35</volume>
          (
          <issue>3</issue>
          ):
          <volume>41</volume>
          {
          <fpage>50</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Fruchterman T. M. J. and Reingold</surname>
            <given-names>E. M.</given-names>
          </string-name>
          ,
          <article-title>Graph drawing by force-directed placement</article-title>
          .
          <source>Softw. Pract</source>
          . Exper.,
          <volume>21</volume>
          (
          <issue>11</issue>
          ):
          <volume>1129</volume>
          {
          <fpage>1164</fpage>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>