Skip to main content
Log in

A two-phase algorithm for point-feature cartographic label placement

  • Research Article
  • Published:
Earth Science Informatics Aims and scope Submit manuscript

Abstract

Point-feature cartographic label placement (PFCLP) involves placing labels adjacent to their corresponding point features on a map. A widely accepted goal of PFCLP is to maximize the number of conflict-free labels. This paper presents an algorithm for PFCLP based on the four-slider (4S) model. The algorithm is composed of two phases: an initialization phase during which an initial solution is constructed by an exact algorithm and a heuristic method to maximize the probability of conflict-free labels. The initialization phase is followed by an improvement phase that adopts a backtracking greedy search. The exact algorithm can find a portion of the conflict-free labels in an optimal solution and an extension of the exact algorithm is provided that can find additional conflict-free labels. Computational tests were performed for instances based on standard sets. The two-phase algorithm generated better solutions relative to all methods previously reported in the literature. It also executes at a reasonable speed and is more stable than most other methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  • Alvim ACF, Taillard ÉD (2009) POPMUSIC for the point feature label placement problem. Eur J Oper Res 192:396–413. https://doi.org/10.1016/j.ejor.2007.10.002

    Article  Google Scholar 

  • Christensen J, Marks J, Shieber S (1995) An empirical study of algorithms for point-feature label placement. ACM Trans Graph (TOG) 14:203–232

    Article  Google Scholar 

  • Cravo GL, Ribeiro GM, Lorena LAN (2008) A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Comput Geosci 34:373–386. https://doi.org/10.1016/j.cageo.2007.01.007

    Article  Google Scholar 

  • de Berg M, Gerrits DHP (2012) Approximation algorithms for free-label maximization. Comput Geom 45:153–168. https://doi.org/10.1016/j.comgeo.2011.10.004

    Article  Google Scholar 

  • Ebner D, Klau GW, Weiskircher R (2004) Label number maximization in the slider model. In: Proceedings of the 12th International Symposium on Graph Drawing (GD’04), New York, NY, USA, September 29-October 2 2004. Springer, Berlin/Heidelberg, Germany, pp 144–154

  • Erlebach T, Hagerup T, Jansen K, Minzlaff M, Wolff A (2006) A new approximation algorithm for labeling weighted points with sliding labels. In: Proceedings of 22nd European Workshop on Computational Geometry (EWCG’06), March 27-29 2006. Delphi, Greece, pp 137–140

  • Erlebach T, Hagerup T, Jansen K, Minzlaff M, Wolff A (2010) Trimming of graphs, with application to point labeling. Theory Comput Syst 47:613–636. https://doi.org/10.1007/s00224-009-9184-8

    Article  Google Scholar 

  • Formann M, Wagner F (1991) A packing problem with applications to lettering of maps. In: Proceedings of the seventh annual symposium on Computational geometry, July 1991. ACM, North Conway, New Hampshire, USA, pp 281–288

  • Klau GW, Mutzel P (2000) Optimal labelling of point features in the slider model. In: Proceedings of 6th Annual International Computing and Combinatorics Conference (COCOON’00), Bondi Beach, Sydney, Australia, July 26–28 2000. Springer, Berlin/Heidelberg, Germany, pp 340–350

  • Klau GW, Mutzel P (2003) Optimal labeling of point features in rectangular labeling models. Math Program 94:435–458. https://doi.org/10.1007/s10107-002-0327-9

    Article  Google Scholar 

  • Marks J, Shieber SM (1991) The computational complexity of cartographic label placement. Center for Research in Computing Technology, Harvard University, Cambridge

  • Mauri GR, Ribeiro GM, Lorena LAN (2010) A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem. Comput Oper Res 37:2164–2172. https://doi.org/10.1016/j.cor.2010.03.005

    Article  Google Scholar 

  • Oliveira C, Urrutia S, Noronha T (2009) Heurística ILS para o problema da rotulação cartográfica de pontos. Anais do XII SPOLM-Simpósio de Pesquisa Operacional e Logística da Marinha

  • Oliveira C, Urrutia S, Noronha TF (2010) Heurística de backtracking para o problema da rotulação cartográfica de pontos. Anais do XLII SBPO-Simpósio Brasileiro de Pesquisa Operacional

  • Poon S-H, Shin C-S, Strijk T, Uno T, Wolff A (2003) Labeling points with weights. Algorithmica 38:341–362. https://doi.org/10.1007/s00453-003-1063-0

    Article  Google Scholar 

  • Rabello RL, Mauri GR, Ribeiro GM, Lorena LAN (2014) A clustering search metaheuristic for the point-feature cartographic label placement problem. Eur J Oper Res 234:802–808. https://doi.org/10.1016/j.ejor.2013.10.021

    Article  Google Scholar 

  • Ribeiro GM, Lorena LAN (2008a) Column generation approach for the point-feature cartographic label placement problem. J Comb Optim 15:147–164. https://doi.org/10.1007/s10878-007-9073-5

    Article  Google Scholar 

  • Ribeiro GM, Lorena LAN (2008b) Lagrangean relaxation with clusters for point-feature cartographic label placement problems. Comput Oper Res 35:2129–2140. https://doi.org/10.1016/j.cor.2006.09.024

    Article  Google Scholar 

  • Ribeiro GM, Constantino MF, Lorena LAN (2009) Um estudo sobre desigualdades válidas para o problema de maximização de rótulos livres. Anais do XLI SBPO-Simpósio Brasileiro de Pesquisa Operacional

  • Schwartges N, Haunert J-H, Wolff A, Zwiebler D (2014) Point Labeling with Sliding Labels in Interactive Maps. In: Connecting a Digital Europe Through Location and Place. Springer International Publishing, Cham, Switzerland, pp 295–310. https://doi.org/10.1007/978-3-319-03611-3_17

  • Strijk T, Van Kreveld M (2002) Practical extensions of point labeling in the slider model*. GeoInformatica 6:181–197

    Article  Google Scholar 

  • Strijk T, Verweij B, Aardal K (2000) Algorithms for maximum independent set applied to map labelling. Department of Computer Science, Utrecht University, Utrecht

  • van Kreveld M, Strijk T, Wolff A (1999) Point labeling with sliding labels. Comput Geom 13:21–47. https://doi.org/10.1016/S0925-7721(99)00005-X

    Article  Google Scholar 

  • Verner OV, Wainwright RL, Schoenefeld DA (1997) Placing text labels on maps and diagrams using genetic algorithms with masking. INFORMS J Comput 9:266–275

    Article  Google Scholar 

  • Wagner F, Wolff A, Kapoor V, Strijk T (2001) Three rules suffice for good label placement. Algorithmica 30:334–349

    Article  Google Scholar 

  • Yamamoto M, Lorena L (2005) A constructive genetic approach to point-feature cartographic label placement. In: Ibaraki T, Nonobe K, Yagiura M (eds) Metaheuristics: Progress as real problem solvers. Kluwer Academic Publishers, Boston, USA, pp 285–300

  • Yamamoto M, Camara G, Lorena LAN (2002) Tabu search heuristic for point-feature cartographic label placement. GeoInformatica 6:77–90

    Article  Google Scholar 

  • Zhu B, Qin Z (2002) New approximation algorithms for map labeling with sliding labels. J Comb Optim 6:99–110

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Changbin Wu.

Additional information

Communicated by: H. A. Babaie

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ding, Y., Jiang, N., Wu, C. et al. A two-phase algorithm for point-feature cartographic label placement. Earth Sci Inform 11, 183–203 (2018). https://doi.org/10.1007/s12145-017-0320-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12145-017-0320-8

Keywords

Navigation