Titel: | Multi-Sided Boundary Labeling |
---|---|
AutorInnen: |
Philipp Kindermann
Benjamin Niedermann Ignaz Rutter Marcus Schaefer André Schulz Alexander Wolff |
Kategorie: | Artikel in Zeitschriften |
erschienen in: | Algorithmica, Vol. 76, no. 1, 2016, pp. 225-258 |
Abstract: | 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 paper, we study the Multi-Sided Boundary Labeling problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, such an algorithm has only been known for the cases in which labels lie on one side or on two opposite sides of R (here a crossing-free solution always exists). The case where labels may lie on adjacent sides is more difficult. We present efficient algorithms for testing the existence of a crossing-free leader layout that labels all sites and also for maximizing the number of labeled sites in a crossing-free leader layout. For two-sided boundary labeling with adjacent sides, we further show how to minimize the total leader length in a crossing-free layout. |
Download: | Journal Website |
BibTeX-Eintrag: | @Article{knrssw-msbl-algo15, Title = {Multi-Sided Boundary Labeling}, Author = {Philipp Kindermann and Benjamin Niedermann and Ignaz Rutter and Marcus Schaefer and Andr{\'{e}} Schulz and Alexander Wolff}, Journal = {Algorithmica}, Year = {2015}, Pages = {1--34}, Abstract = {In the \emph{Boundary Labeling} problem, we are given a set of $n$ points, referred to as \emph{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 \emph{leaders}, with at most one bend. In this paper, we study the \emph{Multi-Sided Boundary Labeling} problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, such an algorithm has only been known for the cases in which labels lie on one side or on two opposite sides of $R$ (here a crossing-free solution always exists). The case where labels may lie on adjacent sides is more difficult. We present efficient algorithms for testing the existence of a crossing-free leader layout that labels all sites and also for maximizing the number of labeled sites in a crossing-free leader layout. For two-sided boundary labeling with adjacent sides, we further show how to minimize the total leader length in a crossing-free layout.}, Doi = {10.1007/s00453-015-0028-4} } |