Efficient Labeling of Collinear Sites

Authors

  • Michael Bekos
  • Michael Kaufmann
  • Antonios Symvonis

DOI:

https://doi.org/10.7155/jgaa.00170

Abstract

In this paper we study the map labeling problem where the sites to be labeled are restricted to a line L. Previous models studied in the map labeling literature fail to produce label placements (i.e. place each label next to the site it describes) without label overlaps for certain instances of the problem with dense point sets. To address this problem, we propose a new approach according to which, given n sites each associated with an axis-parallel rectangular label, we aim to place the labels in distinct positions on the "boundary" of L so that they do not overlap and do not obscure the site set, and to connect each label with its associated site through a leader such that no two leaders intersect. We evaluate our labeling model under two minimization criteria: (i) total leader length and (ii) total number of leader bends. We show that both problems are NP-complete if the labels can be placed on both sides of L, while we present polynomial time algorithms for the case where the labels can be placed on only one side of L.

Downloads

Download data is not yet available.

Downloads

Published

2008-10-01

How to Cite

Bekos, M., Kaufmann, M., & Symvonis, A. (2008). Efficient Labeling of Collinear Sites. Journal of Graph Algorithms and Applications, 12(3), 357–380. https://doi.org/10.7155/jgaa.00170