Abstract
ABSTRACT In the context of public transportation, isochrone maps display the area accessible from a starting point within a given travel time. Transit networks are often displayed using a schematic representation, where each edge is restricted to a given set of orientations. In this article, we present an algorithm for generating Metrochrones, which are schematic isochrones enclosing the reachable area of a transit map. The isochrones are restricted to the same set of orientations as the underlying transit map. Our approach guarantees that the isochrones correctly separate the reachable and unreachable stations in the network. Moreover, the result is optimized towards a simple visualization by (a) minimizing the number of bends in the isochrone, (b) forcing the isochrone away from lines in the transit network, and (c) avoiding small crossing angles. We show that our approach can easily be extended to other isolines, such as travel fares.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
