Next Article in Journal
Investigating Geomorphic Change Using a Structure from Motion Elevation Model Created from Historical Aerial Imagery: A Case Study in Northern Lake Michigan, USA
Previous Article in Journal
SLBRIN: A Spatial Learned Index Based on BRIN
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks

1
State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430079, China
2
Collaborative Innovation Center of Geospatial Technology, Wuhan University, Wuhan 430079, China
3
Hubei Luojia Laboratory, Wuhan 430079, China
4
Geocomputation Center for Social Sciences, Wuhan University, Wuhan 430079, China
5
School of Management, Huazhong University of Science and Technology, Wuhan 430074, China
6
School of Remote Sensing and Information Engineering, Wuhan University, Wuhan 430079, China
*
Author to whom correspondence should be addressed.
ISPRS Int. J. Geo-Inf. 2023, 12(4), 172; https://doi.org/10.3390/ijgi12040172
Submission received: 4 February 2023 / Revised: 4 April 2023 / Accepted: 6 April 2023 / Published: 19 April 2023

Abstract

The order k Voronoi diagram (OkVD) is an effective geometric construction to partition the geographical space into a set of Voronoi regions such that all locations within a Voronoi region share the same k nearest points of interest (POIs). Despite the broad applications of OkVD in various geographical analysis, few efficient algorithms have been proposed to construct OkVD in real road networks. This study proposes a novel algorithm consisting of two stages. In the first stage, a new one-to-all k shortest path finding procedure is proposed to efficiently determine the shortest paths to k nearest POIs for each node. In the second stage, a new recursive procedure is introduced to effectively divide boundary links within different Voronoi regions using the hierarchical tessellation property of the OkVD. To demonstrate the applicability of the proposed OkVD construction algorithm, a case study of place-based accessibility evaluation is carried out. Computational experiments are also conducted on five real road networks with different sizes, and results show that the proposed OkVD algorithm performed significantly better than state-of-the-art algorithms.
Keywords: order k Voronoi diagrams; network Voronoi diagrams; network analysis; place-based accessibility; transport informatics; socio-spatial computing order k Voronoi diagrams; network Voronoi diagrams; network analysis; place-based accessibility; transport informatics; socio-spatial computing

Share and Cite

MDPI and ACS Style

Chen, B.Y.; Huang, H.; Chen, H.-P.; Liu, W.; Chen, X.-Y.; Jia, T. Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks. ISPRS Int. J. Geo-Inf. 2023, 12, 172. https://doi.org/10.3390/ijgi12040172

AMA Style

Chen BY, Huang H, Chen H-P, Liu W, Chen X-Y, Jia T. Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks. ISPRS International Journal of Geo-Information. 2023; 12(4):172. https://doi.org/10.3390/ijgi12040172

Chicago/Turabian Style

Chen, Bi Yu, Huihuang Huang, Hui-Ping Chen, Wenxuan Liu, Xuan-Yan Chen, and Tao Jia. 2023. "Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks" ISPRS International Journal of Geo-Information 12, no. 4: 172. https://doi.org/10.3390/ijgi12040172

APA Style

Chen, B. Y., Huang, H., Chen, H.-P., Liu, W., Chen, X.-Y., & Jia, T. (2023). Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks. ISPRS International Journal of Geo-Information, 12(4), 172. https://doi.org/10.3390/ijgi12040172

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop