Optimal orientations of cells in slicing floorplan designs
Information and Control
A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
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
Minimum-change drawings for labeled graphs
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Algorithms for multi-criteria one-sided boundary labeling
GD'07 Proceedings of the 15th international conference on Graph drawing
Dynamic one-sided boundary labeling
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Periodic multi-labeling of public transit lines
GIScience'10 Proceedings of the 6th international conference on Geographic information science
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
Boundary-labeling algorithms for panorama images
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a rectangle R which encloses a set of n sites. Each site is associated with an axis-parallel rectangular label. The main task is to place the labels in distinct positions on the boundary of R, so that they do not overlap, and to connect each site with its corresponding label by non-intersecting polygonal lines, so called leaders. Such a label placement is referred to as legal label placement. In this paper, we study boundary labeling problems along a new line of research. We seek to obtain labelings with labels arranged on more than one stacks placed at the same side of R. We refer to problems of this type as multi-stack boundary labeling problems. We present algorithms for maximizing the uniform label size for boundary labeling with two and three stacks of labels. The key component of our algorithms is a technique that combines the merging of lists and the bounding of the search space of the solution. We also present NP-hardness results for multi-stack boundary labeling problems with labels of variable height.