Area-Feature Boundary Labeling(1)

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:32:50Z
dc.date.available	2014-03-01T01:32:50Z
dc.date.issued	2010	en
dc.identifier.issn	0010-4620	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20229
dc.subject	boundary labeling	en
dc.subject	map labeling	en
dc.subject	design and analysis of algorithms	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.title	Area-Feature Boundary Labeling(1)	en
heal.type	journalArticle	en
heal.identifier.primary	10.1093/comjnl/bxp087	en
heal.identifier.secondary	http://dx.doi.org/10.1093/comjnl/bxp087	en
heal.language	English	en
heal.publicationDate	2010	en
heal.abstract	Boundary labeling is a relatively new labeling method. It can be useful in automating the production of technical drawings and medical drawings, where it is common to explain certain parts of the drawing with text labels, arranged on its boundary so that other parts of the drawing are not obscured. In boundary labeling, we are given a rectangle R which encloses a set of n sites. Each site s is associated with an axis-parallel rectangular label l(s). The labels must be placed in distinct positions on the boundary of R and they must be connected to their corresponding sites with polygonal lines, called leaders, so that the labels are pairwise disjoint and the leaders do not intersect each other. In this paper, we study a version of the boundary labeling problem where the sites can 'float' within a polygonal region. We present a polynomial time algorithm, which runs in O(n(3)) time and produces a labeling of minimum total leader length for labels of uniform size placed in fixed positions on the boundary of rectangle R.	en
heal.publisher	OXFORD UNIV PRESS	en
heal.journalName	COMPUTER JOURNAL	en
dc.identifier.doi	10.1093/comjnl/bxp087	en
dc.identifier.isi	ISI:000279185400015	en
dc.identifier.volume	53	en
dc.identifier.issue	6	en
dc.identifier.spage	827	en
dc.identifier.epage	841	en