SPASTC：用于可扩展旅行时间计算的空间分区算法

IF 4.3 1区地球科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

International Journal of Geographical Information Science Pub Date : 2024-03-13 DOI:10.1080/13658816.2024.2326445

A. C. Michels, J. Park, J.-Y. Kang, S. Wang

引用次数: 0

摘要

大型交通网络的旅行时间计算通常需要大量计算，主要原因有两个：1) 处理大型网络需要大量的计算机内存；2) 计算大型交通网络的旅行时间需要大量的计算资源。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

SPASTC: a Spatial Partitioning Algorithm for Scalable Travel-time Computation

Travel-time computation with large transportation networks is often computationally intensive for two main reasons: 1) large computer memory is required to handle large networks; and 2) calculating...

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Geographical Information Science 地学-计算机：信息系统

CiteScore

11.00

自引率

7.00%

发文量

审稿时长

9 months

期刊介绍： International Journal of Geographical Information Science provides a forum for the exchange of original ideas, approaches, methods and experiences in the rapidly growing field of geographical information science (GIScience). It is intended to interest those who research fundamental and computational issues of geographic information, as well as issues related to the design, implementation and use of geographical information for monitoring, prediction and decision making. Published research covers innovations in GIScience and novel applications of GIScience in natural resources, social systems and the built environment, as well as relevant developments in computer science, cartography, surveying, geography and engineering in both developed and developing countries.