In this paper, we consider the
leader length minimization problem
, i.e. the problem of finding a legal leader-label placement, such that the total leader length is minimized. We present an
) algorithm assuming
(rectilinear lines with either zero or two bends) and labels of uniform size which can be attached to all four sides of rectangle
. Our algorithm supports
, i.e., the point where each leader is connected to the label (referred to as
) may be fixed or may slide along a label edge.