Polygon labelling of minimum leader length

We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed 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 minimum total length. We present an O(n2 log3 n) time algorithm for the labelling of polygons.

• Type: Conference
• Year: 2006
• Where: APVIS
• Authors: Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
• Keywords: APVIS 2006, APVIS 2007, Boundary Labelling Problem, Labelling, Leaders Connecting Labels