Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Measuring alignment with the grid: evaluating the earth mover's distance as a metric of alignment between orientations
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Spatial Cognitive Engineering)
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0002-6398-8488
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Spatial Cognitive Engineering)ORCID iD: 0000-0001-5629-0981
2026 (English)In: International Journal of Digital Earth, ISSN 1753-8947, E-ISSN 1753-8955, Vol. 19, no 1, article id 2649987Article in journal (Refereed) Published
Abstract [en]

How an origin and a destination align with the street network may, anecdotally, be used as a heuristic to infer the length and complexity of routes from the origin to the destination. However, no method of measuring alignment with a street network exists, and furthermore, it is unclear whether and under what circumstances it is useful as a heuristic. In this paper, we propose a novel method for measuring alignment using the Earth Mover's Distance (EMD) between orientation distributions. We evaluated this metric using a dataset of 77,293 origin and destination pairs from 100 cities with different street networks, in order to test the hypothesis that an increasing degree of misalignment is predictive of a longer and more complex route from origin to destination. Our evaluation shows that our method for measuring alignment becomes more useful as a heuristic the more grid-like the street network surrounding the origin and destination is. To conclude, the results obtained indicate that alignment is an important factor for route properties, especially in grid-like street networks, a subclass of routes within an environment where the configuration of the street network makes predicting the length and complexity easier.

Place, publisher, year, edition, pages
Taylor & Francis, 2026. Vol. 19, no 1, article id 2649987
Keywords [en]
Route complexity, street network analysis, street orientation, orientation alignment metric, origin–destination pair
National Category
Geometry Multidisciplinary Geosciences Computer Sciences
Identifiers
URN: urn:nbn:se:umu:diva-251725DOI: 10.1080/17538947.2026.2649987ISI: 001732907800001Scopus ID: 2-s2.0-105034848681OAI: oai:DiVA.org:umu-251725DiVA, id: diva2:2050771
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)Available from: 2026-04-06 Created: 2026-04-06 Last updated: 2026-04-17Bibliographically approved

Open Access in DiVA

fulltext(9181 kB)237 downloads
File information
File name FULLTEXT01.pdfFile size 9181 kBChecksum SHA-512
1895b4edf05c70fa039b4ca5604ddf1de523c73811645be124cbdc69565d7f7c13dd64aaee975eecf3cd32abb1ef6ffdbd50dcf4cb2b940272a7440ab1a7370d
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Krantz-Horned, ArvidFalomir, ZoeRichter, Kai-Florian

Search in DiVA

By author/editor
Krantz-Horned, ArvidFalomir, ZoeRichter, Kai-Florian
By organisation
Department of Computing Science
In the same journal
International Journal of Digital Earth
GeometryMultidisciplinary GeosciencesComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 148 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf