Polygon labelling of minimum leader length

Abstract

We study a variation of the boundary labelling prob- lem, with ∞oating sites (represented as polygons), la- bels of uniform size placed in flxed positions on the boundary of a rectangle (that encloses all sites) and special type of leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are non-overlapping and have