Benkert, Marc and Haverkort, Herman and Kroll, Moritz and Nöllenburg, Martin (2008) Algorithms for Multi-Criteria One-Sided Boundary Labeling. [Conference Paper]
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 |
|---|---|
| Classifications: | G Algorithms and Complexity > G.630 Labeling |
| ID Code: | 842 |
| Deposited By: | GDEA, Administration |
| Deposited On: | 24 Jun 2008 |
| Last Modified: | 18 Sep 2008 13:09 |
| Alternative Locations: | http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=4875&spage=243 |

Repository Staff Only: item control page

