Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Land Surveying and Geo-Informatics | en_US |
| dc.creator | Jiao, Gengwei | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/6134 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Realization and comparison of routing algorithm based on mobile platform | en_US |
| dcterms.abstract | Mobile GIS is a new trend in GIS field. The limited storage space and computing power limit the efficiency of GIS functions. How to deal with such a large quantity of GIS data is a key problem when transplant GIS applications into mobile phone. Routing is one of the classic GIS applications. The shortest path query function embedded in mobile phone will greatly facilitate people's lives. This paper introduces a method to process data with large size and compares the performance of two popular path finding algorithms, Dijkstra's algorithm and A* algorithm, on mobile platform. | en_US |
| dcterms.extent | viii, 75 leaves : ill., maps ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2011 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Mobile geographic information systems | en_US |
| dcterms.LCSH | Mobile communication systems | en_US |
| dcterms.LCSH | Algorithms | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b24453006.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 1.24 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/6134