#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2013

2017

- This year (3)
- Last 5 years (14)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Therese C. Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
- Graph Drawing
- 2013

We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based representation vertices and edges correspond to axis-parallel boxes on an underlying integer grid; boxes can be further constrained in their shapes and interactions by additional… (More)

- Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
- ISAAC
- 2013

In this paper we introduce trajectory-based labeling, a new variant of dynamic map labeling, where a movement trajectory for the map viewport is given. We define a general labeling model and study the active range maximiza-tion problem in this model. The problem is N P-complete and W[1]-hard. In the restricted, yet practically relevant case that no more… (More)

- Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff
- Algorithmica
- 2015

In the Boundary Labeling problem, we are given a set of n points, referred to as sites, inside an axis-parallel rectangle R, and a set of n pairwise disjoint rectangular labels that are attached to R from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend. In this… (More)

In the Boundary Labeling problem, we are given a set of n points, referred to as sites, inside an axis-parallel rectangle R, and a set of n pairwise disjoint rectangular labels that are attached to R from the outside. The task is to connect the sites to the labels by non-intersecting polygonal paths, so-called leaders. In this paper, we study the Two-Sided… (More)

A road map can be interpreted as a graph embedded in the plane, in which each vertex corresponds to a road junction and each edge to a particular road section. We consider the cartographic problem to place non-overlapping road labels along the edges so that as many road sections as possible are identified by their name, i.e., covered by a label. We show… (More)

- Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
- Graph Drawing
- 2015

Boundary labeling deals with annotating features in images such that labels are placed outside of the image and are connected by curves (so-called leaders) to the corresponding features. While boundary labeling has been extensively investigated from an algorithmic perspective, the research on its readability has been neglected. In this paper we present the… (More)

- Jan-Henrik Haunert, Benjamin Niedermann
- COCOON
- 2015

Drawing network maps automatically comprises two challenging steps, namely laying out the map and placing non-overlapping labels. In this paper we tackle the problem of labeling an already existing network map considering the application of metro maps. We present a flexible and versatile labeling model that subsumes different labeling styles. We show that… (More)

- Benjamin Niedermann, Martin Nöllenburg
- GIScience
- 2016

Given an unlabeled road map, we consider, from an algorithmic perspective, the car-tographic problem to place non-overlapping road labels embedded in their roads. We first decompose the road network into logically coherent road sections, e.g., parts of roads between two junctions. Based on this decomposition, we present and implement a new and versatile… (More)

- Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
- Symposium on Computational Geometry
- 2017

Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concentric circles and straight-line spokes emanating from the circles' center. Such drawings have applications in schematic graph layouts, e.g., for metro maps and destination maps. A plane graph is a planar graph with a fixed planar embedding. We give a… (More)