Skip to main content
SpringerLink
Log in

Map Partitioning for Accelerated Routing: Measuring Relation Between Tiled and Routing Partitions

  • Conference paper
  • First Online:
Operations Research Proceedings 2015

Part of the book series: Operations Research Proceedings ((ORP))

  • 1363 Accesses

Abstract

In this paper we propose key figures to compare two different partitions of street maps. The first partition is used in navigation and reduce the cutting edges in the partition. The second is dependent on a new standard for the transmission of navigational data and has a rectangular shape. We build and analyze the relationship of the partitions with real map data and present first results.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: 2011 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1135–1146. IEEE (2011)

    Google Scholar 

  2. Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a scalable high quality graph partitioner. In: 2010 IEEE International Symposium on Parallel and Distributed Processing (IPDPS), pp. 1–12. IEEE (2010)

    Google Scholar 

  3. Karypis, G., Kumar, V.: Multilevelk-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96–129 (1998)

    Article  Google Scholar 

  4. Karypis, G., Kumar, V.: Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Rev. 41(2), 278–300 (1999)

    Article  Google Scholar 

  5. Pellegrini, F., Roman, J.: Scotch: a software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In: High-performance Computing and Networking, pp. 493–498. Springer, Heidelberg (1996)

    Google Scholar 

  6. Walshaw, C., Cross, M.: JOSTLE: parallel multilevel graph-partitioning software an overview. Mesh partitioning techniques and domain decomposition techniques, pp. 27–58 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Freie Universität Berlin, Garystr. 21, 14195, Berlin, Germany

    Maximilian Adam & Natalia Kliewer

  2. TomTom International B.V, An den Treptowers 1, 12435, Berlin, Germany

    Felix König

Authors
  1. Maximilian Adam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natalia Kliewer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Felix König
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maximilian Adam .

Editor information

Editors and Affiliations

  1. Department of Business Administration, University of Vienna, Vienna, Austria

    Karl Franz Dörner

  2. Decision Sciences and Statistics (IDS) Department, ESSEC Business School of Paris, Cergy Pontoise Cedex, France

    Ivana Ljubic

  3. Department of Statistics and Operations Research, University of Vienna, Vienna, Austria

    Georg Pflug

  4. Operations Research and Control Systems, TU Wien, Vienna, Austria

    Gernot Tragler

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Adam, M., Kliewer, N., König, F. (2017). Map Partitioning for Accelerated Routing: Measuring Relation Between Tiled and Routing Partitions. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_30

Download citation

Publish with us

Policies and ethics

Search

Navigation