Boundary labelling of optimal total leader length

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-01T02:43:09Z
dc.date.available	2014-03-01T02:43:09Z
dc.date.issued	2005	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31261
dc.subject	Label Placement	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Algorithms	en
dc.subject.other	Boundary conditions	en
dc.subject.other	Optimal systems	en
dc.subject.other	Optimization	en
dc.subject.other	Boundary labelling	en
dc.subject.other	Leader-label placement	en
dc.subject.other	Rectilinear lines	en
dc.subject.other	Problem solving	en
dc.title	Boundary labelling of optimal total leader length	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11573036_8	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11573036_8	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leader-label placement, such that the total leader length is minimized. We present an O(n2log3n) algorithm assuming type-opo leaders (rectilinear lines with either zero or two bends) and labels of uniform size which can be attached to all four sides of rectangle R. Our algorithm supports fixed and sliding ports, i.e., the point where each leader is connected to the label (referred to as port) may be fixed or may slide along a label edge. © Springer-Verlag Berlin Heidelberg 2005.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/11573036_8	en
dc.identifier.isi	ISI:000233675500008	en
dc.identifier.volume	3746 LNCS	en
dc.identifier.spage	80	en
dc.identifier.epage	89	en