Markus Wallinger

Markus Wallinger

Auto-generated profile, based on publicly available information

Markus Wallinger

Technical University of Munich

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 April 2023 in IEEE Computer Graphics and Applications
Verified
Journal Article
Closed access
RAReyan Ahmed
Reyan Ahmed
PAPatrizio Angelini
Patrizio Angelini
MBMichael A. Bekos
Michael A. Bekos
GBGiuseppe Di Battista
Giuseppe Di Battista
MKMichael Kaufmann
Michael Kaufmann
MWMarkus Wallinger
Markus Wallinger
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines (layers), and their relationships (edges) are represented by segments connecting vertices.Methods for constructing 2-layer drawings often try to minimize the number of edge crossings. We use vertex splitting to reduce the number of crossings, by replacing selected vertices on one layer by two (or more) copies and suitably distributing their incident edges among these copies. We study several optimization problems related to vertex splitting, either minimizing the number of crossings or removing all crossings with fewest splits. While we prove that some variants are $\mathsf {NP}$ -complete, we obtain polynomial-time algorithms for others. We run our algorithms on a benchmark set of bipartite graphs representing the relationships between human anatomical structures and cell types.

9 September 2024 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Open access
NPNikolaus Piccolotto
Nikolaus Piccolotto
MWMarkus Wallinger
Markus Wallinger
SMSilvia Miksch
Silvia Miksch
MBMarkus Bögl
Markus Bögl
In various scientific and industrial domains, analyzing multivariate spatial data, i.e., vectors associated with spatial locations, is common practice. To analyze those datasets, analysts may turn to methods such as Spatial Blind Source Separation (SBSS). Designed explicitly for spatial data analysis, SBSS finds latent components in the dataset and is superior to popular non-spatial methods, like PCA. However, when analysts try different tuning parameter settings, the amount of latent components complicates analytical tasks. Based on our years-long collaboration with SBSS researchers, we propose a visualization approach to tackle this challenge. The main component is UnDRground Tubes (UT), a general-purpose idiom combining ideas from set visualization and multidimensional projections. We describe the UT visualization pipeline and integrate UT into an interactive multiple-view system. We demonstrate its effectiveness through interviews with SBSS experts, a qualitative evaluation with visualization experts, and computational experiments. SBSS experts were excited about our approach. They saw many benefits for their work and potential applications for geostatistical data analysis more generally. UT was also well received by visualization experts. Our benchmarks show that UT projections and its heuristics are appropriate.

27 March 2023 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
MWMarkus Wallinger
Markus Wallinger
ADAlexander Dobler
Alexander Dobler
MNMartin Nöllenburg
Martin Nöllenburg
Linear diagrams are used to visualize set systems by depicting set memberships as horizontal line segments in a matrix, where each set is represented as a row and each element as a column. Each such line segment of a set is shown in a contiguous horizontal range of cells of the matrix indicating that the corresponding elements in the columns belong to the set. As each set occupies its own row in the matrix, the total height of the resulting visualization is as large as the number of sets in the instance. Such a linear diagram can be visually sparse and intersecting sets containing the same element might be represented by distant rows. To alleviate such undesirable effects, we present LinSets.zip, a new approach that achieves a more space-efficient representation of linear diagrams. First, we minimize the total number of gaps in the horizontal segments by reordering columns, a criterion that has been shown to increase readability in linear diagrams. The main difference of LinSets.zip to linear diagrams is that multiple non-intersecting sets can be positioned in the same row of the matrix. Furthermore, we present several different rendering variations for a matrix-based representation that utilize the proposed row compression. We implemented the different steps of our approach in a visualization pipeline using integer-linear programming, and suitable heuristics aiming at sufficiently fast computations in practice. We conducted both a quantitative evaluation and a small-scale user experiment to compare the effects of compressing linear diagrams.

9 September 2024
Verified
Book Chapter
Closed access
PDF file
PRPeter Rodgers
Peter Rodgers
PCPeter Chapman
Peter Chapman
ABAndrew Blake
Andrew Blake
MNMartin Nöllenburg
Martin Nöllenburg
MWMarkus Wallinger
Markus Wallinger
ADAlexander Dobler
Alexander Dobler

25 April 2025
Verified
Conference Paper
Open access
MWMarkus Wallinger
Markus Wallinger
OAOsman Akbulut
Osman Akbulut
KRKabir Ahmed Rufai
Kabir Ahmed Rufai
HPHelen C. Purchase
Helen C. Purchase
DADaniel Archambault
Daniel Archambault

17 May 2024 in Journal of Graph Algorithms and Applications
Verified
Journal Article
Open access
PDF file
MNMartin Nöllenburg
Martin Nöllenburg
MWMarkus Wallinger
Markus Wallinger
Hive plots are a graph visualization style placing vertices on a set of radial axes emanating from a common center and drawing edges as smooth curves connecting their respective endpoints. In previous work on hive plots, assignment to an axis and vertex positions on each axis were determined based on selected vertex attributes and the order of axes was prespecified. Here, we present a new framework focusing on combinatorial aspects of these drawings to extend the original hive plot idea and optimize visual properties such as the total edge length and the number of edge crossings in the resulting hive plots. Our framework comprises three steps: (1) partition the vertices into multiple groups, each corresponding to an axis of the hive plot; (2) optimize the cyclic axis order to bring more strongly connected groups near each other; (3) optimize the vertex ordering on each axis to minimize edge crossings. Each of the three steps is related to a well-studied, but NP-complete computational problem. We combine and adapt suitable exact and heuristic algorithmic approaches, implement them as an instantiation of our framework, and show in a case study how it can be applied in a practical setting. Furthermore, we conduct computational experiments to gain further insights regarding the algorithmic choices of our framework. The code of the implementation and a prototype web application can be found on OSF.