Is Euclidean Distance Really that Bad with Road Networks?
Hua Hua, Hairuo Xie, Egemen Tanin
PROCEEDINGS OF THE 11TH ACM SIGSPATIAL INTERNATIONAL WORKSHOP ON COMPUTATIONAL TRANSPORTATION SCIENCE (IWCTS 2018) | ASSOC COMPUTING MACHINERY | Published : 2018
Spatial queries play an important role in many transportation services. Existing solutions to spatial queries commonly rely on the measurement of road network distance, which is the length of the shortest path from one point to another in a road network. Due to the high computation cost of measuring road network distance, a service provider may not be able to handle all the queries in a timely manner. We are interested in Euclidean distance-based solutions to spatial queries as Euclidean distance is significantly cheaper to compute than road network distance. A common view is that Euclidean distance is not suitable for solving any spatial query in road networks as road network distance can b..View full abstract