Add to ORKGWe study a variation of the boundary labelling model, with floating sites, labels of uniform size placed in fixed positions on the boundary (that encloses all sites) and special type leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are non-overlapping and have minimum total length. We present an O(n2 log3 n) time algo-rithm for the labelling of polygons