Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.contributor | Department of Land Surveying and Geo-Informatics | en_US |
| dc.creator | Koo, Wai-chung | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/837 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | GIS-T application development : a road network path finding system with ORDBMS concepts and an OO programming approach | en_US |
| dcterms.abstract | Transportation infrastructure has long been viewed as an indispensable element for regional economic development. In order to achieve a better transportation planning strategy, more transport specialists rely on information technology. As a consequence, the implementation of Geographic Information System for Transportation or the so-called Intelligent Transportation System is now a hot topic in different transportation studies. As the transportation network is a highly localized phenomenon, modeling the transport network with respect to the physical settings constitutes a main source of challenge in GIS-T application development. It involves the construction of an effective data representation and database design with respect to the subject transportation network. Without the proper database model, the resultant GIS-T application will be less likely to have further improvement on its own functional capability. For this reason, Hong Kong road transport network is selected as the study area of a prototype path finding system in attempt to uncover the problems associated with the road network data modeling and database design. In view of rapid technological advancement, new database management concepts and programming tools are now being applied to the GTS-T application development. With these new concepts, the data modeling and the application implementation processes are subjected to drastic changes. To illustrate these issues, a prototype path finding system project will be initiated with the application of the new technological innovations so as to investigate the cost and the benefit involved in the developmental processes. The compliance of the new technological innovations with the old path finding algorithm is another concern of this thesis. Applying Dijkstra's shortest path algorithm into the new database structure with the Object-relational programming approach will elucidate this issue. Through the implementation of the prototype application, a more clear insight into nowadays GIS-T application development can be brought out with its future possibilities and potentials in various transportation applications. | en_US |
| dcterms.extent | vi, 84, [19] leaves : ill. (some col.) ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2002 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.LCSH | Transportation -- China -- Hong Kong | en_US |
| dcterms.LCSH | Geographic information systems -- China -- Hong Kong | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b16210396.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 8.56 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/837