Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\mathbb{R}^d$.
Zahed RahmatiMohammad Ali AbamPublished in: CoRR (2013)
Keyphrases
- nearest neighbor
- data structure
- graph structure
- random walk
- index structure
- special case
- k nearest neighbor
- data points
- vertex set
- structured data
- connected components
- directed graph
- efficient data structures
- bipartite graph
- knn
- weighted graph
- high dimensional
- data sets
- rate distortion
- graph theory
- graph model
- graph databases
- decision boundary
- nearest neighbor search
- nearest neighbor algorithm
- monte carlo
- distance function
- spanning tree
- graph theoretic
- reverse nearest neighbor