Pairwise Line Labeling of Geographic Boundaries: An Efficient and Practical Algorithm

  • Maxim Rylov GIScience Research Group, Institute of Geography, Heidelberg University, Heidelberg, Germany;
  • Andreas Reimer GIScience Research Group, Institute of Geography, Heidelberg University, Heidelberg, Germany;
Keywords: automated label placement, automated cartography, quality evaluation, computational geometry, GIS mapping

Abstract

We present an algorithm that labels linear features with two matched toponyms describing the left and the right side of a line, respectively. Such a pairwise line labeling strategy is commonly used in manually produced maps to differentiate administrative or other geographic divisions. Our approach solves two basic tasks of the automated map labeling problem, namely candidate-position generation and position evaluation for a given scale. The quality of the name placement is evaluated by comparison to a set of established cartographic principles and guidelines for linear features. We give some results of our experiments based on real datasets. The implementation of our algorithm shows that it is simple and robust, and the resulting sample maps demonstrate its practical efficiency.

Published
2015-05-20
How to Cite
Rylov, M., & Reimer, A. (2015). Pairwise Line Labeling of Geographic Boundaries: An Efficient and Practical Algorithm. Cartographic Perspectives, (79), 5-21. https://doi.org/10.14714/CP79.1212
Section
Peer-Reviewed Articles