Polygon labelling of minimum leader length

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

dc.contributor.author	Bekos, M	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Potika, K	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:50:16Z
dc.date.available	2014-03-01T02:50:16Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35012
dc.subject	Total Length	en
dc.title	Polygon labelling of minimum leader length	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1151903.1151906	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1151903.1151906	en
heal.publicationDate	2006	en
heal.abstract	We study a variation of the boundary labelling prob- lem, with ∞oating sites (represented as polygons), la- bels of uniform size placed in flxed positions on the boundary of a rectangle (that encloses all sites) and special type of leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are non-overlapping and have	en
heal.journalName	Asia Pacific Symposium on Information Visualisation	en
dc.identifier.doi	10.1145/1151903.1151906	en