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-01T02:45:10Z
dc.date.available	2014-03-01T02:45:10Z
dc.date.issued	2008	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32176
dc.subject	Free Boundary	en
dc.subject.other	Boolean functions	en
dc.subject.other	Labels	en
dc.subject.other	Nuclear propulsion	en
dc.subject.other	Technical presentations	en
dc.subject.other	Arbitrary sizes	en
dc.subject.other	Boundary labeling	en
dc.subject.other	Feasible solutions	en
dc.subject.other	Free boundaries	en
dc.subject.other	Graphical features	en
dc.subject.other	Major factors	en
dc.subject.other	Minimization problems	en
dc.subject.other	New algorithms	en
dc.subject.other	NP-Completeness	en
dc.subject.other	Spatial overlaps	en
dc.subject.other	Textual labels	en
dc.subject.other	Uniform sizes	en
dc.subject.other	Labeling	en
dc.title	Boundary labeling with octilinear leaders	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-69903-3_22	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-69903-3_22	en
heal.publicationDate	2008	en
heal.abstract	A major factor affecting the readability of an illustration that contains textual labels is the degree to which the labels obscure graphical features of the illustration as a result of spatial overlaps. 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 along a new line of research, according to which different pairs of type leaders (i.e. do and pd, od and pd) are combined to produce boundary labelings. Thus, we are able to overcome the problem that there might be no feasible solution when labels are placed on different sides and only one type of leaders 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. © 2008 Springer-Verlag Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-540-69903-3_22	en
dc.identifier.volume	5124 LNCS	en
dc.identifier.spage	234	en
dc.identifier.epage	245	en