Evaluating esthetics for user-sketched layouts of clustered graphs with known clustering information

Lin, Chun-Cheng; Huang, Weidong; Liu, Wan-Yu; Tanizar, Shierly; Jhong, Shun-Yu

doi:10.1016/j.jvlc.2016.09.001

Cited by 8 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following a similar evaluation approach by Purchase et al [154], Lin and his colleagues conducted a series of user studies using an interactive drawing tool to investigate drawing behaviors of users and their preference and usage of aesthetics. In a study in which thirty participants were asked to draw clustered graphs from adjacency lists along with information about their clusters [169], user-sketched drawings (see Figure 15) and drawing strategies were examined. It was found that the cluster information helped participants to better organize their graphs.…”

Section: ) Graph Visualization Based On User Interventionmentioning

confidence: 99%

The State of the Art in Empirical User Evaluation of Graph Visualizations

et al. 2021

Self Cite

View full text Add to dashboard Cite

While graph drawing focuses more on the aesthetic representation of node-link diagrams, graph visualization takes into account other visual metaphors making them useful for graph exploration tasks in information visualization and visual analytics. Although there are aesthetic graph drawing criteria that describe how a graph should be presented to make it faster and more reliably explorable, many controlled and uncontrolled empirical user studies flourished over the past years. The goal of them is to uncover how well the human user performs graph-specific tasks, in many cases compared to previously designed graph visualizations. Due to the fact that many parameters in a graph dataset as well as the visual representation of them might be varied and many user studies have been conducted in this space, a state-of-the-art survey is needed to understand evaluation results and findings to inform the future design, research, and application of graph visualizations. In this article, we classify the present literature on the topmost level into graph interpretation, graph memorability, and graph creation where the users with their tasks stand in focus of the evaluation, not the computational aspects. As another outcome of this work, we identify the white spots in this field and sketch ideas for future research directions.

show abstract

Section: ) Graph Visualization Based On User Interventionmentioning

confidence: 99%

The State of the Art in Empirical User Evaluation of Graph Visualizations

et al. 2021

Self Cite

View full text Add to dashboard Cite

show abstract

“…The number of concentric circles needed by V is actually the maximum value of , denoted as . Considering the condition of known 1 ( ) and leaf number(i), and the fact that the number of leaf vertices on every concentric circle can form an arithmetic sequence, can be calculated by (14) based on the fact that ( ) is less than or equal to the total number of leaf vertices that can be placed on concentric circles.…”

Section: Leaf Vertices Distribution Algorithm (Ld)mentioning

confidence: 99%

“…Existing studies explored the issues of symmetry by combining with isomorphisms [7] and automorphisms [5,[8][9][10]. In addition, there also is an interesting research topic on symmetry in layouts sketched by participants [11][12][13][14]. However, symmetry is on the basis of human intuition and subjective judgement of researchers.…”

Section: Introductionmentioning

confidence: 99%

A Force-Directed Algorithm for Drawing Directed Graphs Symmetrically

Yang

Gou

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Symmetry is one of the most important aesthetic criteria on graph drawing. It is quite necessary to measure the extent to which the drawings can be considered symmetric. For this purpose, a symmetric metric based on vertex coordinate calculation is proposed in this paper. It is proven theoretically and experimentally that the proposed metric is robust to contraction, expansion, and rotation of drawings. This robustness conforms to human perception of symmetry. Star-subgraphs and cycles are two common structures in digraphs. Both of them have inherent symmetry which should be displayed in drawings. For this purpose, a force-directed algorithm named FDS is proposed which can draw star-subgraphs and cycles as symmetrically as possible. FDS algorithm draws cycles as circles whose positions are fixed to provide a scaffolding for overall layout, renders non-leaf vertices by a standard force-directed layout, and places leaf vertices on concentric circles via a deterministic strategy. A series of experiments are carried out to test FDS algorithm. The results show that FDS algorithm draws digraphs more symmetrically than the existing state-of-the-art algorithms and performs efficiency comparable to O(nlog⁡n) YFHu algorithm.

show abstract

“…1] range for each k value over all the sub-block to compare their values. With the normalized values, the predominant slope in each sub-block can be estimated using Equation (11) and Equation (12).…”

Section: Ridge Reconstructionmentioning

confidence: 99%

“…Another classical example is that of sequence alignment. Generally-speaking, computer vision applications are emerging trends for such a context, and, recently, the research community has devoted a lot of attention to this topic (e.g., [2,3,4,5,6,7,8,9,10,11]). DP has been applied to various tasks in pattern recognition and computer vision [12,13].…”

Section: Introductionmentioning

confidence: 99%

An effective and efficient approximate two-dimensional dynamic programming algorithm for supporting advanced computer vision applications

Cuzzocrea

Mumolo

Grasso

et al. 2017

Journal of Visual Languages & Computing

View full text Add to dashboard Cite

Dynamic programming is a popular optimization technique, developed in the 60's and still widely used today in several fields for its ability to find global optimum. Dynamic Programming Algorithms (DPAs) can be developed in many dimension. However, it is known that if the DPA dimension is greater or equal to two, the algorithm is an NP complete problem. In this paper we present an approximation of the fully two-dimensional DPA (2D-DPA) with polynomial complexity. Then, we describe an implementation of the algorithm on a recent parallel device based on CUDA architecture. We show that our parallel implementation presents a speed-up of about 25 with respect to a sequential implementation on an Intel I7 CPU. In particular, our system allows a speed of about ten 2D-DPA executions per second for 85 × 85 pixels images. Experiments and case studies support our thesis.

show abstract

Evaluating esthetics for user-sketched layouts of clustered graphs with known clustering information

Cited by 8 publications

References 24 publications

The State of the Art in Empirical User Evaluation of Graph Visualizations

The State of the Art in Empirical User Evaluation of Graph Visualizations

A Force-Directed Algorithm for Drawing Directed Graphs Symmetrically

An effective and efficient approximate two-dimensional dynamic programming algorithm for supporting advanced computer vision applications

Contact Info

Product

Resources

About