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 point sites. Then, we connect each label to its site such that no two connections, so-called leaders, intersect. Such an approach is common e.g.\ in technical drawings and medical atlases, but so far the problem has not been studied in the literature. The new problem is interesting in that it is a mixture of a label-placement and a graph-drawing problem. We consider attaching labels to one, two or all four sides of the rectangle. We investigate rectilinear and straight-line leaders. We present simple and efficient algorithms that minimize the total length of the leaders or, in the case of rectilinear leaders, the total number of bends.
%0 Journal Article
%1 bksw-blmea-07
%A Bekos, Michael A.
%A Kaufmann, Michael
%A Symvonis, Antonios
%A Wolff, Alexander
%D 2007
%J #CGTA#
%K boundarylabeling Automatedlabelplacement straight-lineleaders rectilinearleaders
%N 3
%P 215--236
%R 10.1016/j.comgeo.2006.05.003
%T Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps
%U http://dx.doi.org/10.1016/j.comgeo.2006.05.003
%V 36
%X 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 point sites. Then, we connect each label to its site such that no two connections, so-called leaders, intersect. Such an approach is common e.g.\ in technical drawings and medical atlases, but so far the problem has not been studied in the literature. The new problem is interesting in that it is a mixture of a label-placement and a graph-drawing problem. We consider attaching labels to one, two or all four sides of the rectangle. We investigate rectilinear and straight-line leaders. We present simple and efficient algorithms that minimize the total length of the leaders or, in the case of rectilinear leaders, the total number of bends.
@article{bksw-blmea-07,
abstract = {In this paper, we present \emph{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 point sites. Then, we connect each label to its site such that no two connections, so-called \emph{leaders}, intersect. Such an approach is common e.g.\ in technical drawings and medical atlases, but so far the problem has not been studied in the literature. The new problem is interesting in that it is a mixture of a label-placement and a graph-drawing problem. \par We consider attaching labels to one, two or all four sides of the rectangle. We investigate rectilinear and straight-line leaders. We present simple and efficient algorithms that minimize the total length of the leaders or, in the case of rectilinear leaders, the total number of bends.},
added-at = {2010-04-13T09:41:29.000+0200},
author = {Bekos, Michael A. and Kaufmann, Michael and Symvonis, Antonios and Wolff, Alexander},
biburl = {https://www.bibsonomy.org/bibtex/211dbbbaf60e40c82fd1289187adf7b9e/fink},
doi = {10.1016/j.comgeo.2006.05.003},
interhash = {1bdd2d956ecde1fb746ce117dd37920c},
intrahash = {11dbbbaf60e40c82fd1289187adf7b9e},
journal = {#CGTA#},
keywords = {boundarylabeling Automatedlabelplacement straight-lineleaders rectilinearleaders},
number = 3,
pages = {215--236},
pdf = {#AWPUBURL#bksw-blmea-07.pdf},
succeeds = {bksw-blmea-04, bksw-blmea-05},
timestamp = {2010-04-13T09:41:29.000+0200},
title = {Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps},
url = {http://dx.doi.org/10.1016/j.comgeo.2006.05.003},
volume = 36,
year = 2007
}