View profile for Jan-Henrik Haunert, graphic

Professor fรผr Geoinformation, Universitรคt Bonn

๐— ๐—ฒ๐˜๐—ฟ๐—ผ๐—ฐ๐—ต๐—ฟ๐—ผ๐—ป๐—ฒ๐˜€: ๐—ฆ๐—ฐ๐—ต๐—ฒ๐—บ๐—ฎ๐˜๐—ถ๐—ฐ ๐—œ๐˜€๐—ผ๐—ฐ๐—ต๐—ฟ๐—ผ๐—ป๐—ฒ๐˜€ ๐—ณ๐—ผ๐—ฟ ๐—ฆ๐—ฐ๐—ต๐—ฒ๐—บ๐—ฎ๐˜๐—ถ๐—ฐ ๐— ๐—ฒ๐˜๐—ฟ๐—ผ ๐— ๐—ฎ๐—ฝ๐˜€ Maps of transportation networks often depict the area that is reachable within a certain amount of time from a certain start point. Usually, the boundary of this area is drawn as a line, which is called isochrone. In an article recently published in The Cartographic Journal, we present an algorithm that generates schematic isochrones for schematic network maps. Our algorithm generates isochrone maps that correctly represent travel times while being much easier to read than geographically accurate isochrone maps. Our article is part of a special issue that celebrates the 90th anniversary of Henry Beck's famous schematic map of the London Underground. https://lnkd.in/eDGr3yr6 #Isochrones #SchematicMaps #Algorithms #HenryBeck #Research

To view or add a comment, sign in