Next Article in Journal
Constructing Geospatial Concept Graphs from Tagged Images for Geo-Aware Fine-Grained Image Recognition
Previous Article in Journal
Issues of Healthcare Planning and GIS: A Review
Open AccessArticle

Accurate and Efficient Calculation of Three-Dimensional Cost Distance

1
Jiangsu Provincial Key Laboratory of Geographic Information Science and Technology, Key Laboratory for Land Satellite Remote Sensing Applications of Ministry of Natural Resources, School of Geography and Ocean Science, Nanjing University, Nanjing 210023, China
2
Jiangsu Center for Collaborative Innovation in Novel Software Technology and Industrialization, Nanjing 210023, China
3
Department of Geography & Atmospheric Science, University of Kansas, Lawrence, KS 66045, USA
4
College of Geomatics, Xi‘an University of Science and Technology, Xi’an 710054, China
*
Author to whom correspondence should be addressed.
ISPRS Int. J. Geo-Inf. 2020, 9(6), 353; https://doi.org/10.3390/ijgi9060353
Received: 16 March 2020 / Revised: 16 May 2020 / Accepted: 25 May 2020 / Published: 27 May 2020
Cost distance is one of the fundamental functions in geographical information systems (GISs). 3D cost distance function makes the analysis of movement in 3D frictions possible. In this paper, we propose an algorithm and efficient data structures to accurately calculate the cost distance in discrete 3D space. Specifically, Dijkstra’s algorithm is used to calculate the least cost between initial voxels and all the other voxels in 3D space. During the calculation, unnecessary bends along the travel path are constantly corrected to retain the accurate least cost. Our results show that the proposed algorithm can generate true Euclidean distance in homogeneous frictions and can provide more accurate least cost in heterogeneous frictions than that provided by several existing methods. Furthermore, the proposed data structures, i.e., a heap combined with a hash table, significantly improve the algorithm’s efficiency. The algorithm and data structures have been verified via several applications including planning the shortest drone delivery path in an urban environment, generating volumetric viewshed, and calculating the minimum hydraulic resistance. View Full-Text
Keywords: voxel; Dijkstra’s algorithm; minimum heap; route planning; viewshed; hydraulic resistance voxel; Dijkstra’s algorithm; minimum heap; route planning; viewshed; hydraulic resistance
Show Figures

Figure 1

MDPI and ACS Style

Chen, Y.; She, J.; Li, X.; Zhang, S.; Tan, J. Accurate and Efficient Calculation of Three-Dimensional Cost Distance. ISPRS Int. J. Geo-Inf. 2020, 9, 353.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop