A Pruning Algorithm for Reverse Nearest Neighbors in Directed Road Networks
In this paper, we studied the problem of continuous reverse k nearest neighbors (RkNN) in directed road network, where a road segment can have a particular orientation. A RNN query returns a set of data objects that take query point as their nearest neighbor. Although, much research has been done fo...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Atlantis Press
2015-11-01
|
| Series: | International Journal of Networked and Distributed Computing (IJNDC) |
| Subjects: | |
| Online Access: | https://www.atlantis-press.com/article/25841977.pdf |