Approximate $k$-Nearest Neighbor Graph on Moving Points
In this paper, we introduce an approximation for the $k$-nearest neighbor graph ($k$-NNG) on a point set $P$ in $\mathbb{R}^d$. For any given $\varepsilon>0$, we construct a graph, that we call the \emph{approximate $k$-NNG}, where the edge with the $i$th smallest length incident to a point $p$ i...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2023-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_26356_e43137e88ed08bf405990ce3538fd339.pdf |