Skip to main content

Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap

  • Conference paper
Algorithms – ESA 2013 (ESA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8125))

Included in the following conference series:

Abstract

Traditional map-labeling algorithms ensure that the labels being placed do not overlap each other, either by omitting labels or scaling them. This is undesirable in applications where the points to be labeled are moving. We develop and experimentally evaluate a heuristic for labeling moving points. Our algorithm labels all the points with labels of a fixed size, while trying to minimize the number of overlapping labels and ensuring smoothly moving labels. It allows a trade-off between label speed and label overlap.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bell, B., Feiner, S., Höllerer, T.: View management for virtual and augmented reality. In: Proc. 14th ACM Sympos. User Interface Software and Technology (UIST 2001), pp. 101–110. ACM (2001)

    Google Scholar 

  2. de Berg, M., Gerrits, D.H.P.: Approximation algorithms for free-label maximization. Comput. Geom. Theory Appl. 45(4), 153–168 (2012)

    Article  MATH  Google Scholar 

  3. García-López, J., Ramos, P.A.: A unified approach to conic visibility. Algorithmica 28(3), 307–322 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1), 209–233 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. van Kreveld, M., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom. Theory Appl. 13, 21–47 (1999)

    Article  MATH  Google Scholar 

  6. Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3), 393–410 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Rosten, E., Reitmayr, G., Drummond, T.: Real-time video annotations for augmented reality. In: Bebis, G., Boyle, R., Koracin, D., Parvin, B. (eds.) ISVC 2005. LNCS, vol. 3804, pp. 294–302. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Vaaraniemi, M., Treib, M., Westermann, R.: Temporally coherent real-time labeling of dynamic scenes. In: Proc. 3rd Internat. Conf. Computing for Geospatial Research and Applications, COM.Geo 2012, article no. 17 (2012)

    Google Scholar 

  9. Wolff, A., Strijk, T.: The Map Labeling Bibliography (2009), http://liinwww.ira.uka.de/bibliography/Theory/map.labeling.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Berg, M., Gerrits, D.H.P. (2013). Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap. In: Bodlaender, H.L., Italiano, G.F. (eds) Algorithms – ESA 2013. ESA 2013. Lecture Notes in Computer Science, vol 8125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40450-4_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40450-4_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40449-8

  • Online ISBN: 978-3-642-40450-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics