Algorithms for Multi-Criteria One-Sided Boundary Labeling

Benkert, Marc and Haverkort, Herman and Kroll, Moritz and Nöllenburg, Martin (2008) Algorithms for Multi-Criteria One-Sided Boundary Labeling. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 243-254(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_25).

Full text not available from this repository.

Abstract

We present new algorithms for labeling a set $P$ of $n$ points in the plane with labels that are aligned to the left of the bounding box of $P$. The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithm finds a collection of non-intersecting leaders that minimizes the total number of bends, the total length, or any other 'badness' function of the leaders. An experimental evaluation of the performance is included.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-77537-9_25
Classifications: G Algorithms and Complexity > G.630 Labeling
URI: http://gdea.informatik.uni-koeln.de/id/eprint/842

Actions (login required)

View Item View Item