dc.contributor.author |
Bekos, MA |
en |
dc.contributor.author |
Symvonis, A |
en |
dc.date.accessioned |
2014-03-01T02:52:35Z |
|
dc.date.available |
2014-03-01T02:52:35Z |
|
dc.date.issued |
2010 |
en |
dc.identifier.issn |
17924863 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/35945 |
|
dc.relation.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-79959976726&partnerID=40&md5=7f8c23864d3dee03cde14532c1678f1b |
en |
dc.subject |
Boundary labeling |
en |
dc.subject |
Complexity |
en |
dc.subject |
Map labeling |
en |
dc.subject.other |
Boundary labeling |
en |
dc.subject.other |
Complexity |
en |
dc.subject.other |
Graph drawing |
en |
dc.subject.other |
Graphical information systems |
en |
dc.subject.other |
Information visualization |
en |
dc.subject.other |
Map labeling |
en |
dc.subject.other |
Textual labels |
en |
dc.subject.other |
Drawing (graphics) |
en |
dc.subject.other |
Information systems |
en |
dc.subject.other |
Mapping |
en |
dc.subject.other |
Maps |
en |
dc.subject.other |
Visualization |
en |
dc.subject.other |
Computer science |
en |
dc.title |
Boundary labeling with octilinear leaders and minimum number of leader-bends |
en |
heal.type |
conferenceItem |
en |
heal.publicationDate |
2010 |
en |
heal.abstract |
A common task in the process of information visualization is the placement of textual labels on features of interest within an illustration. The interest in algorithms that automate this task has received considerable attention, due to the numerous applications that stem from diverse areas such as Cartography, Graph Drawing and Graphical Information Systems. Among various types of labeling models, boundary labeling addresses this problem by connecting each site-feature of the illustration to a label outside the illustration by using a leader, i.e., a polygonal line from the feature to the label. In this paper, we study a variant of boundary labeling with octilinear leaders, i.e., polygonal lines involving horizontal, vertical, and diagonal segments. Our main contribution is showing that minimizing the total number of leader-bends is hard. |
en |
heal.journalName |
International Conference on Applied Computer Science - Proceedings |
en |
dc.identifier.spage |
208 |
en |
dc.identifier.epage |
213 |
en |