We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithm finds a collection of non-intersecting leaders that minimizes the total number of bends, the total length, or any other ‘badness’ function of the leaders. An experimental evaluation of the performance is included.
This work was started on the 9th "Korean" Workshop on Computational Geometry and Geometric Networks at Schloss Dagstuhl, Germany, 2006.
|Title of host publication||Graph Drawing (15th International Symposium, GD'07, Sydney, Australia, September 23-26, 2007)|
|Editors||S.H. Hong, T. Nishizeki, W. Quan|
|Place of Publication||Berlin|
|Publication status||Published - 2008|
|Name||Lecture Notes in Computer Science|