Search Results for author: Martin Nöllenburg

Found 5 papers, 3 papers with code

On the Readability of Abstract Set Visualizations

1 code implementation20 Jan 2021 Markus Wallinger, Ben Jacobsen, Stephen Kobourov, Martin Nöllenburg

Set systems are used to model data that naturally arises in many contexts: social networks have communities, musicians have genres, and patients have symptoms.

Human-Computer Interaction

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling

no code implementations18 Feb 2020 Sujoy Bhore, Guangping Li, Martin Nöllenburg

Map labeling is a classical problem in cartography and geographic information systems (GIS) that asks to place labels for area, line, and point features, with the goal to select and place the maximum number of independent, i. e., overlap-free, labels.

Computational Geometry Data Structures and Algorithms

Exploring Semi-Automatic Map Labeling

no code implementations17 Oct 2019 Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt

In an iterative human-in-the-loop process alternating between user modifications and local algorithmic updates and refinements the labeling can be tuned to the user's needs.

Computing Stable Demers Cartograms

2 code implementations20 Aug 2019 Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg

We enforce orthogonal separation constraints with linear programming, and measure quality in terms of keeping adjacent regions close (cartogram quality) and using similar positions for a region between the different data values (stability).

Computational Geometry Data Structures and Algorithms

Temporal Map Labeling: A New Unified Framework with Experiments

1 code implementation20 Sep 2016 Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash

Operations like rotation, zoom, and translation dynamically change the map over time and make a consistent adaptation of the map labeling necessary.

Computational Geometry Data Structures and Algorithms F.2.2; G.2.2; G.2.3

Cannot find the paper you are looking for? You can Submit a new open access paper.