Boundary labeling: Models and efficient algorithms for rectangular maps

Bekos, MA; Kaufmann, M; Symvonis, A; Wolff, A

dc.contributor.author	Bekos, MA	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Wolff, A	en
dc.date.accessioned	2014-03-01T01:25:59Z
dc.date.available	2014-03-01T01:25:59Z
dc.date.issued	2007	en
dc.identifier.issn	0925-7721	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17859
dc.subject	Automated label placement	en
dc.subject	Boundary labeling	en
dc.subject	Rectilinear leaders	en
dc.subject	Straight-line leaders	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.classification	Mathematics	en
dc.subject.other	PLACEMENT	en
dc.title	Boundary labeling: Models and efficient algorithms for rectangular maps	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.comgeo.2006.05.003	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.comgeo.2006.05.003	en
heal.language	English	en
heal.publicationDate	2007	en
heal.abstract	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. (c) 2006 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computational Geometry: Theory and Applications	en
dc.identifier.doi	10.1016/j.comgeo.2006.05.003	en
dc.identifier.isi	ISI:000244221700005	en
dc.identifier.volume	36	en
dc.identifier.issue	3	en
dc.identifier.spage	215	en
dc.identifier.epage	236	en