poster

Defining isochrones in multimodal spatial networks

Authors:

Michael Böhlen,

Markus InnerebnerAuthors Info & Claims

CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management

Pages 2381 - 2384

https://doi.org/10.1145/2063576.2063972

Published: 24 October 2011 Publication History

Abstract

An isochrone in a spatial network is the minimal, possibly disconnected subgraph that covers all locations from where a query point is reachable within a given time span and by a given arrival time. In this paper we formally define isochrones for multimodal spatial networks with different transportation modes that can be discrete or continuous in, respectively, space and time. For the computation of isochrones we propose the multimodal incremental network expansion (MINE) algorithm, which is independent of the actual network size and depends only on the size of the isochrone. An empirical study using real-world data confirms the analytical results.

References

[1]

V. Balasubramanian, D. V. Kalashnikov, S. Mehrotra, and N. Venkatasubramanian. Efficient and scalable multi-geography route planning. In EDBT, 2010.

Digital Library

[2]

V. Bauer, J. Gamper, R. Loperfido, S. Profanter, S. Putzer, and I. Timko. Computing isochrones in multi-modal, schedule-based transport networks. In ACMGIS, 2008.

Digital Library

[3]

H.-J. Cho and C.-W. Chung. An efficient and scalable approach to CNN queries in a road network. In VLDB, 2005.

Digital Library

[4]

V. T. de Almeida and R. H. Güting. Using Dijkstra's algorithm to incrementally find the k-nearest neighbors in spatial network databases. In SAC, pages 58--62, 2006.

Digital Library

[5]

K. Deng, X. Zhou, H. T. Shen, S. W. Sadiq, and X. Li. Instance optimal query processing in spatial networks. VLDB J., 18(3):675--693, 2009.

Digital Library

[6]

E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269--271, 1959.

Digital Library

[7]

B. Ding, J. X. Yu, and L. Qin. Finding time-dependent shortest paths over large graphs. In EDBT, 2008.

Digital Library

[8]

A. Gubichev, S. Bedathur, S. Seufert, and G. Weikum. Fast and accurate estimation of shortest paths in large graphs. In CIKM, pages 499--508, New York, NY, USA, 2010. ACM.

Digital Library

[9]

P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transations on Systems Science and Cybernetics, 4(2):100--107, 1968.

[10]

R. Huang. A schedule-based pathfinding algorithm for transit networks using pattern first search. GeoInformatica, 11(2):269--285, 2007.

Digital Library

[11]

N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng., 10(3):409--432, 1998.

Digital Library

[12]

E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on a road network with speed patterns. In ICDE, 2006.

Digital Library

[13]

M. R. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB, pages 840--851, 2004.

Digital Library

[14]

D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB, 2003.

Digital Library

[15]

M. Potamias, F. Bonchi, C. Castillo, and A. Gionis. Fast shortest path distance estimation in large networks. In CIKM, pages 867--876, 2009.

Digital Library

[16]

H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In SIGMOD Conference, pages 43--54, 2008.

Digital Library

Cited By

Zini ARoberto RCorrias PFelici BNoussan M(2024)Accessibility Measures to Evaluate Public Transport Competitiveness: The Case of Rome and TurinSmart Cities10.3390/smartcities70601297:6(3334-3354)Online publication date: 2-Nov-2024
https://doi.org/10.3390/smartcities7060129
Buonocore CCarlucci FCiciarelli LPapola ATinessa FTocchi DTrincone B(2023)Accessibility analysis in spatial planning: A case of special economic zones (SEZs) in Campania, Southern ItalyLand Use Policy10.1016/j.landusepol.2023.106763132(106763)Online publication date: Sep-2023
https://doi.org/10.1016/j.landusepol.2023.106763
Forsch ADehbi YNiedermann BOehrlein JRottmann PHaunert J(2021)Multimodal travel‐time maps with formally correct and schematic isochronesTransactions in GIS10.1111/tgis.1282125:6(3233-3256)Online publication date: 31-Aug-2021
https://doi.org/10.1111/tgis.12821
Show More Cited By

Index Terms

Defining isochrones in multimodal spatial networks
1. Human-centered computing
  1. Visualization
    1. Visualization application domains
      1. Geographic visualization
2. Information systems
  1. Information systems applications
    1. Spatial-temporal systems

Recommendations

Computing Isochrones in Multimodal Spatial Networks using Tile Regions
SSDBM '17: Proceedings of the 29th International Conference on Scientific and Statistical Database Management

This paper describes a new method to compute isochrones in multimodal spatial networks, which aims at finding a good trade-off between memory usage and runtime. In the past, approaches based on Dijkstra's algorithm have been proposed. For small networks,...
Computing isochrones in multi-modal, schedule-based transport networks
GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems

Isochrones are defined as the set of all points from which a specific point of interest is reachable within a given time span. This demo paper presents a solution to compute isochrones in multi-modal, schedule-based transport networks. The system is ...
Determining objects within isochrones in spatial network databases
ADBIS'10: Proceedings of the 14th east European conference on Advances in databases and information systems

Isochrones are generally defined as the set of all space points from which a query point can be reached in a given timespan, and they are used in urban planning to conduct reachability and coverage analyzes in a city. In a spatial network representing ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management

October 2011

2712 pages

ISBN:9781450307178

DOI:10.1145/2063576

Editors:
Bettina Berendt,
Arjen de Vries,
Wenfei Fan,
Craig Macdonald
University of Glasgow, UK
,
Iadh Ounis
University of Glasgow, UK
,
Ian Ruthven
University of Strathclyde, UK

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

CIKM '11

Sponsor:

CIKM '11: International Conference on Information and Knowledge Management

October 24 - 28, 2011

Glasgow, Scotland, UK

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
326
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)3

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zini ARoberto RCorrias PFelici BNoussan M(2024)Accessibility Measures to Evaluate Public Transport Competitiveness: The Case of Rome and TurinSmart Cities10.3390/smartcities70601297:6(3334-3354)Online publication date: 2-Nov-2024
https://doi.org/10.3390/smartcities7060129
Buonocore CCarlucci FCiciarelli LPapola ATinessa FTocchi DTrincone B(2023)Accessibility analysis in spatial planning: A case of special economic zones (SEZs) in Campania, Southern ItalyLand Use Policy10.1016/j.landusepol.2023.106763132(106763)Online publication date: Sep-2023
https://doi.org/10.1016/j.landusepol.2023.106763
Forsch ADehbi YNiedermann BOehrlein JRottmann PHaunert J(2021)Multimodal travel‐time maps with formally correct and schematic isochronesTransactions in GIS10.1111/tgis.1282125:6(3233-3256)Online publication date: 31-Aug-2021
https://doi.org/10.1111/tgis.12821
Vuillemot RRivière PBeignon ATabard A(2021)Boundary Objects in Design Studies: Reflections on the Collaborative Creation of Isochrone MapsComputer Graphics Forum10.1111/cgf.1431240:3(349-360)Online publication date: 29-Jun-2021
https://doi.org/10.1111/cgf.14312
Tesfaye BAugsten NPawlik MBöhlen MJensen C(2021)Speeding Up Reachability Queries in Public Transport Networks Using Graph PartitioningInformation Systems Frontiers10.1007/s10796-021-10164-224:1(11-29)Online publication date: 14-Aug-2021
https://doi.org/10.1007/s10796-021-10164-2
Ross MHazari ZSonnert GSadler P(2020)The Intersection of Being Black and Being a WomanACM Transactions on Computing Education10.1145/337742620:2(1-15)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3377426
Kamw FAl-Dohuki SZhao YEynon TSheets DYang JYe XChen W(2020)Urban Structure Accessibility Modeling and Visualization for Joint Spatiotemporal ConstraintsIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2018.288899421:1(104-116)Online publication date: Jan-2020
https://doi.org/10.1109/TITS.2018.2888994
Tesfaye BAugsten NPawlik MBöhlen MJensen C(2020)An Efficient Index for Reachability Queries in Public Transport NetworksAdvances in Databases and Information Systems10.1007/978-3-030-54832-2_5(34-48)Online publication date: 17-Aug-2020
https://doi.org/10.1007/978-3-030-54832-2_5
Baum MBuchhold VDibbelt JWagner D(2019)Fast Exact Computation of Isocontours in Road NetworksACM Journal of Experimental Algorithmics10.1145/335551424(1-26)Online publication date: 15-Oct-2019
https://dl.acm.org/doi/10.1145/3355514
Jiang SGuan WHe ZYang L(2018)Measuring Taxi Accessibility Using Grid-Based Method with Trajectory DataSustainability10.3390/su1009318710:9(3187)Online publication date: 6-Sep-2018
https://doi.org/10.3390/su10093187
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents