Name
Abstract | ||
|---|---|---|
Given a set of n points (sites) inside a rectangle R and n points (label locations or ports) on its boundary, a boundary labeling problem seeks ways of connecting every site to a distinct port while achieving different labeling aesthetics. We examine the scenario when the connecting lines (leaders) are drawn as axis-aligned polylines with few bends, every leader lies strictly inside R, no two leaders cross, and the sum of the lengths of all the leaders is minimized. In a k-sided boundary labeling problem, where 1 u003c= k u003c= 4, the label locations are located on the k consecutive sides of R.In this paper we develop an O(n^3 log n)-time algorithm for 2-sided boundary labeling, where the leaders are restricted to have one bend. This improves the previously best known O(n^8 log n)-time algorithm of Kindermann et al. (Algorithmica, 76(1):225-258, 2016). We show the problem is polynomial-time solvable in more general settings such as when the ports are located on more than two sides of R, in the presence of obstacles, and even when the objective is to minimize the total number of bends. Our results improve the previous algorithms on boundary labeling with obstacles, as well as provide the first polynomial-time algorithms for minimizing the total leader length and number of bends for 3- and 4-sided boundary labeling. These results settle a number of open questions on the boundary labeling problems (Wolff, Handbook of Graph Drawing, Chapter 23, Table 23.1, 2014). |
Year | DOI | Venue |
|---|---|---|
2018 | 10.4230/LIPIcs.SWAT.2018.12 | scandinavian workshop on algorithm theory |
DocType | Volume | Citations |
Conference | abs/1803.10812 | 0 |
PageRank | References | Authors |
0.34 | 1 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Prosenjit K. Bose | 1 | 2336 | 293.75 |
| Paz Carmi | 2 | 321 | 43.14 |
| J. Mark Keil | 3 | 613 | 66.64 |
| Saeed Mehrabi | 4 | 80 | 15.55 |
| Debajyoti Mondal | 5 | 93 | 27.33 |