Efficient labeling of collinear sites

Bekos, MA; Kaufmann, M; Symvonis, A

dc.contributor.author	Bekos, MA	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:28:14Z
dc.date.available	2014-03-01T01:28:14Z
dc.date.issued	2008	en
dc.identifier.issn	15261719	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/18772
dc.subject	Label Placement	en
dc.subject	Map Labeling	en
dc.subject	Polynomial Time Algorithm	en
dc.title	Efficient labeling of collinear sites	en
heal.type	journalArticle	en
heal.identifier.primary	10.7155/jgaa.00170	en
heal.identifier.secondary	http://dx.doi.org/10.7155/jgaa.00170	en
heal.publicationDate	2008	en
heal.abstract	In this paper we study the map labeling problem where the sites to be labeled are restricted to a line L. Previous models studied in the map labeling literature fail to produce label placements (i.e. place each label next to the site it describes) without label overlaps for certain instances of the problem with dense point sets. To address this problem, we propose a new approach according to which, given n sites each associated with an axis-parallel rectangular label, we aim to place the labels in distinct positions on the 'boundary' of L so that they do not overlap and do not obscure the site set, and to connect each label with its associated site through a leader such that no two leaders intersect. We evaluate our labeling model under two minimization criteria: (i) to- tal leader length and (ii) total number of leader bends. We show that both problems are NP-complete if the labels can be placed on both sides of L, while we present polynomial time algorithms for the case where the labels can be placed on only one side of L.	en
heal.journalName	Journal of Graph Algorithms and Applications	en
dc.identifier.doi	10.7155/jgaa.00170	en
dc.identifier.volume	12	en
dc.identifier.issue	3	en
dc.identifier.spage	357	en
dc.identifier.epage	380	en