Boundary labeling with octilinear leaders

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

dc.contributor.author	Bekos, MA	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Nollenburg, M	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:32:57Z
dc.date.available	2014-03-01T01:32:57Z
dc.date.issued	2010	en
dc.identifier.issn	0178-4617	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20250
dc.subject	Boundary labeling	en
dc.subject	Leaders	en
dc.subject	Length minimization	en
dc.subject	Map labeling	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Boundary labeling	en
dc.subject.other	Free boundary	en
dc.subject.other	Labelings	en
dc.subject.other	Map-labeling	en
dc.subject.other	Minimization problems	en
dc.subject.other	Np-completeness	en
dc.subject.other	Textual labels	en
dc.subject.other	Uniform size	en
dc.subject.other	Optimization	en
dc.subject.other	Labels	en
dc.title	Boundary labeling with octilinear leaders	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s00453-009-9283-6	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s00453-009-9283-6	en
heal.language	English	en
heal.publicationDate	2010	en
heal.abstract	An illustration with textual labels may be hard to read if the labels overlap parts of the illustration. Boundary labeling addresses this problem by attaching the labels to the boundary of a rectangle that contains all features. Then, each feature should be connected to its associated label through a polygonal line, called leader, such that no two leaders intersect. In this paper we study the boundary labeling problem with octilinear leaders, i.e., leaders involving horizontal, vertical, and diagonal segments. In order to produce crossing-free boundary labelings, we combine different pairs of octilinear leaders. Thus, we are able to overcome infeasibility problems that might arise if only a single type of leader is allowed. Our main contribution is a new algorithm for solving the total leader length minimization problem (i.e., the problem of finding a crossing-free boundary labeling, such that the total leader length is minimized) assuming labels of uniform size. We also present an NP-completeness result for the case where the labels are of arbitrary size. © 2009 Springer Science+Business Media, LLC.	en
heal.publisher	SPRINGER	en
heal.journalName	Algorithmica (New York)	en
dc.identifier.doi	10.1007/s00453-009-9283-6	en
dc.identifier.isi	ISI:000276265300002	en
dc.identifier.volume	57	en
dc.identifier.issue	3	en
dc.identifier.spage	436	en
dc.identifier.epage	461	en