Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
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
| Hi-index | 0.00 |
Boundary labeling is a relatively new labeling method. It targets the areas of technical drawings and medical maps, where it is often common to explain certain parts of the drawing with large text labels arranged on its boundary, so that other parts of the drawing are not obscured. According to this labeling method, we are given a rectangle R, which encloses a set of n sites. Each site si is associated with an axis-parallel rectangular label li. The labels must be placed in distinct positions on the boundary of R and to be connected to their corresponding sites with polygonal lines, called leaders, so that a) labels are pairwise disjoint and b) leaders do not intersect each other. In this paper, we examine labelings with more than one stacks of uniform labels on each side of R and we aim to maximize the (uniform) label size.