Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications

03/18/2021
by   Valentin Buchhold, et al.
0

Customizable contraction hierarchies are one of the most popular route planning frameworks in practice, due to their simplicity and versatility. In this work, we present a novel algorithm for finding k-nearest neighbors in customizable contraction hierarchies by systematically exploring the associated separator decomposition tree. Compared to previous bucket-based approaches, our algorithm requires much less target-dependent preprocessing effort. Moreover, we use our novel approach in two concrete applications. The first application are online k-closest point-of-interest queries, where the points of interest are only revealed at query time. We achieve query times of about 25 milliseconds on a continental road network, which is fast enough for interactive systems. The second application is travel demand generation. We show how to accelerate a recently introduced travel demand generator by a factor of more than 50 using our novel nearest-neighbor algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/22/2017

Efficient Nearest-Neighbor Search for Dynamical Systems with Nonholonomic Constraints

Nearest-neighbor search dominates the asymptotic complexity of sampling-...
06/28/2019

PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors

We present PUFFINN, a parameterless LSH-based index for solving the k-ne...
04/30/2022

Chromatic k-Nearest Neighbor Queries

Let P be a set of n colored points. We develop efficient data structures...
03/13/2020

mmLSH: A Practical and Efficient Technique for Processing Approximate Nearest Neighbor Queries on Multimedia Data

Many large multimedia applications require efficient processing of neare...
07/29/2021

Safest Nearby Neighbor Queries in Road Networks (Full Version)

Traditional route planning and k nearest neighbors queries only consider...
09/28/2018

Predicting Destinations by Nearest Neighbor Search on Training Vessel Routes

The DEBS Grand Challenge 2018 is set in the context of maritime route pr...
06/27/2019

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

Graph partitioning has many applications. We consider the acceleration o...