Boundary labeling: Models and efficient algorithms for rectangular maps

Bekos, MA; Kaufmann, M; Symvonis, A; Wolff, A

dc.contributor.author	Bekos, MA	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Wolff, A	en
dc.date.accessioned	2014-03-01T02:42:31Z
dc.date.available	2014-03-01T02:42:31Z
dc.date.issued	2004	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31028
dc.subject	Efficient Algorithm	en
dc.subject	Graph Drawing	en
dc.subject	Label Placement	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Boundary conditions	en
dc.subject.other	Computer science	en
dc.subject.other	Graph theory	en
dc.subject.other	Mapping	en
dc.subject.other	Boundary labeling	en
dc.subject.other	Disjoint labels	en
dc.subject.other	Graph-drawing problem	en
dc.subject.other	Labeling point sets	en
dc.subject.other	Algorithms	en
dc.title	Boundary labeling: Models and efficient algorithms for rectangular maps	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-31843-9_7	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-31843-9_7	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	In this paper, we present boundary labeling, a new approach for labeling point sets with large labels. We first place disjoint labels around an axis-parallel rectangle that contains the points. Then we connect each label to its point such that no two connections intersect. Such an approach is common e.g. in technical drawings and medical atlases, but so far the problem has not been studied in the literature. The new problem is interesting in that it is a mixture of a label-placement and a graph-drawing problem. © Springer-Verlag Berlin Heidelberg 2004.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/978-3-540-31843-9_7	en
dc.identifier.isi	ISI:000228693700007	en
dc.identifier.volume	3383	en
dc.identifier.spage	49	en
dc.identifier.epage	59	en