Labeling 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-01T02:44:47Z
dc.date.available	2014-03-01T02:44:47Z
dc.date.issued	2007	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31948
dc.subject	Labeling	en
dc.subject	Labels	en
dc.subject	Leaders	en
dc.subject	Line	en
dc.subject	Sites	en
dc.subject.other	Computational complexity	en
dc.subject.other	Global optimization	en
dc.subject.other	Problem solving	en
dc.subject.other	Schematic diagrams	en
dc.subject.other	Map labeling problems	en
dc.subject.other	Schematized maps	en
dc.subject.other	Subway networks	en
dc.subject.other	Conformal mapping	en
dc.title	Labeling collinear sites	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/APVIS.2007.329274	en
heal.identifier.secondary	http://dx.doi.org/10.1109/APVIS.2007.329274	en
heal.identifier.secondary	4126217	en
heal.publicationDate	2007	en
heal.abstract	We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site si is associated with an axis-parallel wi × hi label li, which can be placed anywhere on the ""boundary"" of the input line L. The main task is to place the labels in distinct positions, 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 propose several variations of this problem and we investigate their computational complexity under certain optimization criteria. © 2007 IEEE.	en
heal.journalName	Asia-Pacific Symposium on Visualisation 2007, APVIS 2007, Proceedings	en
dc.identifier.doi	10.1109/APVIS.2007.329274	en
dc.identifier.spage	45	en
dc.identifier.epage	51	en