On multi-stack boundary labeling problems

Bekos, MA; Kaufmann, M; Potika, K; Symvonis, A

dc.contributor.author	Bekos, MA	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Potika, K	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:24:41Z
dc.date.available	2014-03-01T01:24:41Z
dc.date.issued	2006	en
dc.identifier.issn	11092750	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17398
dc.subject	Boundary labeling	en
dc.subject	Dynamic programming	en
dc.subject	Labels	en
dc.subject	Leaders	en
dc.subject	Multi-stacks	en
dc.subject	Sites	en
dc.subject.other	Boundary conditions	en
dc.subject.other	Dynamic programming	en
dc.subject.other	Maximum principle	en
dc.subject.other	Problem solving	en
dc.subject.other	Set theory	en
dc.subject.other	Theorem proving	en
dc.subject.other	Boundary labeling problems	en
dc.subject.other	Multi-stack problems	en
dc.subject.other	Boundary value problems	en
dc.title	On multi-stack boundary labeling problems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/11944836_10	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11944836_10	en
heal.publicationDate	2006	en
heal.abstract	Boundary labeling is a relatively new labeling method. It targets the areas of technical drawings and medical maps, where it is often common to explain certain parts of the drawing with large text labels arranged on its boundary, so that other parts of the drawing are not obscured. A ccording to this labeling method, we are given a rectangle R, which encloses a set of n sites. Each site si is associated with an axis-parallel rectangular label li. The labels must be placed in distinct positions on the boundary of R and to be connected to their corresponding sites with polygonal lines, called leaders, so that a) labels are pairwise disjoint and b) leaders do not intersect each other. In this paper, we examine labelings with more than one stacks of unifor m labels on each side of R and we aim to maximize the (uniform) label size.	en
heal.journalName	WSEAS Transactions on Computers	en
dc.identifier.doi	10.1007/11944836_10	en
dc.identifier.volume	5	en
dc.identifier.issue	11	en
dc.identifier.spage	2602	en
dc.identifier.epage	2607	en