Algorithms for multi-criteria one-sided boundary labeling

Authors:
Marc Benkert;Herman Haverkort;Moritz Kroll;Martin Nöllenburg
Affiliations:
Faculty of Informatics, Karlsruhe University, Karlsruhe, Germany;Department of Computing Science, TU Eindhoven, Eindhoven, Netherlands;Faculty of Informatics, Karlsruhe University, Karlsruhe, Germany;Faculty of Informatics, Karlsruhe University, Karlsruhe, Germany
Venue:
GD'07 Proceedings of the 15th international conference on Graph drawing
Year:
2007

Citing 4
Cited 4

Excentric labeling: dynamic neighborhood labeling for data visualization

Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Polygon labelling of minimum leader length

APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Boundary labeling: Models and efficient algorithms for rectangular maps

Computational Geometry: Theory and Applications
Multi-stack boundary labeling problems

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science

Boundary Labeling with Octilinear Leaders

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Technical Section: Layout-aware optimization for interactive labeling of 3D models

Computers and Graphics
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithm finds a collection of nonintersecting leaders that minimizes the total number of bends, the total length, or any other 'badness' function of the leaders. An experimental evaluation of the performance is included.