Polygon labelling of minimum leader length

Authors:
Michael A. Bekos;Michael Kaufmann;Katerina Potika;Antonios Symvonis
Affiliations:
National Technical University of Athens, School of Applied Mathematical & Physical Sciences, Zografou, Athens, Greece;University of Tübingen, Institute for Informatics, Tübingen, Germany;National Technical University of Athens, School of Applied Mathematical & Physical Sciences, Zografou, Athens, Greece;National Technical University of Athens, School of Applied Mathematical & Physical Sciences, Zografou, Athens, Greece
Venue:
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Year:
2006

Citing 6
Cited 7

Geometry helps in matching

SIAM Journal on Computing
A packing problem with applications to lettering of maps

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Two-Dimensional Voronoi Diagrams in the Lp-Metric

Journal of the ACM (JACM)
Boundary labelling of optimal total leader length

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
BLer: a boundary labeller for technical drawings

GD'05 Proceedings of the 13th international conference on Graph Drawing
Boundary labeling: models and efficient algorithms for rectangular maps

GD'04 Proceedings of the 12th international conference on Graph Drawing

Minimum-change drawings for labeled graphs

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Boundary Labeling with Octilinear Leaders

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Algorithms for multi-criteria one-sided boundary labeling

GD'07 Proceedings of the 15th international conference on Graph drawing
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
On multi-stack boundary labeling problems

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Multi-stack boundary labeling problems

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectangle (that encloses all sites) and special type of leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are non-overlapping and have minimum total length. We present an O(n2 log3 n) time algorithm for the labelling of polygons.