Skip to main content

Periodic Multi-labeling of Public Transit Lines

  • Conference paper
Geographic Information Science (GIScience 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6292))

Included in the following conference series:

Abstract

We designed and implemented a simple and fast heuristic for placing multiple labels along edges of a planar network. As a testbed, real-world data from Google Transit is taken: our implementation outputs an overlay onto Google Maps, adding route numbers to public transit lines.

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. http://code.google.com/p/googletransitdatafeed/wiki/PublicFeeds

  2. http://code.google.com/apis/kml/documentation/mapsSupport.html

  3. Been, K., Nöllenburg, M., Poon, S.-H., Wolff, A.: Optimizing active ranges for consistent dynamic map labeling. In: SCG 2008: Proceedings of the 24th Annual Symposium on Computational Geometry, pp. 10–19 (2008)

    Google Scholar 

  4. Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Multi-stack boundary labeling problems. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 81–92. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. 36(3), 215–236 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Benkert, M., Haverkort, H., Kroll, M., Nöllenburg, M.: Algorithms for multi-criteria boundary labeling. Journal of Graph Algorithms and Applications (2009)

    Google Scholar 

  7. Benkert, M., Nöllenburg, M.: Improved algorithms for length-minimal one-sided boundary labeling. In: 23rd European Workshop on Computational Geometry (EuroCG 2007), pp. 190–193 (2007)

    Google Scholar 

  8. Berg, M.d., Cheong, O., Kreveld, M.v., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  9. Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canadian Cartographer 10(2), 112–122 (1973)

    Google Scholar 

  10. Garrido, M.A., Iturriaga, C., MĂ¡rquez, A., Portillo, J.R., Reyes, P., Wolff, A.: Labeling subway lines. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 649–659. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Goodman, J.E., O’Rourke, J. (eds.): Handbook of discrete and computational geometry. CRC Press, Inc., Boca Raton (1997)

    MATH  Google Scholar 

  12. Grabler, F., Agrawala, M., Sumner, R.W., Pauly, M.: Automatic generation of tourist maps. ACM Trans. Graph. 27(3), 1–11 (2008)

    Article  Google Scholar 

  13. Iturriaga, C., Lubiw, A.: Elastic labels around the perimeter of a map. J. Algorithms 47(1), 14–39 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Neyer, G., Wagner, F.: Labeling downtown. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 113–124. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Seibert, S., Unger, W.: The hardness of placing street names in a manhattan type map. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 102–112. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Strijk, T.: Geometric algorithms for cartographic label placement. PhD thesis, Utrecht University (2001)

    Google Scholar 

  17. Dijk, S.v., Kreveld, M.v., Strijk, T., Wolff, A.: Towards an evaluation of quality for label placement methods. In: Proceedings of the 19th International Cartographic Conference, Ottawa, International Cartographic Association, pp. 905–913 (1999)

    Google Scholar 

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

    MATH  Google Scholar 

  19. Wolff, A., Knipping, L., Kreveld, M.v., Strijk, T., Agarwal, P.K.: A simple and efficient algorithm for high-quality line labeling. In: Atkinson, P.M., Martin, D.J. (eds.) Innovations in GIS VII: GeoComputation, vol. 11, pp. 147–159

    Google Scholar 

  20. Yu, K.-L., Liao, C.-S., Lee, D.-T.: Maximizing the number of independent labels in the plane. In: Preparata, F.P., Fang, Q. (eds.) FAW 2007. LNCS, vol. 4613, pp. 136–147. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polishchuk, V., Vihavainen, A. (2010). Periodic Multi-labeling of Public Transit Lines. In: Fabrikant, S.I., Reichenbacher, T., van Kreveld, M., Schlieder, C. (eds) Geographic Information Science. GIScience 2010. Lecture Notes in Computer Science, vol 6292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15300-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15300-6_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15299-3

  • Online ISBN: 978-3-642-15300-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics