The general map labeling problem consists in labeling a set of sites (points, lines, regions) given a set of candidates (rectangles, circles, ellipses, irregularly shaped labels) for each site. A map can be a classical cartographical map, a diagram, a graph or any other figure that needs to be labeled. A labeling is either a complete set of non-conflicting candidates, one per site, or a subset of maximum cardinality. Finding such a labeling is NP-hard.
We present a combinatorial framework to attack the problem in its full generality. The key idea is to separate the geometric from the combinatorial part of the problem. The latter is captured by the conflict graph of the candidates and by rules which successively simplify this graph towards a near-optimal solution.
We exemplify this framework at the problem of labeling point sets with axis-parallel rectangles as candidates, four per point. We do this such that it becomes clear how our concept can be applied to other cases. We study competing algorithms and do a thorough empirical comparison. The new algorithm we suggest is fast, simple and effective.
|Titel||Graph Drawing (6th International Symposium, GD'98, Montreal, Canada, August 13-15, 1998)|
|Plaats van productie||Berlin|
|ISBN van geprinte versie||3-540-65473-9|
|Status||Gepubliceerd - 1998|
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|