Boundary Labeling: Models and Efficient Algorithms
for Rectangular Maps
Proc. 12th Int. Sympos. Graph Drawing (GD'04), volume 3383 of Lecture Notes in Computer Science, page 49--59. Springer-Verlag, (2005)DOI: 10.1007/b105810
Abstract
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 we connect each label to its point such
that no two connections 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.
