Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Boundary Labelling of Optimal Total Leader Length
verfasst von : M. A. Bekos, M. Kaufmann, K. Potika, A. Symvonis
Erschienen in: Advances in Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
(
n
2
log
3
n
) algorithm assuming
type-opo
leaders
(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.