Salt intake and regulation in two passerine nectar drinkers: white-bellied sunbirds and New Holland honeyeaters

Avian nectarivores face the dilemma of having to conserve salts while consuming large volumes of a dilute, electrolyte-deficient diet. This study evaluates the responses to salt solutions and the regulation of salt intake in white-bellied sunbirds (Cinnyris talatala) and New Holland honeyeaters (Phylidonyris novaehollandiae). Birds were first offered a choice of four sucrose diets, containing no salt or 25, 50 or 75 mM NaCl. The experiment was repeated using five sucrose concentrations (0.075-0.63 M) as the base solution. Both species ingested similar amounts of all diets when fed the concentrated base solutions. However, when birds had to increase their intake to obtain enough energy on the dilute sucrose diets, there was a general avoidance of the higher salt concentrations. Through this diet switching, birds maintained constant intakes of both sucrose and sodium; the latter may contribute to absorption of their sugar diets. A second, no-choice experiment was designed to elucidate the renal concentrating abilities of these two nectarivores, by feeding them 0.63 M sucrose containing 5-200 mM NaCl over a 4-h trial. In both species, cloacal fluid osmolalities increased with diet NaCl concentration, but honeyeaters tended to retain ingested Na+, while sunbirds excreted it. Comparison of Na+ and K+ concentrations in ureteral urine and cloacal fluid showed that K+, but not Na+, was reabsorbed in the lower intestine of both species. The kidneys of sunbirds and honeyeaters, like those of hummingbirds, are well suited to diluting urine; however, they also appear to concentrate urine efficiently when necessary

A Coloring Algorithm for Disambiguating Graph and Map Drawings

Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down eye movements. In this paper we propose an algorithm that disambiguates the edges with automatic selection of distinctive colors. Our proposed algorithm computes a near optimal color assignment of a dual collision graph, using a novel branch-and-bound procedure applied to a space decomposition of the color gamut. We give examples demonstrating the effectiveness of this approach in clarifying drawings of real world graphs and maps

Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors

While visual comparison of directed acyclic graphs (DAGs) is commonly encountered in various disciplines (e.g., finance, biology), knowledge about humans' perception of graph similarity is currently quite limited. By graph similarity perception we mean how humans perceive commonalities and differences in graphs and herewith come to a similarity judgment. As a step toward filling this gap the study reported in this paper strives to identify factors which influence the similarity perception of DAGs. In particular, we conducted a card-sorting study employing a qualitative and quantitative analysis approach to identify 1) groups of DAGs that are perceived as similar by the participants and 2) the reasons behind their choice of groups. Our results suggest that similarity is mainly influenced by the number of levels, the number of nodes on a level, and the overall shape of the graph.Comment: Graph Drawing 2017 - arXiv Version; Keywords: Graphs, Perception, Similarity, Comparison, Visualizatio

Can animation support the visualisation of dynamic graphs?

Animation and small multiples are methods for visualizing dynamically evolving graphs. Animations present an interactive movie of the data where positions of nodes are smoothly interpolated as the graph evolves. Nodes fade in/out as they are added/removed from the data set. Small multiples presents the data like a comic book with the graph at various states in separate windows. The user scans these windows to see how the data evolves. In a recent experiment, drawing stability (known more widely as the “mental map”) was shown to help users follow specific nodes or long paths in dynamically evolving data. However, no significant difference between animation and small multiples presentations was found. In this paper, we look at data where the nodes in the graph have low drawing stability and analyze it with new error metrics: measuring how close the given answer is from the correct answer on a continuous scale. We find evidence that when the stability of the drawing is low and important nodes in the task cannot be highlighted throughout the time series, animation can improve task performance when compared to the use of small multiples

On the effective visualisation of dynamic attribute cascades

Cascades appear in many applications, including biological graphs and social media analysis. In a cascade, a dynamic attribute propagates through a graph, following its edges. We present the results of a formal user study that tests the effectiveness of different types of cascade visualisations on node-link diagrams for the task of judging cascade spread. Overall, we found that a small multiples presentation was significantly faster than animation with no significant difference in terms of error rate. Participants generally preferred animation over small multiples and a hierarchical layout to a force-directed layout. Considering each presentation method separately, when comparing force-directed layouts to hierarchical layouts, hierarchical layouts were found to be significantly faster for both presentation methods and significantly more accurate for animation. Representing the history of the cascade had no significant effect. Thus, for our task, this experiment supports the use of a small multiples interface with hierarchically drawn graphs for the visualisation of cascades. This work is important because without these empirical results, designers of dynamic multivariate visualisations (in many applications) would base their design decisions on intuition with little empirical support as to whether these decisions enhance usability

A Classification of Infographics

Classifications are useful for describing existing phenomena and guiding further investigation. Several classifications of diagrams have been proposed, typically based on analytical rather than empirical methodologies. A notable exception is the work of Lohse and his colleagues, published in Communications of the ACM in December 1994. The classification of diagrams that Lohse proposed was derived from bottom-up grouping data collected from sixteen participants and based on 60 diagrams. Mean values on ten Likert-scales were used to predict diagram class. We follow a similar methodology to Lohse, using real-world infographics (i.e. embellished data charts) as our stimuli. We propose a structural classification of infographics, and determine whether infographics class can be predicted from values on Likert scales

The Impact of Shape on the Perception of Euler Diagrams

Euler diagrams are often used for visualizing data collected into sets. However, there is a significant lack of guidance regarding graphical choices for Euler diagram layout. To address this deficiency, this paper asks the question `does the shape of a closed curve affect a user's comprehension of an Euler diagram?' By empirical study, we establish that curve shape does indeed impact on understandability. Our analysis of performance data indicates that circles perform best, followed by squares, with ellipses and rectangles jointly performing worst. We conclude that, where possible, circles should be used to draw effective Euler diagrams. Further, the ability to discriminate curves from zones and the symmetry of the curve shapes is argued to be important. We utilize perceptual theory to explain these results. As a consequence of this research, improved diagram layout decisions can be made for Euler diagrams whether they are manually or automatically drawn

GiViP: A Visual Profiler for Distributed Graph Processing Systems

Analyzing large-scale graphs provides valuable insights in different application scenarios. While many graph processing systems working on top of distributed infrastructures have been proposed to deal with big graphs, the tasks of profiling and debugging their massive computations remain time consuming and error-prone. This paper presents GiViP, a visual profiler for distributed graph processing systems based on a Pregel-like computation model. GiViP captures the huge amount of messages exchanged throughout a computation and provides an interactive user interface for the visual analysis of the collected data. We show how to take advantage of GiViP to detect anomalies related to the computation and to the infrastructure, such as slow computing units and anomalous message patterns.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Convexity-Increasing Morphs of Planar Graphs

We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all times. Our morph is convexity-increasing, meaning that once an angle is convex, it remains convex. We give an efficient algorithm that constructs such a morph as a composition of a linear number of steps where each step either moves vertices along horizontal lines or moves vertices along vertical lines. Moreover, we show that a linear number of steps is worst-case optimal. To obtain our result, we use a well-known technique by Hong and Nagamochi for finding redrawings with convex faces while preserving y-coordinates. Using a variant of Tutte's graph drawing algorithm, we obtain a new proof of Hong and Nagamochi's result which comes with a better running time. This is of independent interest, as Hong and Nagamochi's technique serves as a building block in existing morphing algorithms.Comment: Preliminary version in Proc. WG 201

Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends

We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively. A drawing of a graph is 1-planar if every edge is crossed at most once. A 1-planar drawing is IC-planar if no two pairs of crossing edges share a vertex. A 1-planar drawing is NIC-planar if no two pairs of crossing edges share two vertices. We study the relations of these beyond-planar graph classes (beyond-planar graphs is a collective term for the primary attempts to generalize the planar graphs) to right-angle crossing (RAC) graphs that admit compact drawings on the grid with few bends. We present four drawing algorithms that preserve the given embeddings. First, we show that every $n$-vertex NIC-planar graph admits a NIC-planar RAC drawing with at most one bend per edge on a grid of size $O(n) \times O(n)$. Then, we show that every $n$-vertex 1-planar graph admits a 1-planar RAC drawing with at most two bends per edge on a grid of size $O(n^3) \times O(n^3)$. Finally, we make two known algorithms embedding-preserving; for drawing 1-planar RAC graphs with at most one bend per edge and for drawing IC-planar RAC graphs straight-line