2005•Jisuanji fangzhenRequires access

Algorithms Research and Simulation of Shortest Path in GIS

Baobao Wang

Abstract

The shortest path problem is a principal issue in the application of GIS. First, with the analysis and research on the shortest path theory and implementation algorithm, the paper explains elaborately the traditional Dijkstra algorithm and A* algorithm. On the basis of the test results of existing algorithms, it optimizes the data structure and memory mode to improve the computing efficiency with the characteristics of network computing in GIS. Finally, some beneficial results are gained with the simulation of the GIS data downloaded from the National Foundation Geographic Information System (NFGIS).

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Dijkstra's algorithm, Shortest path problem, Computer science, Pathfinding, Geographic information system, Basis (linear algebra), Data mining, Path (computing)