Boundary labeling: Models and efficient algorithms for rectangular maps

Boundary labeling: Models and efficient algorithms for rectangular maps
复制标题

DOI:
10.1016/j.comgeo.2006.05.003
复制
发表时间:
2004-09
期刊:
Comput. Geom.
影响因子:
--
通讯作者:
M. Bekos;M. Kaufmann;A. Symvonis;A. Wolff
M. Bekos;M. Kaufmann;A. Symvonis;A. Wolff
中科院分区:
其他
文献类型:
--
作者:
M. Bekos;M. Kaufmann;A. Symvonis;A. Wolff

文献摘要

被引文献

相似文献

我们介绍边界标记,一个新的模型标记点的网站与大标签。根据边界标记模型,标签被放置在包含点站点的轴平行矩形周围,每个标签通过称为引线的多边形线连接到其对应的站点,并且没有两个引线相交。虽然通常使用边界标记,例如,对于医学地图集中的技术图纸和插图,这个问题在文献中还没有研究。这个问题很有趣,因为它是一个标签放置和图形绘制问题的混合体。在本文中,我们研究几个变种的边界标记问题。我们考虑相同或不同大小的标签,直线或直线的领导人,固定或滑动端口附加领导人的网站和附加标签的一个,两个或所有四个边的边界矩形。对于边界标记模型的任何变体,我们的目标是高度美学的标签和领导者的位置。我们提出了简单而有效的算法,最大限度地减少总领导人的长度,或在直线领导人的情况下,弯曲的总数。
We introduce boundary labeling, a new model for labeling point sites with large labels. According to the boundary-labeling model, labels are placed around an axis-parallel rectangle that contains the point sites, each label is connected to its corresponding site through a polygonal line called leader, and no two leaders intersect. Although boundary labeling is commonly used, e.g., for technical drawings and illustrations in medical atlases, this problem has not yet been studied in the literature. The problem is interesting in that it is a mixture of a label-placement and a graph-drawing problem. In this paper we investigate several variants of the boundary-labeling problem. We consider labels of identical or different size, straight-line or rectilinear leaders, fixed or sliding ports for attaching leaders to sites and attaching labels to one, two or all four sides of the bounding rectangle. For any variant of the boundary labeling model, we aim at highly esthetical placements of labels and leaders. We present simple and efficient algorithms that minimize the total leader length or, in the case of rectilinear leaders, the total number of bends.