arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0808.3694cs.CG
收藏

用数学透镜研究道路网的几何图形特性

Studying Geometric Graph Properties of Road Networks Through an Algorithmic Lens

David Eppstein, Michael T. Goodrich

摘要:

本文从算法的角度研究了现实世界的道路网络,重点是实证研究,产生有用的属性的道路网络,可以利用在设计快速算法,处理地理数据。与以前的方法不同,我们的研究不是基于道路网络是平面图的假设。事实上,基于我们已经进行了一些实验的道路网络的50个美国和哥伦比亚特区,我们提供了强有力的经验证据,道路网络是相当非平面的。因此,我们的方法,而不是针对寻找算法的动机属性的道路网络作为非平面几何图形,专注于道路网络的替代属性,仍然可以导致有效的算法,如最短路径和沃罗诺伊图。特别是,我们研究道路网络的多尺度分散图,这是一个概念,我们正式的磁盘邻域系统。这种方法使我们能够开发快速算法的道路网络,而不作任何额外的假设边缘权重的分布。事实上,我们的算法可以允许非度量权重。

英文摘要:

This paper studies real-world road networks from an algorithmic perspective, focusing on empirical studies that yield useful properties of road networks that can be exploited in the design of fast algorithms that deal with geographic data. Unlike previous approaches, our study is not based on the assumption that road networks are planar graphs. Indeed, based on the a number of experiments we have performed on the road networks of the 50 United States and District of Columbia, we provide strong empirical evidence that road networks are quite non-planar. Our approach therefore instead is directed at finding algorithmically-motivated properties of road networks as non-planar geometric graphs, focusing on alternative properties of road networks that can still lead to efficient algorithms for such problems as shortest paths and Voronoi diagrams. In particular, we study road networks as multiscale-dispersed graphs, which is a concept we formalize in terms of disk neighborhood systems. This approach allows us to develop fast algorithms for road networks without making any additional assumptions about the distribution of edge weights. In fact, our algorithms can allow for non-metric weights.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑