Boundary Labelling of Optimal Total Leader Length


In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leaderlabel placement, such that the total leader length is minimized. We present an O(nlogn) algorithm assuming type-opo leaders (rectilinear lines with either zero or two bends) and labels of uniform size which can be attached to… (More)
DOI: 10.1007/11573036_8

9 Figures and Tables


  • Presentations referencing similar topics