Year: 2014
Type: preprint
Abstract: This paper provides the first solution to the kinetic reverse $k$-nearest neighbor (\rknn) problem in $\mathbb{R}^d$, which is defined as follows: Given a set $P$ of $n$ moving points in arbitrary but fixed dimension $d$, an integer $k$, and a query point $q\notin P$ at any time $t$, report all the points $p\in P$ for which $q$ is one of the $k$-nearest neighbors of $p$.
Source: arXiv (Cornell University)
Authors: Rahmati, Zahed, King, Valerie, Whitesides, Sue
Institutions: University of Waterloo, University of Victoria
Language: English
Subfield: Signal Processing
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2953281969