Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor

Bichromatic reverse nearest neighbor (BRNN) has been ex- tensively studied in spatial database literature. In this pa- per, we study a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs. Such a problem has many real life applications, including the prob- lem of finding a new server point that attracts as many cus- tomers as possible by proximity. A straightforward approach is to determine the BRNNs for all possible points that are not feasible since there are a large (or infinite) number of possible points. To the best of our knowledge, the fastest known method has exponential time complexity on the data size. Based on some interesting properties of the problem, we come up with an efficient algorithm called MaxOverlap. Extensive experiments are conducted to show that our algo- rithm is many times faster than the best-known technique.