| 一种适合于移动定位的路径搜索算法 |
| |
| 引用本文： | 谭志强,廖湖声.一种适合于移动定位的路径搜索算法[J].计算机应用与软件,2008,25(7). |
| |
| 作者姓名： | 谭志强 廖湖声 |
| |
| 作者单位： | 北京工业大学计算机学院,北京,100022 |
| |
| 摘 要： | 随着3G时代的来临,在快速发展LBS业务中,一个重要功能是获得手机与手机之间或手机到地图上指定位置的最短路径.通过将路网划分成主干网与支路网,并且使用二级R*树来索引路网边,给出了一种获取手机周边道路与计算最短路径的算法.分析了该算法的复杂度,在适当划分主干网与支路网后,该算法可以缩小搜索空间,提高搜索性能.
|
| 关 键 词： | LBS 最短路径 路网 移动定位 |
A PATH SEARCHING ALGORITHM FOR MOBILE LOCATION SERVICE |
| |
| Tan Zhiqiang,Liao Husheng.A PATH SEARCHING ALGORITHM FOR MOBILE LOCATION SERVICE[J].Computer Applications and Software,2008,25(7). |
| |
| Authors: | Tan Zhiqiang Liao Husheng |
| |
| Affiliation: | Tan Zhiqiang Liao Husheng(College of Computer Science , Technology,Beijing University of Technology,Beijing 100022,China) |
| |
| Abstract: | With the rapid development of 3G mobile services,LBS software will play a more important role.Therefore it is crucial to obtain the shortest path between two cell phones or between a cell phone and a position on map.Based on the 2-level R-tree indexed road network and the division of road network to backbone and branches,a new algorithm is presented to get the nearest edges of road network to a cell phone position and to calculate the shortest path.The algorithm can greatly reduce the searching space and in... |
| |
| Keywords: | LBS Shortest path Road network Mobile location |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
