In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leaderlabel placement, such that the total leader len...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
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 rectan...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
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 ...
Marc Benkert, Herman J. Haverkort, Moritz Kroll, M...
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
Michael A. Bekos, Michael Kaufmann, Antonios Symvo...
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...