Dissertation > Excellent graduate degree dissertation topics show
Application of Dijkstra Algorithm in MAPGIS to Broaden and Realize Function
Author: WuYiMing
Tutor: GaoXiangJunï¼›YuanChun
School: Chinese Geology University (Beijing)
Course: Management of land resources
Keywords: Dijkstra's algorithm MAPGIS Wayfinding design
CLC: P208
Type: Master's thesis
Year: 2008
Downloads: 213
Quote: 1
Read: Download Dissertation
Abstract
|
With the proliferation of computers and the development of geographic information science, GIS has been increasingly extensive and in-depth applications because of its powerful features. GIS network analysis is the study of GIS hot and difficult, and the shortest path problem is GIS network analysis of the most basic and the most critical issues, and has direct application in many ways, in-depth study of the people on the shortest path algorithm never stopped . Classic graph theory and the effective integration of the continuous development of computer data structures and algorithms, the new emerging shortest path algorithm. Dijkstra's algorithm is the basis of most systems theory to solve the shortest path problem. The advantages of Dijkstra's algorithm is a simple program design, versatility. The purpose of this research is the realization of this combination of the two applications. MAPGIS software of mainstream geographic information system software, powerful, and widely used. However, no direct pathfinding function in MAPGIS. In MAPGIS with the establishment of nodes, distance measurement and other operations the application route selection function envisaged to achieve the natural conditions. Derivative algorithm performance as similar their own best Dijkstra algorithm can just supplement to achieve this functionality. Therefore, this study is very practical significance. Newly added in the course of the study, through the MAPGIS points in WT documents and WL line file attributes, constitute the basis of the Dijkstra algorithm application. Node ID, node name. A representation of the start and end points of the path the transmission parameters of the Dijkstra algorithm function, the path explicitly represented according to the obtained path by Dijkstra algorithm function is identified by the node of the path represented in the drawings; node distance, i.e. Results the relationship between the points. The distance between the node is the foundation and basic data routing, precisely because of the distance between the nodes, one node to another node can have more than a collection of distance that path. The algorithmic functions this filter distance collection drawn the shortest distance path. Point file and line file initialization, and the MAPGIS corresponds to the editorial content in the outcome interface. Interface showing Dijkstra algorithm can find out the shortest path of two nodes, in order to obtain its implementation and application of the MAPGIS. To achieve the desired effect plug achievements through research and debugging in practical applications, can accurately got to find the shortest path of two selected nodes successfully MAPGIS and Dijkstra algorithm combined with a description of the study rationality and feasibility. In-depth analysis of the plug results and the land of scientific work contact, the research has potential applications in land area.
|
Related Dissertations
- Study on the Engineering Properties of Loess and the Stability of Loess Slope Along a Railway,U212.22
- Application of Drilling Information Analysis and Supervise by MAPGIS,P208
- The Design and Implement of the GIS-Based Resource Management System for Ningxia Telecom,TP311.52
- Design and Study on the Dynamic Monitoring Information System of Urban Land Price,F293.2
- The Research of Karst Collapse Risk Assessment and Karst Water Resource Conservation of North China,P642.25
- Application of the Weights of Evidence Model Basied on GIS to Prediction of Iron Ore Deposits in Liaoning Province,P618.31
- Prediction of Mining Surface Movement and Deformation Based on GIS,TD325
- Design and development of GIS-based database management system of mineral resources reserves,TP311.52
- Qingyuan Mountain scenic tourism in GIS Resource Management Information System Design and Implementation of,F592.7
- Based on MapGIS forest resources planning and design achievements production technology,S757.4
- Climate Impact Research Division and Based on GIS Method of Asphalt Pavement in Hunan Province,U416.217
- UAV flight path planning studies based on genetic algorithm,V249.1
- A Study on the Mine Environment Information System Based on GIS in Handan,P208
- Based on MAPGIS small Cadastral Management Information System,P208
- Assessment and Prevention of Geological Hazards in Qingdao Based on MapGIS,P694
- The Construction and Implementation of Huanghuai Plain Straw Resources Information System,P208
- A Method of Potential Prediction of Coal on mapgis,P618.11
- Mining Subsidence Prediction and Analysis System Based on MAPGIS,TD325.2
- Construction of Cadastral Database,P208
- Urban and rural land management information system design and research,P208
- The Construction of Geo-Spatial Database and Delineation of Target about Xunyang,P208
CLC: > Astronomy,Earth Sciences > Surveying and Mapping > General issues > Mapping database and information system
© 2012 www.DissertationTopic.Net Mobile
|