Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming

- M. Nöllenburg, A. Wolff
- Computer Science, Medicine
- IEEE Transactions on Visualization and Computer…
- 1 May 2011

Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualization to automatically… Expand

Point labeling with sliding labels

- M. V. Kreveld, T. Strijk, A. Wolff
- Computer Science, Mathematics
- Comput. Geom.
- 1 May 1999

Abstract This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding labels allow… Expand

Three Rules Suffice for Good Label Placement

Abstract. The general label-placement problem consists in labeling a set of features (points, lines, regions) given a set of candidates (rectangles, circles, ellipses, irregularly shaped labels) for… Expand

Boundary labeling: Models and efficient algorithms for rectangular maps

- M. Bekos, M. Kaufmann, A. Symvonis, A. Wolff
- Computer Science, Mathematics
- Comput. Geom.
- 1 April 2007

We introduce boundary labeling, a new model for labeling point sites with large labels. According to the boundary-labeling model, labels are placed around an axis-parallel rectangle that contains the… Expand

Augmenting the Connectivity of Planar and Geometric Graphs

In this paper we study connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such that… Expand

Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps

- M. Bekos, M. Kaufmann, A. Symvonis, A. Wolff
- Computer Science
- Graph Drawing
- 29 September 2004

In this paper, we present boundary labeling, a new approach for labeling point sets with large labels. We first place disjoint labels around an axis-parallel rectangle that contains the points. Then… Expand

Drawing Subway Maps: A Survey

- A. Wolff
- Computer Science
- Informatik - Forschung und Entwicklung
- 29 November 2007

AbstractThis paper deals with automating the drawing of subway maps. There are two features of schematic
subway maps that make them different from drawings of other networks such as flow charts or… Expand

Labeling Points with Circles

We present a new algorithm for labeling points with circles of equal size. Our algorithm tries to maximize the label size. It improves the approximation factor of the only known algorithm for this… Expand

Manhattan-Geodesic Embedding of Planar Graphs

In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains of axis-parallel… Expand

Untangling a Planar Graph

- A. Spillner, A. Wolff
- Computer Science, Mathematics
- SOFSEM
- 19 January 2008

In John Tantalo's on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by moving vertices. Pach… Expand