Finding the shortest path under polygonal obstacle constraints
Yan Xu, Dawei Liu · 2016
This paper discusses the problem of road network navigation under polygonal obstacle constraints from an implementation perspective.It implements the problem provided by the 4th ACM SIGSPATIAL GIS Cup 2015 challenge.In the context, it briefly examines some fundamental graph search algorithms and then primarily demonstrates the notes on the implementation of A* algorithm on the dataset of San Francisco from OpenStreetMap.