DevLan/vispubs huggingface dataset:
Location-dependent generalization of road networks based on equivalent destinations
Authors: Thomas C. van Dijk, Jan-Henrik Haunert, Johannes Oehrlein
Published at EuroVis, 2016

Suppose a user located at a certain vertex in a road network wants to plan a route using a wayfinding map. The user's exact destination may be irrelevant for planning most of the route, because many destinations will be equivalent in the sense that they allow the user to choose almost the same paths. We propose a method to find such groups of destinations automatically and to contract the resulting clusters in a detailed map to achieve a simplified visualization. We model the problem as a clustering problem in rooted, edge‐weighted trees. Two vertices are allowed to be in the same cluster if and only if they share at least a given fraction of their path to the root. We analyze some properties of these clusterings and give a linear‐time algorithm to compute the minimum‐cardinality clustering. This algorithm may have various other applications in network visualization and graph drawing, but in this paper we apply it specifically to focus‐and‐context map generalization. When contracting shortest‐path trees in a geographic network, the computed clustering additionally provides a constant‐factor bound on the detour that results from routing using the generalized network instead of the full network. This is a desirable property for wayfinding maps.
Matrix Reordering Methods for Table and Network Visualization
Authors: Michael Behrisch 0001, Benjamin Bach, Nathalie Henry Riche, Tobias Schreck, Jean-Daniel Fekete
Published at EuroVis, 2016

This survey provides a description of algorithms to reorder visual matrices of tabular data and adjacency matrix of Networks. The goal of this survey is to provide a comprehensive list of reordering algorithms published in different fields such as statistics, bioinformatics, or graph theory. While several of these algorithms are described in publications and others are available in software libraries and programs, there is little awareness of what is done across all fields. Our survey aims at describing these reordering algorithms in a unified manner to enable a wide audience to understand their differences and subtleties. We organize this corpus in a consistent manner, independently of the application or research field. We also provide practical guidance on how to select appropriate algorithms depending on the structure and size of the matrix to reorder, and point to implementations when available.
MCFTLE: Monte Carlo Rendering of Finite-Time Lyapunov Exponent Fields
Authors: Tobias Günther, Alexander Kuhn, Holger Theisel
Published at EuroVis, 2016

Traditionally, Lagrangian fields such as finite‐time Lyapunov exponents (FTLE) are precomputed on a discrete grid and are ray casted afterwards. This, however, introduces both grid discretization errors and sampling errors during ray marching. In this work, we apply a progressive, view‐dependent Monte Carlo‐based approach for the visualization of such Lagrangian fields in time‐dependent flows. Our approach avoids grid discretization and ray marching errors completely, is consistent, and has a low memory consumption. The system provides noisy previews that converge over time to an accurate high‐quality visualization. Compared to traditional approaches, the proposed system avoids explicitly predefined fieldline seeding structures, and uses a Monte Carlo sampling strategy named Woodcock tracking to distribute samples along the view ray. An acceleration of this sampling strategy requires local upper bounds for the FTLE values, which we progressively acquire during the rendering. Our approach is tailored for high‐quality visualizations of complex FTLE fields and is guaranteed to faithfully represent detailed ridge surface structures as indicators for Lagrangian coherent structures (LCS). We demonstrate the effectiveness of our approach by using a set of analytic test cases and real‐world numerical simulations.
Parallel Marching Blocks: A Practical Isosurfacing Algorithm for Large Data on Many-Core Architectures
Authors: Baoquan Liu, Gordon Clapworthy, Feng Dong 0005, Enhua Wu
Published at EuroVis, 2016

Interactive isosurface visualisation has been made possible by mapping algorithms to GPU architectures. However, current state‐of‐the‐art isosurfacing algorithms usually consume large amounts of GPU memory owing to the additional acceleration structures they require. As a result, the continued limitations on available GPU memory mean that they are unable to deal with the larger datasets that are now increasingly becoming prevalent.This paper proposes a new parallel isosurface‐extraction algorithm that exploits the blocked organisation of the parallel threads found in modern many‐core platforms to achieve fast isosurface extraction and reduce the associated memory requirements. This is achieved by optimising thread co‐operation within thread‐blocks and reducing redundant computation; ultimately, an indexed triangular mesh can be produced.Experiments have shown that the proposed algorithm is much faster (up to 10×) than state‐of‐the‐art GPU algorithms and has a much smaller memory footprint, enabling it to handle much larger datasets (up to 64×) on the same GPU.
Pathfinder: Visual Analysis of Paths in Graphs
Authors: Christian Partl, Samuel Gratzl, Marc Streit, Anne Mai Wassermann, Hanspeter Pfister, Dieter Schmalstieg, Alexander Lex
Published at EuroVis, 2016

The analysis of paths in graphs is highly relevant in many domains. Typically, path‐related tasks are performed in node‐link layouts. Unfortunately, graph layouts often do not scale to the size of many real world networks. Also, many networks are multivariate, i.e., contain rich attribute sets associated with the nodes and edges. These attributes are often critical in judging paths, but directly visualizing attributes in a graph layout exacerbates the scalability problem. In this paper, we present visual analysis solutions dedicated to path‐related tasks in large and highly multivariate graphs. We show that by focusing on paths, we can address the scalability problem of multivariate graph visualization, equipping analysts with a powerful tool to explore large graphs. We introduce Pathfinder, a technique that provides visual methods to query paths, while considering various constraints. The resulting set of paths is visualized in both a ranked list and as a node‐link diagram. For the paths in the list, we display rich attribute data associated with nodes and edges, and the node‐link diagram provides topological context. The paths can be ranked based on topological properties, such as path length or average node degree, and scores derived from attribute data. Pathfinder is designed to scale to graphs with tens of thousands of nodes and edges by employing strategies such as incremental query results. We demonstrate Pathfinder's fitness for use in scenarios with data from a coauthor network and biological pathways.
PhysioEx: Visual Analysis of Physiological Event Streams
Authors: Rishikesan Kamaleswaran, Christopher Collins 0001, Andrew James, Carolyn McGregor
Published at EuroVis, 2016

In this work, we introduce a novel visualization technique, the Temporal Intensity Map, which visually integrates data values over time to reveal the frequency, duration, and timing of significant features in streaming data. We combine the Temporal Intensity Map with several coordinated visualizations of detected events in data streams to create PhysioEx, a visual dashboard for multiple heterogeneous data streams. We have applied PhysioEx in a design study in the field of neonatal medicine, to support clinical researchers exploring physiologic data streams. We evaluated our method through consultations with domain experts. Results show that our tool provides deep insight capabilities, supports hypothesis generation, and can be well integrated into the workflow of clinical researchers.
Retailoring Box Splines to Lattices for Highly Isotropic Volume Representations
Authors: Balázs Csébfalvi, Gergely Rácz
Published at EuroVis, 2016

3D box splines are defined by convolving a 1D box function with itself along different directions. In volume visualization, box splines are mainly used as reconstruction kernels that are easy to adapt to various sampling lattices, such as the Cartesian Cubic (CC), Body‐Centered Cubic (BCC), and Face‐Centered Cubic (FCC) lattices. The usual way of tailoring a box spline to a specific lattice is to span the box spline by exactly those principal directions that span the lattice itself. However, in this case, the preferred directions of the box spline and the lattice are the same, amplifying the anisotropic effects of each other. This leads to an anisotropic volume representation with strongly preferred directions. Therefore, in this paper, we retailor box splines to lattices such that the sets of vectors that span the box spline and the lattice are disjoint sets. As the preferred directions of the box spline and the lattice compensate each other, a more isotropic volume representation can be achieved. We demonstrate this by comparing different combinations of box splines and lattices concerning their anisotropic behavior in tomographic reconstruction and volume visualization.
Semi-automatic Vortex Flow Classification in 4D PC-MRI Data of the Aorta
Authors: Monique Meuschke, Benjamin Köhler 0001, Uta Preim, Bernhard Preim, Kai Lawonn
Published at EuroVis, 2016

We present an Aortic Vortex Classification (AVOCLA) that allows to classify vortices in the human aorta semi‐automatically. Current medical studies assume a strong relation between cardiovascular diseases and blood flow patterns such as vortices. Such vortices are extracted and manually classified according to specific, unstandardized properties. We employ an agglomerative hierarchical clustering to group vortex‐representing path lines as basis for the subsequent classification. Classes are based on the vortex' size, orientation and shape, its temporal occurrence relative to the cardiac cycle as well as its spatial position relative to the vessel course. The classification results are presented by a 2D and 3D visualization technique. To confirm the usefulness of both approaches, we report on the results of a user study. Moreover, AVOCLA was applied to 15 datasets of healthy volunteers and patients with different cardiovascular diseases. The results of the semi‐automatic classification were qualitatively compared to a manually generated ground truth of two domain experts considering the vortex number and five specific properties.
Similarity Voting based Viewpoint Selection for Volumes
Authors: Yubo Tao, Qirui Wang, Wei Chen 0001, Yingcai Wu, Hai Lin 0003
Published at EuroVis, 2016

Previous viewpoint selection methods in volume visualization are generally based on some deterministic measures of viewpoint quality. However, they may not express the familiarity and aesthetic sense of users for features of interest. In this paper, we propose an image‐based viewpoint selection model to learn how visualization experts choose representative viewpoints for volumes with similar features. For a given volume, we first collect images with similar features, and these images reflect the viewpoint preferences of the experts when visualizing these features. Each collected image tallies votes to the viewpoints with the best matching based on an image similarity measure, which evaluates the spatial shape and appearance similarity between the collected image and the rendered image from the viewpoint. The optimal viewpoint is the one with the most votes from the collected images, that is, the viewpoint chosen by most visualization experts for similar features. We performed experiments on various volumes available in volume visualization, and made comparisons with traditional viewpoint selection methods. The results demonstrate that our model can select more canonical viewpoints, which are consistent with human perception.
Source Inversion by Forward Integration in Inertial Flows
Authors: Tobias Günther, Holger Theisel
Published at EuroVis, 2016

Inertial particles are finite‐sized objects traveling with a certain velocity that differs from the underlying carrying flow, i.e., they are mass‐dependent and subject to inertia. Their backward integration is in practice infeasible, since a slight change in the initial velocity causes extreme changes in the recovered position. Thus, if an inertial particle is observed, it is difficult to recover where it came from. This is known as the source inversion problem, which has many practical applications in recovering the source of airborne or waterborne pollutions. Inertial trajectories live in a higher dimensional spatio‐velocity space. In this paper, we show that this space is only sparsely populated. Assuming that inertial particles are released with a given initial velocity (e.g., from rest), particles may reach a certain location only with a limited set of possible velocities. In fact, with increasing integration duration and dependent on the particle response time, inertial particles converge to a terminal velocity. We show that the set of initial positions that lead to the same location form a curve. We extract these curves by devising a derived vector field in which they appear as tangent curves. Most importantly, the derived vector field only involves forward integrated flow map gradients, which are much more stable to compute than backward trajectories. After extraction, we interactively visualize the curves in the domain and display the reached velocities using glyphs. In addition, we encode the rate of change of the terminal velocity along the curves, which gives a notion for the convergence to the terminal velocity. With this, we present the first solution to the source inversion problem that considers actual inertial trajectories. We apply the method to steady and unsteady flows in both 2D and 3D domains.
Space-Time Bifurcation Lines for Extraction of 2D Lagrangian Coherent Structures
Authors: Gustavo Mello Machado, Sebastian Boblest, Thomas Ertl, Filip Sadlo
Published at EuroVis, 2016

We present a novel and efficient technique to extract Lagrangian coherent structures in two‐dimensional time‐dependent vector fields. We show that this can be achieved by employing bifurcation line extraction in the space‐time representation of the vector field, and generating space‐time bifurcation manifolds therefrom. To show the utility and applicability of our approach, we provide an evaluation of existing extraction techniques for Lagrangian coherent structures, and compare them to our approach.
State of the Art in Transfer Functions for Direct Volume Rendering
Authors: Patric Ljung, Jens H. Krüger, M. Eduard Gröller, Markus Hadwiger, Charles D. Hansen, Anders Ynnerman
Published at EuroVis, 2016

A central topic in scientific visualization is the transfer function (TF) for volume rendering. The TF serves a fundamental role in translating scalar and multivariate data into color and opacity to express and reveal the relevant features present in the data studied. Beyond this core functionality, TFs also serve as a tool for encoding and utilizing domain knowledge and as an expression for visual design of material appearances. TFs also enable interactive volumetric exploration of complex data. The purpose of this state‐of‐the‐art report (STAR) is to provide an overview of research into the various aspects of TFs, which lead to interpretation of the underlying data through the use of meaningful visual representations. The STAR classifies TF research into the following aspects: dimensionality, derived attributes, aggregated attributes, rendering aspects, automation, and user interfaces. The STAR concludes with some interesting research challenges that form the basis of an agenda for the development of next generation TF tools and methodologies.
State-of-the-Art Report in Web-based Visualization
Authors: Finian Mwalongo, Michael Krone, Guido Reina, Thomas Ertl
Published at EuroVis, 2016

In this report, we review the current state of the art of web‐based visualization applications. Recently, an increasing number of web‐based visualization applications have emerged. This is due to the fact that new technologies offered by modern browsers greatly increased the capabilities for visualizations on the web. We first review these technical aspects that are enabling this development. This includes not only improvements for local rendering like WebGL and HTML5, but also infrastructures like grid or cloud computing platforms. Another important factor is the transfer of data between the server and the client. Therefore, we also discuss advances in this field, for example methods to reduce bandwidth requirements like compression and other optimizations such as progressive rendering and streaming. After establishing these technical foundations, we review existing web‐based visualization applications and prototypes from various application domains. Furthermore, we propose a classification of these web‐based applications based on the technologies and algorithms they employ. Finally, we also discuss promising application areas that would benefit from web‐based visualization and assess their feasibility based on the existing approaches.
TextDNA: Visualizing Word Usage with Configurable Colorfields
Authors: Danielle Albers Szafir, D. Stuffer, Y. Sohail, Michael Gleicher
Published at EuroVis, 2016

Patterns of words used in different text collections can characterize interesting properties of a corpus. However, these patterns are challenging to explore as they often involve complex relationships across many words and collections in a large space of words. In this paper, we propose a configurable colorfield design to aid this exploration. Our approach uses a dense colorfield overview to present large amounts of data in ways that make patterns perceptible. It allows flexible configuration of both data mappings and aggregations to expose different kinds of patterns, and provides interactions to help connect detailed patterns to the corpus overview. TextDNA, our prototype implementation, leverages the GPU to provide interactivity in the web browser even on large corpora. We present five case studies showing how the tool supports inquiry in corpora ranging in size from single document to millions of books. Our work shows how to make a configurable colorfield approach practical for a range of analytic tasks.
The Grassmannian Atlas: A General Framework for Exploring Linear Projections of High-Dimensional Data
Authors: Shusen Liu 0001, Peer-Timo Bremer, J. J. Jayaraman, Bei Wang 0001, Brian Summa, Valerio Pascucci
Published at EuroVis, 2016

Linear projections are one of the most common approaches to visualize high‐dimensional data. Since the space of possible projections is large, existing systems usually select a small set of interesting projections by ranking a large set of candidate projections based on a chosen quality measure. However, while highly ranked projections can be informative, some lower ranked ones could offer important complementary information. Therefore, selection based on ranking may miss projections that are important to provide a global picture of the data. The proposed work fills this gap by presenting the Grassmannian Atlas, a framework that captures the global structures of quality measures in the space of all projections, which enables a systematic exploration of many complementary projections and provides new insights into the properties of existing quality measures.
The State of the Art in Cartograms
Authors: Sabrina Nusrat, Stephen G. Kobourov
Published at EuroVis, 2016

Cartograms combine statistical and geographical information in thematic maps, where areas of geographical regions (e.g., countries, states) are scaled in proportion to some statistic (e.g., population, income). Cartograms make it possible to gain insight into patterns and trends in the World around us and have been very popular visualizations for geo‐referenced data for over a century. This Work surveys cartogram research in visualization, cartography and geometry, covering a broad spectrum of different cartogram types: from the traditional rectangular and table cartograms, to Dorling and diffusion cartograms. A particular focus is the study of the major cartogram dimensions: statistical accuracy, geographical accuracy, and topological accuracy. We review the history of cartograms, describe the algorithms for generating them, and consider task taxonomies. We also review quantitative and qualitative evaluations, and we use these to arrive at design guidelines and research challenges.
There is More to Streamgraphs than Movies: Better Aesthetics via Ordering and Lassoing
Authors: Marco Di Bartolomeo, Yifan Hu 0001
Published at EuroVis, 2016

Streamgraphs were popularized in 2008 when The New York Times used them to visualize box office revenues for 7500 movies over 21 years. The aesthetics of a streamgraph is affected by three components: the ordering of the layers, the shape of the lowest curve of the drawing, known as the baseline, and the labels for the layers. As of today, the ordering and baseline computation algorithms proposed in the paper of Byron and Wattenberg are still considered the state of the art. However, their ordering algorithm exploits statistical properties of the movie revenue data that may not hold in other data. In addition, the baseline optimization is based on a definition of visual energy that in some cases results in considerable amount of visual distortion. We offer an ordering algorithm that works well regardless of the properties of the input data, and propose a 1‐norm based definition of visual energy and the associated solution method that overcomes the limitation of the original baseline optimization procedure. Furthermore, we propose an efficient layer labeling algorithm that scales linearly to the data size in place of the brute‐force algorithm adopted by Byron and Wattenberg. We demonstrate the advantage of our algorithms over existing techniques on a number of real world data sets.
Time-Series Plots Integrated in Parallel-Coordinates Displays
Authors: Henning Gruendl, Patrick Riehmann, Yves Pausch, Bernd Fröhlich 0001
Published at EuroVis, 2016

We present a natural extension of two‐dimensional parallel‐coordinates plots for revealing relationships in time‐dependent multi‐attribute data by building on the idea that time can be considered as the third dimension. A time slice through the visualization represents a certain point in time and can be viewed as a regular parallel‐coordinates display. A vertical slice through one of the axes of the parallel‐coordinates display would show a time‐series plot. For a focus‐and‐context Integration of both views, we embed time‐series plots between two adjacent axes of the parallel‐coordinates plot. Both time‐series plots are drawn using a pseudo three‐dimensional perspective with a single vanishing point. An independent parallel‐coordinates panel that connects the two perspectively displayed time‐series plots can move forward and backward in time to reveal changes in the relationship between the time‐dependent attributes. The visualization of time‐series plots in the context of the parallel‐coordinates plot facilitates the exploration of time‐related aspects of the data without the need to switch to a separate display. We provide a consistent set of tools for selecting and contrasting subsets of the data, which are important for various application domains.