Reverse Furthest Neighbors Query in Road Networks

Given a road network G = （V, E）, where V（E） denotes the set of vertices（edges） in G, a set of points of interest P and a query point q residing in G, the reverse furthest neighbors （RFNR） query in road networks fetches a set of points p ∈ P that take q as their furthest neighbor compared with all po...

Ausführliche Beschreibung