Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
SIAM Journal on Computing
A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Map labeling heuristics: provably good and practically useful
Proceedings of the eleventh annual symposium on Computational geometry
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Boundary labeling: models and efficient algorithms for rectangular maps
GD'04 Proceedings of the 12th international conference on Graph Drawing
Polygon labelling of minimum leader length
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Minimum-change drawings for labeled graphs
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
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
| Hi-index | 0.00 |
In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leader-label placement, such that the total leader length is minimized. We present an O(n2log3n) algorithm assuming type-opoleaders (rectilinear lines with either zero or two bends) and labels of uniform size which can be attached to all four sides of rectangle R. Our algorithm supports fixed and sliding ports, i.e., the point where each leader is connected to the label (referred to as port) may be fixed or may slide along a label edge.