Customizable Point-of-Interest Queries in Road Networks
Abstract—Customizable Point-of-Interest Queries in Road Networks. We present a unified framework for dealing with exact point-of-interest < Final Year Projects 2016 > POI queries in dynamic continental road networks within interactive applications.We show that partition-based algorithms developed for point-to-point shortest path computations can be naturally extended to handle augmented queries such as finding the closest restaurant or the best post office to stop on the way home, always ranking POIs according to a user-defined cost function. Our solution allows different trade-offs between indexing effort (time and space) and query time. Our most ﬂexible variant allows the road network to change frequently (to account for trafﬁc information or personalized cost functions) and the set of POIs to be speciﬁed at query time.