Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks

Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks

The order <i>k</i> 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...

Full description

Bibliographic Details
Main Authors: Bi Yu Chen, Huihuang Huang, Hui-Ping Chen, Wenxuan Liu, Xuan-Yan Chen, Tao Jia
Format: Article
Language:English
Published: MDPI AG 2023-04-01
Series:ISPRS International Journal of Geo-Information
Subjects:
order <i>k</i> Voronoi diagrams
network Voronoi diagrams
network analysis
place-based accessibility
transport informatics
socio-spatial computing
Online Access:https://www.mdpi.com/2220-9964/12/4/172

Internet

https://www.mdpi.com/2220-9964/12/4/172

Similar Items