Advertisement

A Combinatorial Framework for Map Labeling

  • Frank Wagner
  • Alexander Wolff
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)

Abstract

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.

Keywords

Simulated Annealing Greedy Algorithm Constraint Satisfaction Problem Polynomial Time Approximation Scheme Local Consistency 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [AvKS97]
    Pankaj Agarwal, Marc van Kreveld, and Subhash Suri. Label placement by maximum independent set in rectangles. In Proceedings of the 9th Canadian Conference on Computational Geometry, pages 233–238, 1997.Google Scholar
  2. [CFMS97]
    Jon Christensen, Stacy Friedman, Joe Marks, and Stuart Shieber. Empirical testing of algorithms for variable-sized label placement. In Proceedings of the 13th Annual ACM Symposium on Computational Geometry, pages 415–417, 1997.Google Scholar
  3. [CMS95]
    Jon Christensen, Joe Marks, and Stuart Shieber. An empirical study of algorithms for point-feature label placement. ACM Transactions on Graphics, 14(3):203–232, 1995.CrossRefGoogle Scholar
  4. [DMM+97]_Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M.E. Moret, and Binhai Zhu. Map labeling and its generalizations. In Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pages 148–157, 1997.Google Scholar
  5. [FPT81]
    Robert J. Fowler, Michael S. Paterson, and Steven L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett., 12(3):133–137, 1981.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [FW91]
    Michael Formann and Frank Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 281–288, 1991.Google Scholar
  7. [FW92]
    Eugene C. Freuder and Richard J. Wallace. Partial constraint satisfaction. Jour. Artificial Intelligence, 58:21–70, 1992.CrossRefMathSciNetGoogle Scholar
  8. [Hir82]
    Stephen A. Hirsch. An algorithm for automatic name placement around point data. The American Cartographer, 9(1):5–17, 1982.CrossRefGoogle Scholar
  9. [Jam96]
    Michael B. Jampel. Over-Constrained Systems in CLP and CSP. PhD thesis, Dept. of Comp. Sci. City University, London, sept 1996.Google Scholar
  10. [JFM96]
    Michael Jampel, Eugene Freuder, and Michael Maher, editors. Over-Constrained Systems. Number 1106 in LNCS. Springer, August 1996.Google Scholar
  11. [KR92]
    Donald E. Knuth and Arvind Raghunathan. The problem of compatible representatives. SIAM J. Discr. Math., 5(3):422–427, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [KT98]
    Konstantinos G. Kakoulis and Ionnis G. Tollis. A unified approach to labeling graphical features. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 347–356, June 1998.Google Scholar
  13. [MF85]
    Alan K. Mackworth and Eugene C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Jour. Artificial Intelligence., 25:65–74, 1985.CrossRefGoogle Scholar
  14. [SFV95]
    Thomas Schiex, Hélène Fargier, and Gérard Verfaillie. Valued constraint satisfaction problems: Hard and easy problems. In Proc. International Joint Conference on AI, aug 1995.Google Scholar
  15. [vKSW98]
    Marc van Kreveld, Tycho Strijk, and Alexander Wolff. Point set labeling with sliding labels. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 337–346, June 1998.Google Scholar
  16. [Wag94]
    Frank Wagner. Approximate map labeling is in Ω(nlog n). Information Processing Letters, 52(3):161–165, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  17. [WW97]
    Frank Wagner and Alexander Wolff. A practical map labeling algorithm. Computational Geometry: Theory and Applications, 7:387–404, 1997.MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Frank Wagner
    • 1
  • Alexander Wolff
    • 1
  1. 1.Institut fr InformatikFachbereich Mathematik und InformatikGermany

Personalised recommendations