Boundary Labeling with Octilinear Leaders

Authors:
Michael A. Bekos;Michael Kaufmann;Martin Nöllenburg;Antonios Symvonis
Affiliations:
National Technical University of Athens, School of Applied Mathematical & Physical Sciences, 15780 Zografou, Athens, Greece;University of Tübingen, Institute for Informatics, Sand 13, 72076, Tübingen, Germany;Karlsruhe University, Faculty of Informatics, P.O. Box 6980, 76128, Karlsruhe, Germany;National Technical University of Athens, School of Applied Mathematical & Physical Sciences, 15780 Zografou, Athens, Greece
Venue:
Algorithmica - Special Issue: Scandinavian Workshop on Algorithm Theory; Guest Editor: Joachim Gudmundsson
Year:
2010

Citing 0
Cited 7

Dynamic one-sided boundary labeling

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Combining traditional map labeling with boundary labeling

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
One-and-a-half-side boundary labeling

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Boundary-labeling algorithms for panorama images

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Travel-Route-Centered Metro Map Layout and Annotation

Computer Graphics Forum
Two-Sided boundary labeling with adjacent sides

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Spatially efficient design of annotated metro maps

EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

An illustration with textual labels may be hard to read if the labels overlap parts of the illustration. Boundary labeling addresses this problem by attaching the labels to the boundary of a rectangle that contains all features. Then, each feature should be connected to its associated label through a polygonal line, called leader, such that no two leaders intersect. In this paper we study the boundary labeling problem with octilinear leaders, i.e., leaders involving horizontal, vertical, and diagonal segments. In order to produce crossing-free boundary labelings, we combine different pairs of octilinear leaders. Thus, we are able to overcome infeasibility problems that might arise if only a single type of leader is allowed. Our main contribution is a new algorithm for solving the total leader length minimization problem (i.e., the problem of finding a crossing-free boundary labeling, such that the total leader length is minimized) assuming labels of uniform size. We also present an NP-completeness result for the case where the labels are of arbitrary size.